oj.uz

Submission #592384

# Submission time Handle Problem Language Result Execution time Memory
592384 2022-07-09T06:36:53 Z starchan Laugh Analysis (IOI16_laugh) C++17
100 / 100
 5 ms 704 KB 
#include<bits/stdc++.h>
#include "laugh.h"
using namespace std;
#define int long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
string life;
struct fieldtype
{
	int pref, suff, len, sub;
};
fieldtype value(int l, int r)
{
	fieldtype val;
	int m = (l+r)/2;
	if(l==r)
	{
		if(life[m] == 'a' || life[m] == 'h')
		{
			val.pref = 1;
			val.suff = 1;
			val.len = 1;
			val.sub = 1;
		}
		else
		{
			val.pref = 0;
			val.suff = 0;
			val.len = 1;
			val.sub = 0;
		}
		return val;
	}
	fieldtype d1 = value(l, m);
	fieldtype d2 = value(m+1, r);
	val.pref = max(d1.pref, ((d1.pref==d1.len) && (life[m]!=life[m+1]))*(d1.len+d2.pref));
	val.suff = max(d2.suff, ((d2.suff==d2.len) && (life[m]!=life[m+1]))*(d2.len+d1.suff));
	val.len = d1.len+d2.len;
	val.sub = max({d1.sub, d2.sub, (life[m]!=life[m+1])*(d1.suff+d2.pref)});
	return val;
}
signed longest_laugh(string s)
{
	life = s;
	return value(0, life.length()-1).sub; 
}

Subtask #1
21.0 / 21.0

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

Subtask #2
26.0 / 26.0

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

Subtask #3
53.0 / 53.0

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