oj.uz

Submission #40366

# Submission time Handle Problem Language Result Execution time Memory
40366 2018-01-31T12:05:29 Z model_code Segments (IZhO18_segments) C++11
100 / 100
 2844 ms 13376 KB 
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <ctime>

#define pb push_back
#define ll long long
#define mp make_pair
#define f first
#define s second
#define pii pair < int, int >
#define ull unsigned long long
#define pll pair < ll, ll >
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it ++)
#define all(s) s.begin(), s.end()
#define sz(a) (int)a.size()

const int inf = (1ll << 30) - 1;
const int maxn = (int) 1e5 + 10;

inline int min(int a, int b){
	if(a<b) return a;
	return b;
}
inline int max(int a, int b){
	if(a>b) return a;
	return b;
}

using namespace std;

int A[544][544];
int B[544][544];
int L_pos[200200];
int R_pos[200200];
int pos[200200];
const int KK = 430;
int K = 4;
int G[744][944];
int L[744][944];
int R[744][944];
int szG[744];
int szL[744];
int szR[744];
int l[200200];
int r[200200];
int GOOD[2944];
int GG = 0;
int BAD[2944];
int BB = 0;
void add(int id){
	GOOD[GG++] = id;
}
int bad[200200];
void del(int id){
	BAD[BB++] = id;
	bad[id] = 1;
}

bool cmpL(int i, int j){
	if(l[i] != l[j]) return l[i] > l[j];
	return i < j;
}
bool cmpR(int i, int j){
	if(r[i] != r[j]) return r[i] < r[j];
	return i < j;
}
bool cmpG(int i, int j){
	if(r[i] - l[i] != r[j] - l[j]) return r[i] - l[i] > r[j] - l[j];
	return i < j;
}

int was[200200];
int pref[2020];
int T;
int get(int a, int b, int k){
	if(b - a + 1 < k) return 0;
	int I = 1, J = K - 1, c = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szG[mid]>0 && r[G[mid][0]] - l[G[mid][0]] + 1 >= k){
			c = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}

	int ans = pref[c-1];
	I = 1, J = K-1;
	int d = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szR[mid]>0 && r[R[mid][0]] < a + k - 1){
			d = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}
	I = 1, J = K-1;
	int e = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szL[mid]>0 && l[L[mid][0]] > b - k + 1){
			e = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}
	ans -= A[c-1][e-1];
	
	ans -= B[c-1][d-1];
	++T;
	for(int i = 0; i < szG[c]; i++){
		int id = G[c][i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) ans++;
	}
	for(int i = 0; i < szL[e]; i++){
		int id = L[e][i];
		if(pos[id] >= c) continue;
		if(R_pos[id] < d) continue;
		if(min(r[id], b) - max(a, l[id]) + 1 < k) --ans;
		was[id] = T;
	}
	for(int i = 0; i < szR[d]; i++){
		int id = R[d][i];
		if(pos[id] >= c || was[id] == T) continue;
		if(L_pos[id] < e) continue;
		if(min(r[id], b) - max(a, l[id]) + 1 < k) --ans;
	}
	for(int i = 0; i < GG; i++){
		int id = GOOD[i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) ++ans;
	}
	for(int i = 0; i <BB; i++){
		int id = BAD[i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) --ans;
	}
	return ans;
}

