oj.uz

Submission #20587

# Submission time Handle Problem Language Result Execution time Memory
20587 2017-02-12T13:52:37 Z model_code Laugh Analysis (IOI16_laugh) C
100 / 100
 0 ms 1212 KB 
#include "laugh_c.h"

static int max(int a, int b) {
    return a > b ? a : b;
}

int longest_laugh(char* s)
{
    int slen = strlen(s);
    int cur = 0, ans = 0;
    if (s[0] == 'a' || s[0] == 'h')
        cur++;
    for (int i = 1; i < slen; i++)
    {
        if ((s[i - 1] == 'a' && s[i] == 'h') || (s[i - 1] == 'h' && s[i] == 'a'))
            cur++;
        else 
        {
            ans = max(ans, cur);
            cur = 0;
            if (s[i] == 'a' || s[i] == 'h')
                cur++;
        }
    }
    ans = max(ans, cur);
    return ans;
}

Compilation message

laugh.c: In function 'longest_laugh':
laugh.c:9:16: warning: implicit declaration of function 'strlen' [-Wimplicit-function-declaration]
     int slen = strlen(s);
                ^
laugh.c:9:16: warning: incompatible implicit declaration of built-in function 'strlen'
laugh.c:9:16: note: include '<string.h>' or provide a declaration of 'strlen'
grader.c: In function 'main':
grader.c:9:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s);
  ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct
6 Correct 0 ms 1212 KB Output is correct
7 Correct 0 ms 1212 KB Output is correct
8 Correct 0 ms 1212 KB Output is correct
9 Correct 0 ms 1212 KB Output is correct
10 Correct 0 ms 1212 KB Output is correct
11 Correct 0 ms 1212 KB Output is correct
12 Correct 0 ms 1212 KB Output is correct
13 Correct 0 ms 1212 KB Output is correct
14 Correct 0 ms 1212 KB Output is correct
15 Correct 0 ms 1212 KB Output is correct
16 Correct 0 ms 1212 KB Output is correct
17 Correct 0 ms 1212 KB Output is correct
18 Correct 0 ms 1212 KB Output is correct
19 Correct 0 ms 1212 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct
6 Correct 0 ms 1212 KB Output is correct
7 Correct 0 ms 1212 KB Output is correct
8 Correct 0 ms 1212 KB Output is correct
9 Correct 0 ms 1212 KB Output is correct
10 Correct 0 ms 1212 KB Output is correct
11 Correct 0 ms 1212 KB Output is correct
12 Correct 0 ms 1212 KB Output is correct
13 Correct 0 ms 1212 KB Output is correct
14 Correct 0 ms 1212 KB Output is correct
15 Correct 0 ms 1212 KB Output is correct
16 Correct 0 ms 1212 KB Output is correct
17 Correct 0 ms 1212 KB Output is correct
18 Correct 0 ms 1212 KB Output is correct
19 Correct 0 ms 1212 KB Output is correct
20 Correct 0 ms 1212 KB Output is correct
21 Correct 0 ms 1212 KB Output is correct
22 Correct 0 ms 1212 KB Output is correct
23 Correct 0 ms 1212 KB Output is correct
24 Correct 0 ms 1212 KB Output is correct
25 Correct 0 ms 1212 KB Output is correct
26 Correct 0 ms 1212 KB Output is correct
27 Correct 0 ms 1212 KB Output is correct
28 Correct 0 ms 1212 KB Output is correct
29 Correct 0 ms 1212 KB Output is correct
30 Correct 0 ms 1212 KB Output is correct
31 Correct 0 ms 1212 KB Output is correct
32 Correct 0 ms 1212 KB Output is correct
33 Correct 0 ms 1212 KB Output is correct
34 Correct 0 ms 1212 KB Output is correct
35 Correct 0 ms 1212 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct
6 Correct 0 ms 1212 KB Output is correct
7 Correct 0 ms 1212 KB Output is correct
8 Correct 0 ms 1212 KB Output is correct
9 Correct 0 ms 1212 KB Output is correct
10 Correct 0 ms 1212 KB Output is correct
11 Correct 0 ms 1212 KB Output is correct
12 Correct 0 ms 1212 KB Output is correct
13 Correct 0 ms 1212 KB Output is correct
14 Correct 0 ms 1212 KB Output is correct
15 Correct 0 ms 1212 KB Output is correct
16 Correct 0 ms 1212 KB Output is correct
17 Correct 0 ms 1212 KB Output is correct
18 Correct 0 ms 1212 KB Output is correct
19 Correct 0 ms 1212 KB Output is correct
20 Correct 0 ms 1212 KB Output is correct
21 Correct 0 ms 1212 KB Output is correct
22 Correct 0 ms 1212 KB Output is correct
23 Correct 0 ms 1212 KB Output is correct
24 Correct 0 ms 1212 KB Output is correct
25 Correct 0 ms 1212 KB Output is correct
26 Correct 0 ms 1212 KB Output is correct
27 Correct 0 ms 1212 KB Output is correct
28 Correct 0 ms 1212 KB Output is correct
29 Correct 0 ms 1212 KB Output is correct
30 Correct 0 ms 1212 KB Output is correct
31 Correct 0 ms 1212 KB Output is correct
32 Correct 0 ms 1212 KB Output is correct
33 Correct 0 ms 1212 KB Output is correct
34 Correct 0 ms 1212 KB Output is correct
35 Correct 0 ms 1212 KB Output is correct
36 Correct 0 ms 1212 KB Output is correct
37 Correct 0 ms 1212 KB Output is correct
38 Correct 0 ms 1212 KB Output is correct
39 Correct 0 ms 1212 KB Output is correct
40 Correct 0 ms 1212 KB Output is correct
41 Correct 0 ms 1212 KB Output is correct
42 Correct 0 ms 1212 KB Output is correct
43 Correct 0 ms 1212 KB Output is correct
44 Correct 0 ms 1212 KB Output is correct
45 Correct 0 ms 1212 KB Output is correct
46 Correct 0 ms 1212 KB Output is correct
47 Correct 0 ms 1212 KB Output is correct
48 Correct 0 ms 1212 KB Output is correct
49 Correct 0 ms 1212 KB Output is correct
50 Correct 0 ms 1212 KB Output is correct
51 Correct 0 ms 1212 KB Output is correct