CSES - Datatähti 2016 alku - Results
Submission details
Task:Osajono
Sender:Razbit
Submission time:2015-09-29 15:09:19
Language:C++
Status:READY
Result:39
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED27
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.06 s2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.05 s2details
#110.05 s3details
#120.05 s3details
#130.05 s3details
#140.06 s3details
#150.05 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:16:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", buf);
                     ^

Code

/* Osajono.cpp -- Datatahti 2016 tehtava osajono
 *
 * Eetu "Razbit" Pesonen, 2015
 */

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

using namespace std;

int main()
{
    // Max input string length 10^5
    char* buf = (char*)malloc(10001 * sizeof(char));
    scanf("%s", buf);

    // for counting occurences
    int* table = (int*)malloc(256 * sizeof(int));
    memset(table, 0, 256);
    
    // Even one character counts as a substr
    int num = strlen(buf);

    // Count occurences of each char in the string
    for(unsigned int i = 0; i < strlen(buf); i++)
    {
        table[(int)buf[i]] += 1;
    }

    int n;
    for(unsigned int i = 0; i < 256; i++)
    {
        n = table[i];
        if (n)
            num += (n*n-n)/2;
    }

    printf("%i\n", num);
    
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
BBBAABBBAAAABBAAAABAABAABBBBBB...

correct output
2554

user output
2554

Test 2

Group: 1

Verdict: ACCEPTED

input
GDFVYWQCZAFGICSXOSWBZMGPDBSSVL...

correct output
299

user output
299

Test 3

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAZAAAA...

correct output
4314

user output
4314

Test 4

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4231

user output
4231

Test 5

Group: 1

Verdict: ACCEPTED

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
5050

user output
5050

Test 6

Group: 2

Verdict: ACCEPTED

input
BBABABBBABBAABBABBABAABAAABABA...

correct output
6253029

user output
6253029

Test 7

Group: 2

Verdict: ACCEPTED

input
RBKJMLDVQMKHYKCNDIVVKOMFUXTFMG...

correct output
485173

user output
485173

Test 8

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
12427725

user output
12427725

Test 9

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
12467549

user output
12467549

Test 10

Group: 2

Verdict: ACCEPTED

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
12502500

user output
12502500

Test 11

Group: 3

Verdict:

input
BAAAAABABBABAABAABABABBBABBAAB...

correct output
2500051369

user output
-1192658914

Test 12

Group: 3

Verdict:

input
ABBURXDRVXAYBPXXOQZNYHLWGUEEWR...

correct output
192407124

user output
683652556

Test 13

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4998050400

user output
-1223070822

Test 14

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4998850144

user output
-2087077434

Test 15

Group: 3

Verdict:

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
5000050000

user output
1877152070