int a[200200];
int sz = 0;
void recalc(){
	for(int i = 1; i < K; i++){
		for(int j = 1; j < K; j++){
			A[i][j] = 0;
			B[i][j] = 0;
		}
	}
	
	sz = 0;
	int st = 0;
	sort(GOOD, GOOD + GG, cmpR);
	for(int i = 1; i < K; i++){
		for(int j = 0; j < szR[i];j++) {
			if(bad[R[i][j]]) continue;
			while(st < GG && cmpR(GOOD[st], R[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = R[i][j];
		}
		szR[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	for(int i = 0 ; i < sz; i++){
		int ind = i/KK + 1;
		R_pos[a[i]] = ind;
		R[ind][szR[ind]++] = a[i];
	}
	sz = 0;

	st = 0;
	sort(GOOD, GOOD + GG, cmpL);
	for(int i = 1; i < K; i++){
		for(int j = 0; j < szL[i];j++) {
			if(bad[L[i][j]]) continue;
			while(st < GG && cmpL(GOOD[st], L[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = L[i][j];
		}
		szL[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	for(int i = 0 ; i < sz; i++){
		int ind = i/KK + 1;
		L_pos[a[i]] = ind;
		L[ind][szL[ind]++] = a[i];
	}
	sz = 0;
		st = 0;
	sort(GOOD, GOOD + GG, cmpG);
	for(int i = 1; i < K; i++){
		
		for(int j = 0; j < szG[i];j++) {
			if(bad[G[i][j]]) continue;
			while(st < GG && cmpG(GOOD[st], G[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = G[i][j];
		}
		szG[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	GG = 0;
	BB = 0;
	for(int i = 0; i < sz; i++){
		int ind = i/KK + 1;
		pos[a[i]] = ind;
		G[ind][szG[ind]++] = a[i];
		A[ind][L_pos[a[i]]]++;
		B[ind][R_pos[a[i]]]++;
	}
	K = sz/KK + 2;

	for(int i = 1; i < K; i++){
		for(int j = 1; j < K; j++){
			A[i][j] += A[i][j-1] + A[i-1][j] - A[i-1][j-1];
			B[i][j] += B[i][j-1] + B[i-1][j] - B[i-1][j-1];
		}
	}
	for(int i = 1; i < K; i++){
		pref[i] = pref[i-1] + szG[i];
	}
}
void solve(){
	int q;
	int G;
	scanf("%d%d", &q, &G);
	int id = 1;
	vector<int> ans;
	int last = 0;
	int lastans = 0;
	for(int i = 0, ty, a, b, k; i < q; i++){
		scanf("%d", &ty);
		if(GG + BB == 700) {
			recalc();
		}
		if(ty == 1){
			scanf("%d%d", &l[id], &r[id]);
			l[id] = l[id]^(lastans*G);
			r[id] = r[id]^(lastans*G);
			if(l[id] > r[id]) swap(l[id], r[id]);
			add(id);
			++id;
		}
		else if(ty==2){
			scanf("%d", &a);
			del(a);
		}
		else if(ty == 3){
			scanf("%d%d%d", &a, &b, &k);
			
			a = a^(lastans*G);
			b = b^(lastans*G);
			if(a>b) swap(a, b);
			lastans = get(a, b, k);
			++last;
			ans.pb(lastans);
		}
	}
	forit(it, ans){
		printf("%d\n", *it);
	}
}

int main () {
	#ifdef LOCAL
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#endif
    int t=1;
    //scanf("%d", &t);
    for(int i=1; i <= t; i++){
      //printf("Case #%d\n", i);
      solve();
    }

    return 0;
}

Compilation message

segments.cpp: In function 'void solve()':
segments.cpp:263:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &q, &G);
                       ^
segments.cpp:269:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &ty);
                   ^
segments.cpp:274:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &l[id], &r[id]);
                                 ^
segments.cpp:282:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
                   ^
segments.cpp:286:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d", &a, &b, &k);
                               ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 6 ms 552 KB Output is correct
4 Correct 6 ms 624 KB Output is correct
5 Correct 12 ms 824 KB Output is correct
6 Correct 14 ms 824 KB Output is correct
7 Correct 9 ms 824 KB Output is correct
8 Correct 10 ms 840 KB Output is correct
9 Correct 10 ms 840 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 22 ms 856 KB Output is correct
12 Correct 22 ms 856 KB Output is correct
13 Correct 7 ms 872 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 5 ms 872 KB Output is correct
16 Correct 6 ms 872 KB Output is correct
17 Correct 12 ms 872 KB Output is correct
18 Correct 8 ms 912 KB Output is correct
19 Correct 19 ms 912 KB Output is correct
20 Correct 16 ms 912 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 944 ms 4416 KB Output is correct
2 Correct 912 ms 4524 KB Output is correct
3 Correct 903 ms 4524 KB Output is correct
4 Correct 814 ms 4772 KB Output is correct
5 Correct 606 ms 6704 KB Output is correct
6 Correct 566 ms 6924 KB Output is correct
7 Correct 879 ms 6924 KB Output is correct
8 Correct 869 ms 6924 KB Output is correct
9 Correct 885 ms 6924 KB Output is correct
10 Correct 1035 ms 6924 KB Output is correct
11 Correct 1086 ms 6924 KB Output is correct
12 Correct 741 ms 6924 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 6924 KB Output is correct
2 Correct 86 ms 6924 KB Output is correct
3 Correct 177 ms 6924 KB Output is correct
4 Correct 113 ms 6924 KB Output is correct
5 Correct 645 ms 6924 KB Output is correct
6 Correct 828 ms 6924 KB Output is correct
7 Correct 732 ms 6924 KB Output is correct
8 Correct 568 ms 6956 KB Output is correct
9 Correct 556 ms 6956 KB Output is correct
10 Correct 577 ms 6956 KB Output is correct
11 Correct 362 ms 6956 KB Output is correct
12 Correct 556 ms 6956 KB Output is correct
13 Correct 556 ms 6956 KB Output is correct
14 Correct 537 ms 6956 KB Output is correct
15 Correct 488 ms 6956 KB Output is correct
16 Correct 451 ms 6956 KB Output is correct
17 Correct 809 ms 6956 KB Output is correct
18 Correct 828 ms 6956 KB Output is correct
19 Correct 819 ms 6956 KB Output is correct
20 Correct 838 ms 6956 KB Output is correct
21 Correct 373 ms 6956 KB Output is correct
22 Correct 504 ms 6956 KB Output is correct
23 Correct 545 ms 6956 KB Output is correct
24 Correct 523 ms 6956 KB Output is correct
25 Correct 111 ms 6956 KB Output is correct
26 Correct 94 ms 6956 KB Output is correct
27 Correct 143 ms 6956 KB Output is correct
28 Correct 97 ms 6956 KB Output is correct
29 Correct 537 ms 6956 KB Output is correct
30 Correct 518 ms 6956 KB Output is correct
31 Correct 578 ms 6980 KB Output is correct
32 Correct 569 ms 6980 KB Output is correct
33 Correct 587 ms 6980 KB Output is correct
34 Correct 497 ms 6980 KB Output is correct
35 Correct 555 ms 6980 KB Output is correct
36 Correct 578 ms 6980 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 6980 KB Output is correct
2 Correct 126 ms 6980 KB Output is correct
3 Correct 98 ms 6980 KB Output is correct
4 Correct 99 ms 6980 KB Output is correct
5 Correct 715 ms 6980 KB Output is correct
6 Correct 988 ms 6980 KB Output is correct
7 Correct 639 ms 6980 KB Output is correct
8 Correct 1004 ms 6980 KB Output is correct
9 Correct 533 ms 6980 KB Output is correct
10 Correct 586 ms 6980 KB Output is correct
11 Correct 507 ms 6980 KB Output is correct
12 Correct 612 ms 7188 KB Output is correct
13 Correct 566 ms 7188 KB Output is correct
14 Correct 560 ms 7188 KB Output is correct
15 Correct 585 ms 7188 KB Output is correct
16 Correct 593 ms 7188 KB Output is correct
17 Correct 938 ms 7188 KB Output is correct
18 Correct 870 ms 7188 KB Output is correct
19 Correct 898 ms 7188 KB Output is correct
20 Correct 889 ms 7188 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 6 ms 552 KB Output is correct
4 Correct 6 ms 624 KB Output is correct
5 Correct 12 ms 824 KB Output is correct
6 Correct 14 ms 824 KB Output is correct
7 Correct 9 ms 824 KB Output is correct
8 Correct 10 ms 840 KB Output is correct
9 Correct 10 ms 840 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 22 ms 856 KB Output is correct
12 Correct 22 ms 856 KB Output is correct
13 Correct 7 ms 872 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 5 ms 872 KB Output is correct
16 Correct 6 ms 872 KB Output is correct
17 Correct 12 ms 872 KB Output is correct
18 Correct 8 ms 912 KB Output is correct
19 Correct 19 ms 912 KB Output is correct
20 Correct 16 ms 912 KB Output is correct
21 Correct 944 ms 4416 KB Output is correct
22 Correct 912 ms 4524 KB Output is correct
23 Correct 903 ms 4524 KB Output is correct
24 Correct 814 ms 4772 KB Output is correct
25 Correct 606 ms 6704 KB Output is correct
26 Correct 566 ms 6924 KB Output is correct
27 Correct 879 ms 6924 KB Output is correct
28 Correct 869 ms 6924 KB Output is correct
29 Correct 885 ms 6924 KB Output is correct
30 Correct 1035 ms 6924 KB Output is correct
31 Correct 1086 ms 6924 KB Output is correct
32 Correct 741 ms 6924 KB Output is correct
33 Correct 116 ms 6980 KB Output is correct
34 Correct 126 ms 6980 KB Output is correct
35 Correct 98 ms 6980 KB Output is correct
36 Correct 99 ms 6980 KB Output is correct
37 Correct 715 ms 6980 KB Output is correct
38 Correct 988 ms 6980 KB Output is correct
39 Correct 639 ms 6980 KB Output is correct
40 Correct 1004 ms 6980 KB Output is correct
41 Correct 533 ms 6980 KB Output is correct
42 Correct 586 ms 6980 KB Output is correct
43 Correct 507 ms 6980 KB Output is correct
44 Correct 612 ms 7188 KB Output is correct
45 Correct 566 ms 7188 KB Output is correct
46 Correct 560 ms 7188 KB Output is correct
47 Correct 585 ms 7188 KB Output is correct
48 Correct 593 ms 7188 KB Output is correct
49 Correct 938 ms 7188 KB Output is correct
50 Correct 870 ms 7188 KB Output is correct
51 Correct 898 ms 7188 KB Output is correct
52 Correct 889 ms 7188 KB Output is correct
53 Correct 122 ms 7188 KB Output is correct
54 Correct 109 ms 7188 KB Output is correct
55 Correct 98 ms 7188 KB Output is correct
56 Correct 93 ms 7188 KB Output is correct
57 Correct 1050 ms 7188 KB Output is correct
58 Correct 971 ms 7188 KB Output is correct
59 Correct 813 ms 7188 KB Output is correct
60 Correct 904 ms 7188 KB Output is correct
61 Correct 610 ms 7188 KB Output is correct
62 Correct 573 ms 7188 KB Output is correct
63 Correct 583 ms 7188 KB Output is correct
64 Correct 582 ms 7188 KB Output is correct
65 Correct 543 ms 7188 KB Output is correct
66 Correct 489 ms 7188 KB Output is correct
67 Correct 646 ms 7188 KB Output is correct
68 Correct 628 ms 7188 KB Output is correct
69 Correct 885 ms 7188 KB Output is correct
70 Correct 912 ms 7188 KB Output is correct
71 Correct 914 ms 7188 KB Output is correct
72 Correct 914 ms 7188 KB Output is correct
73 Correct 592 ms 7188 KB Output is correct
74 Correct 599 ms 7188 KB Output is correct
75 Correct 619 ms 7348 KB Output is correct
76 Correct 637 ms 7348 KB Output is correct
77 Correct 113 ms 7348 KB Output is correct
78 Correct 96 ms 7348 KB Output is correct
79 Correct 107 ms 7348 KB Output is correct
80 Correct 100 ms 7348 KB Output is correct
81 Correct 613 ms 7348 KB Output is correct
82 Correct 547 ms 7348 KB Output is correct
83 Correct 505 ms 7348 KB Output is correct
84 Correct 626 ms 7348 KB Output is correct
85 Correct 642 ms 7348 KB Output is correct
86 Correct 636 ms 7348 KB Output is correct
87 Correct 556 ms 7348 KB Output is correct
88 Correct 531 ms 7348 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 6 ms 552 KB Output is correct
4 Correct 6 ms 624 KB Output is correct
5 Correct 12 ms 824 KB Output is correct
6 Correct 14 ms 824 KB Output is correct
7 Correct 9 ms 824 KB Output is correct
8 Correct 10 ms 840 KB Output is correct
9 Correct 10 ms 840 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 22 ms 856 KB Output is correct
12 Correct 22 ms 856 KB Output is correct
13 Correct 7 ms 872 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 5 ms 872 KB Output is correct
16 Correct 6 ms 872 KB Output is correct
17 Correct 12 ms 872 KB Output is correct
18 Correct 8 ms 912 KB Output is correct
19 Correct 19 ms 912 KB Output is correct
20 Correct 16 ms 912 KB Output is correct
21 Correct 944 ms 4416 KB Output is correct
22 Correct 912 ms 4524 KB Output is correct
23 Correct 903 ms 4524 KB Output is correct
24 Correct 814 ms 4772 KB Output is correct
25 Correct 606 ms 6704 KB Output is correct
26 Correct 566 ms 6924 KB Output is correct
27 Correct 879 ms 6924 KB Output is correct
28 Correct 869 ms 6924 KB Output is correct
29 Correct 885 ms 6924 KB Output is correct
30 Correct 1035 ms 6924 KB Output is correct
31 Correct 1086 ms 6924 KB Output is correct
32 Correct 741 ms 6924 KB Output is correct
33 Correct 107 ms 6924 KB Output is correct
34 Correct 86 ms 6924 KB Output is correct
35 Correct 177 ms 6924 KB Output is correct
36 Correct 113 ms 6924 KB Output is correct
37 Correct 645 ms 6924 KB Output is correct
38 Correct 828 ms 6924 KB Output is correct
39 Correct 732 ms 6924 KB Output is correct
40 Correct 568 ms 6956 KB Output is correct
41 Correct 556 ms 6956 KB Output is correct
42 Correct 577 ms 6956 KB Output is correct
43 Correct 362 ms 6956 KB Output is correct
44 Correct 556 ms 6956 KB Output is correct
45 Correct 556 ms 6956 KB Output is correct
46 Correct 537 ms 6956 KB Output is correct
47 Correct 488 ms 6956 KB Output is correct
48 Correct 451 ms 6956 KB Output is correct
49 Correct 809 ms 6956 KB Output is correct
50 Correct 828 ms 6956 KB Output is correct
51 Correct 819 ms 6956 KB Output is correct
52 Correct 838 ms 6956 KB Output is correct
53 Correct 373 ms 6956 KB Output is correct
54 Correct 504 ms 6956 KB Output is correct
55 Correct 545 ms 6956 KB Output is correct
56 Correct 523 ms 6956 KB Output is correct
57 Correct 111 ms 6956 KB Output is correct
58 Correct 94 ms 6956 KB Output is correct
59 Correct 143 ms 6956 KB Output is correct
60 Correct 97 ms 6956 KB Output is correct
61 Correct 537 ms 6956 KB Output is correct
62 Correct 518 ms 6956 KB Output is correct
63 Correct 578 ms 6980 KB Output is correct
64 Correct 569 ms 6980 KB Output is correct
65 Correct 587 ms 6980 KB Output is correct
66 Correct 497 ms 6980 KB Output is correct
67 Correct 555 ms 6980 KB Output is correct
68 Correct 578 ms 6980 KB Output is correct
69 Correct 116 ms 6980 KB Output is correct
70 Correct 126 ms 6980 KB Output is correct
71 Correct 98 ms 6980 KB Output is correct
72 Correct 99 ms 6980 KB Output is correct
73 Correct 715 ms 6980 KB Output is correct
74 Correct 988 ms 6980 KB Output is correct
75 Correct 639 ms 6980 KB Output is correct
76 Correct 1004 ms 6980 KB Output is correct
77 Correct 533 ms 6980 KB Output is correct
78 Correct 586 ms 6980 KB Output is correct
79 Correct 507 ms 6980 KB Output is correct
80 Correct 612 ms 7188 KB Output is correct
81 Correct 566 ms 7188 KB Output is correct
82 Correct 560 ms 7188 KB Output is correct
83 Correct 585 ms 7188 KB Output is correct
84 Correct 593 ms 7188 KB Output is correct
85 Correct 938 ms 7188 KB Output is correct
86 Correct 870 ms 7188 KB Output is correct
87 Correct 898 ms 7188 KB Output is correct
88 Correct 889 ms 7188 KB Output is correct
89 Correct 122 ms 7188 KB Output is correct
90 Correct 109 ms 7188 KB Output is correct
91 Correct 98 ms 7188 KB Output is correct
92 Correct 93 ms 7188 KB Output is correct
93 Correct 1050 ms 7188 KB Output is correct
94 Correct 971 ms 7188 KB Output is correct
95 Correct 813 ms 7188 KB Output is correct
96 Correct 904 ms 7188 KB Output is correct
97 Correct 610 ms 7188 KB Output is correct
98 Correct 573 ms 7188 KB Output is correct
99 Correct 583 ms 7188 KB Output is correct
100 Correct 582 ms 7188 KB Output is correct
101 Correct 543 ms 7188 KB Output is correct
102 Correct 489 ms 7188 KB Output is correct
103 Correct 646 ms 7188 KB Output is correct
104 Correct 628 ms 7188 KB Output is correct
105 Correct 885 ms 7188 KB Output is correct
106 Correct 912 ms 7188 KB Output is correct
107 Correct 914 ms 7188 KB Output is correct
108 Correct 914 ms 7188 KB Output is correct
109 Correct 592 ms 7188 KB Output is correct
110 Correct 599 ms 7188 KB Output is correct
111 Correct 619 ms 7348 KB Output is correct
112 Correct 637 ms 7348 KB Output is correct
113 Correct 113 ms 7348 KB Output is correct
114 Correct 96 ms 7348 KB Output is correct
115 Correct 107 ms 7348 KB Output is correct
116 Correct 100 ms 7348 KB Output is correct
117 Correct 613 ms 7348 KB Output is correct
118 Correct 547 ms 7348 KB Output is correct
119 Correct 505 ms 7348 KB Output is correct
120 Correct 626 ms 7348 KB Output is correct
121 Correct 642 ms 7348 KB Output is correct
122 Correct 636 ms 7348 KB Output is correct
123 Correct 556 ms 7348 KB Output is correct
124 Correct 531 ms 7348 KB Output is correct
125 Correct 216 ms 7348 KB Output is correct
126 Correct 215 ms 7348 KB Output is correct
127 Correct 299 ms 7348 KB Output is correct
128 Correct 229 ms 7348 KB Output is correct
129 Correct 201 ms 7348 KB Output is correct
130 Correct 251 ms 7348 KB Output is correct
131 Correct 2326 ms 7348 KB Output is correct
132 Correct 2223 ms 7500 KB Output is correct
133 Correct 2262 ms 9804 KB Output is correct
134 Correct 2454 ms 9804 KB Output is correct
135 Correct 2186 ms 10260 KB Output is correct
136 Correct 1680 ms 10260 KB Output is correct
137 Correct 2631 ms 12888 KB Output is correct
138 Correct 2273 ms 12888 KB Output is correct
139 Correct 2570 ms 12888 KB Output is correct
140 Correct 2822 ms 12888 KB Output is correct
141 Correct 2401 ms 12888 KB Output is correct
142 Correct 1113 ms 12888 KB Output is correct
143 Correct 1435 ms 12888 KB Output is correct
144 Correct 991 ms 12888 KB Output is correct
145 Correct 2776 ms 12888 KB Output is correct
146 Correct 1774 ms 12888 KB Output is correct
147 Correct 1455 ms 12888 KB Output is correct
148 Correct 1344 ms 12888 KB Output is correct
149 Correct 2254 ms 12888 KB Output is correct
150 Correct 2310 ms 12888 KB Output is correct
151 Correct 2301 ms 12888 KB Output is correct
152 Correct 2353 ms 12888 KB Output is correct
153 Correct 2280 ms 12888 KB Output is correct
154 Correct 2330 ms 12888 KB Output is correct
155 Correct 1207 ms 12888 KB Output is correct
156 Correct 1442 ms 12888 KB Output is correct
157 Correct 2591 ms 12888 KB Output is correct
158 Correct 2596 ms 12888 KB Output is correct
159 Correct 2251 ms 12888 KB Output is correct
160 Correct 1704 ms 12888 KB Output is correct
161 Correct 283 ms 12888 KB Output is correct
162 Correct 249 ms 12888 KB Output is correct
163 Correct 236 ms 12888 KB Output is correct
164 Correct 581 ms 12888 KB Output is correct
165 Correct 303 ms 12888 KB Output is correct
166 Correct 234 ms 12888 KB Output is correct
167 Correct 2758 ms 13376 KB Output is correct
168 Correct 2805 ms 13376 KB Output is correct
169 Correct 2844 ms 13376 KB Output is correct
170 Correct 2660 ms 13376 KB Output is correct
171 Correct 2374 ms 13376 KB Output is correct
172 Correct 1673 ms 13376 KB Output is correct
173 Correct 2795 ms 13376 KB Output is correct
174 Correct 1674 ms 13376 KB Output is correct
175 Correct 2434 ms 13376 KB Output is correct
176 Correct 1333 ms 13376 KB Output is correct
177 Correct 2098 ms 13376 KB Output is correct
178 Correct 2086 ms 13376 KB Output is correct