oj.uz

답안 #953304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953304 2024-03-25T19:40:48 Z WonderfulWhale IOI 바이러스 (JOI21_fever) C++17
25 / 100
 5000 ms 125276 KB 
#include<bits/stdc++.h>
using namespace std;

#define int int64_t
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

ostream& operator<<(ostream &os, pair<auto, auto> x) {
	os << "{" << x.nd/2 << ", " << x.st/2 << "}";
	return os;
}

const int MAXN = 100'009;
const int INF = 1e18;

int n;
pii tab[MAXN];
int dis[MAXN];
int dir[MAXN];
pii sdis[8][MAXN];
unordered_map<int, int> remap[4];

set<pii> S[8][MAXN];

int D(int x, int y) {
	// return abs(tab[x].st-tab[y].st)+abs(tab[x].nd-tab[y].nd);
	return max(abs(tab[x].st-tab[y].st), abs(tab[x].nd-tab[y].nd));
}

int id(int x, int i) {
	if(i%4==0) {
		return remap[i%4][tab[x].nd];
	}
	if(i%4==1) {
		return remap[i%4][tab[x].st-tab[x].nd];
	}
	if(i%4==2) {
		return remap[i%4][tab[x].st];
	}
	if(i%4==3) {
		return remap[i%4][tab[x].st+tab[x].nd];
	}
}

int f(int x, int i) {
	int ret = 0;
	if(i/2==0||i/2==2) {
		ret = tab[x].st;
	} else {
		ret = tab[x].nd;
	}
	if(i>=4) ret*=-1;
	return ret;
}

int opp(int x, int i) {
	if(x==i) {
		return (x+4)%8;
	}
	if((x+1)%8==i) {
		return (x+6)%8;
	}
	return (x+2)%8;
}

priority_queue<pii, vector<pii>, greater<pii>> Q;

void push(int x) {
	for(int i=0;i<8;i++) {
		int num = id(x, i);
		auto it = S[i][num].upper_bound({f(x, i), INF});
		if(it!=S[i][num].end()) {
			int nxt = (*it).nd;
			int ndis = sdis[i][x].st+D(x, nxt);
			if(ndis<sdis[i][nxt].st) {
				sdis[i][nxt] = {ndis, sdis[i][x].nd};
			}
			if(ndis<dis[nxt]) {
				dis[nxt] = ndis;
				dir[nxt] = opp(sdis[i][x].nd, i);
				Q.push({dis[nxt], nxt});
			}
		}
	}
}

int dijkstra(int I) {
	int ret = 0;
	fill(dis, dis+n, INF);
	fill(dir, dir+n, INF);
	for(int i=0;i<8;i++) {
		fill(sdis[i], sdis[i]+n, make_pair(INF, -1));
		// sdis[i][0] = 0;
	}
	dis[0] = 0;
	dir[0] = I;
	Q.push({0, 0});
	while(sz(Q)) {
		auto [x_dis, x] = Q.top();
		Q.pop();
		if(x_dis!=dis[x]) continue;
		cerr << "D: " << tab[x] << " " << dis[x] << "\n";
		cerr << "Direction: " << dir[x] << "\n";
		ret++;
		for(int i=0;i<8;i++) {
			S[i][id(x, i)].erase(make_pair(f(x, i), x));
		}
		push(x);
		int tmp = (dir[x]-1);
		if(tmp<0) tmp += 8;
		vector<int> v = {tmp, dir[x], (dir[x]+1)%8};
		for(int i:v) {
			cerr << "dir: " << i << "\n";
			int X = 2-i%2;
			auto it = S[i][id(x, i)].lower_bound(make_pair(f(x, i)+dis[x], -1));
			cerr << "init: " << f(x, i) << "\n";
			cerr << "lim: " << f(x, i)+dis[x]/X << "\n";
			if(it!=S[i][id(x, i)].end()) {
				 cerr << "full find: " << (*it).st << " " << (*it).nd << "\n";
				int y = (*it).nd;
				// cerr << "cand: "<< tab[y] << "\n";
				int ndis = D(x, y)/X;
				if(ndis<sdis[i][y].st) {
					sdis[i][y] = {ndis, dir[x]};
				}
				if(ndis<dis[y]) {
					dis[y] = ndis;
					dir[y] = opp(dir[x], i);
					Q.push({dis[y], y});
				}
			}
		}
	}
	return ret;
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n;
	vector<int> vals[4];
	for(int i=0;i<n;i++) {
		cin >> tab[i].st >> tab[i].nd;
		tab[i].st*=2, tab[i].nd*=2;
		swap(tab[i].st, tab[i].nd);
		vals[0].pb(tab[i].nd), vals[2].pb(tab[i].st);
		vals[1].pb(tab[i].st-tab[i].nd), vals[3].pb(tab[i].st+tab[i].nd);
	}
	for(int i=0;i<4;i++) {
		sort(all(vals[i]));
		vals[i].erase(unique(all(vals[i])), vals[i].end());
		for(int j=0;j<sz(vals[i]);j++) {
			remap[i][vals[i][j]] = j;
		}
	}
	// for(int i=0;i<n;i++) {
	// 	// cerr << "NOW: " << i << "\n";
	// 	for(int j=0;j<8;j++) {
	// 		S[j][id(i, j)].insert(make_pair(f(i, j), i));
	// 		// cerr << "id: " << id(i, j) << " : f: "<< f(i, j) << "\n";
	// 	}
	// }
	int ans = 0;
	// ans = dijkstra(2);
	for(int I=0;I<8;I+=2) {
		for(int i=0;i<n;i++) {
			for(int j=0;j<8;j++) {
				S[j][i].clear();
			}
		}
		for(int i=0;i<n;i++) {
			cerr << "NOW: " << i << "\n";
			for(int j=0;j<8;j++) {
				S[j][id(i, j)].insert(make_pair(f(i, j), i));
				cerr << "id: " << id(i, j) << " : f: "<< f(i, j) << "\n";
			}
		}
		ans = max(ans, dijkstra(I));
	}
	cout << ans << "\n";
}

Compilation message

fever.cpp:12:39: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   12 | ostream& operator<<(ostream &os, pair<auto, auto> x) {
      |                                       ^~~~
fever.cpp:12:45: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   12 | ostream& operator<<(ostream &os, pair<auto, auto> x) {
      |                                             ^~~~
fever.cpp: In function 'int64_t id(int64_t, int64_t)':
fever.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct
33 Correct 13 ms 51804 KB Output is correct
34 Correct 14 ms 51876 KB Output is correct
35 Correct 13 ms 51800 KB Output is correct
36 Correct 13 ms 51804 KB Output is correct
37 Correct 14 ms 51952 KB Output is correct
38 Correct 18 ms 51804 KB Output is correct
39 Correct 15 ms 51804 KB Output is correct
40 Correct 14 ms 51800 KB Output is correct
41 Correct 16 ms 52184 KB Output is correct
42 Correct 13 ms 51804 KB Output is correct
43 Correct 13 ms 51956 KB Output is correct
44 Correct 14 ms 51800 KB Output is correct
45 Correct 14 ms 51804 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 51804 KB Output is correct
2 Correct 28 ms 52060 KB Output is correct
3 Correct 29 ms 51804 KB Output is correct
4 Correct 28 ms 52040 KB Output is correct
5 Correct 29 ms 52316 KB Output is correct
6 Correct 37 ms 52056 KB Output is correct
7 Correct 37 ms 52052 KB Output is correct
8 Correct 37 ms 52080 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct
33 Correct 13 ms 51804 KB Output is correct
34 Correct 14 ms 51876 KB Output is correct
35 Correct 13 ms 51800 KB Output is correct
36 Correct 13 ms 51804 KB Output is correct
37 Correct 14 ms 51952 KB Output is correct
38 Correct 18 ms 51804 KB Output is correct
39 Correct 15 ms 51804 KB Output is correct
40 Correct 14 ms 51800 KB Output is correct
41 Correct 16 ms 52184 KB Output is correct
42 Correct 13 ms 51804 KB Output is correct
43 Correct 13 ms 51956 KB Output is correct
44 Correct 14 ms 51800 KB Output is correct
45 Correct 14 ms 51804 KB Output is correct
46 Correct 35 ms 51804 KB Output is correct
47 Correct 28 ms 52060 KB Output is correct
48 Correct 29 ms 51804 KB Output is correct
49 Correct 28 ms 52040 KB Output is correct
50 Correct 29 ms 52316 KB Output is correct
51 Correct 37 ms 52056 KB Output is correct
52 Correct 37 ms 52052 KB Output is correct
53 Correct 37 ms 52080 KB Output is correct
54 Correct 29 ms 51804 KB Output is correct
55 Correct 29 ms 52056 KB Output is correct
56 Correct 30 ms 52048 KB Output is correct
57 Correct 29 ms 52056 KB Output is correct
58 Correct 47 ms 52288 KB Output is correct
59 Correct 38 ms 52056 KB Output is correct
60 Correct 29 ms 52060 KB Output is correct
61 Correct 33 ms 52036 KB Output is correct
62 Correct 34 ms 52304 KB Output is correct
63 Correct 30 ms 51980 KB Output is correct
64 Correct 31 ms 52052 KB Output is correct
65 Correct 39 ms 52060 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct
33 Correct 13 ms 51804 KB Output is correct
34 Correct 14 ms 51876 KB Output is correct
35 Correct 13 ms 51800 KB Output is correct
36 Correct 13 ms 51804 KB Output is correct
37 Correct 14 ms 51952 KB Output is correct
38 Correct 18 ms 51804 KB Output is correct
39 Correct 15 ms 51804 KB Output is correct
40 Correct 14 ms 51800 KB Output is correct
41 Correct 16 ms 52184 KB Output is correct
42 Correct 13 ms 51804 KB Output is correct
43 Correct 13 ms 51956 KB Output is correct
44 Correct 14 ms 51800 KB Output is correct
45 Correct 14 ms 51804 KB Output is correct
46 Correct 35 ms 51804 KB Output is correct
47 Correct 28 ms 52060 KB Output is correct
48 Correct 29 ms 51804 KB Output is correct
49 Correct 28 ms 52040 KB Output is correct
50 Correct 29 ms 52316 KB Output is correct
51 Correct 37 ms 52056 KB Output is correct
52 Correct 37 ms 52052 KB Output is correct
53 Correct 37 ms 52080 KB Output is correct
54 Correct 29 ms 51804 KB Output is correct
55 Correct 29 ms 52056 KB Output is correct
56 Correct 30 ms 52048 KB Output is correct
57 Correct 29 ms 52056 KB Output is correct
58 Correct 47 ms 52288 KB Output is correct
59 Correct 38 ms 52056 KB Output is correct
60 Correct 29 ms 52060 KB Output is correct
61 Correct 33 ms 52036 KB Output is correct
62 Correct 34 ms 52304 KB Output is correct
63 Correct 30 ms 51980 KB Output is correct
64 Correct 31 ms 52052 KB Output is correct
65 Correct 39 ms 52060 KB Output is correct
66 Correct 574 ms 55916 KB Output is correct
67 Correct 590 ms 55988 KB Output is correct
68 Correct 596 ms 56652 KB Output is correct
69 Correct 1188 ms 56776 KB Output is correct
70 Incorrect 1227 ms 57228 KB Output isn't correct
71 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct
33 Correct 13 ms 51804 KB Output is correct
34 Correct 14 ms 51876 KB Output is correct
35 Correct 13 ms 51800 KB Output is correct
36 Correct 13 ms 51804 KB Output is correct
37 Correct 14 ms 51952 KB Output is correct
38 Correct 18 ms 51804 KB Output is correct
39 Correct 15 ms 51804 KB Output is correct
40 Correct 14 ms 51800 KB Output is correct
41 Correct 16 ms 52184 KB Output is correct
42 Correct 13 ms 51804 KB Output is correct
43 Correct 13 ms 51956 KB Output is correct
44 Correct 14 ms 51800 KB Output is correct
45 Correct 14 ms 51804 KB Output is correct
46 Correct 35 ms 51804 KB Output is correct
47 Correct 28 ms 52060 KB Output is correct
48 Correct 29 ms 51804 KB Output is correct
49 Correct 28 ms 52040 KB Output is correct
50 Correct 29 ms 52316 KB Output is correct
51 Correct 37 ms 52056 KB Output is correct
52 Correct 37 ms 52052 KB Output is correct
53 Correct 37 ms 52080 KB Output is correct
54 Correct 29 ms 51804 KB Output is correct
55 Correct 29 ms 52056 KB Output is correct
56 Correct 30 ms 52048 KB Output is correct
57 Correct 29 ms 52056 KB Output is correct
58 Correct 47 ms 52288 KB Output is correct
59 Correct 38 ms 52056 KB Output is correct
60 Correct 29 ms 52060 KB Output is correct
61 Correct 33 ms 52036 KB Output is correct
62 Correct 34 ms 52304 KB Output is correct
63 Correct 30 ms 51980 KB Output is correct
64 Correct 31 ms 52052 KB Output is correct
65 Correct 39 ms 52060 KB Output is correct
66 Execution timed out 5039 ms 125276 KB Time limit exceeded
67 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 51800 KB Output is correct
2 Correct 11 ms 51804 KB Output is correct
3 Correct 12 ms 51820 KB Output is correct
4 Correct 11 ms 51800 KB Output is correct
5 Correct 10 ms 51800 KB Output is correct
6 Correct 12 ms 51804 KB Output is correct
7 Correct 12 ms 51804 KB Output is correct
8 Correct 14 ms 51812 KB Output is correct
9 Correct 10 ms 51800 KB Output is correct
10 Correct 12 ms 51800 KB Output is correct
11 Correct 11 ms 51800 KB Output is correct
12 Correct 12 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 12 ms 51836 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 11 ms 51800 KB Output is correct
18 Correct 13 ms 52060 KB Output is correct
19 Correct 14 ms 51800 KB Output is correct
20 Correct 11 ms 52056 KB Output is correct
21 Correct 11 ms 51940 KB Output is correct
22 Correct 11 ms 51804 KB Output is correct
23 Correct 12 ms 51944 KB Output is correct
24 Correct 13 ms 51804 KB Output is correct
25 Correct 12 ms 51820 KB Output is correct
26 Correct 12 ms 51804 KB Output is correct
27 Correct 12 ms 51800 KB Output is correct
28 Correct 11 ms 51804 KB Output is correct
29 Correct 12 ms 51804 KB Output is correct
30 Correct 10 ms 51804 KB Output is correct
31 Correct 12 ms 52196 KB Output is correct
32 Correct 11 ms 51824 KB Output is correct
33 Correct 13 ms 51804 KB Output is correct
34 Correct 14 ms 51876 KB Output is correct
35 Correct 13 ms 51800 KB Output is correct
36 Correct 13 ms 51804 KB Output is correct
37 Correct 14 ms 51952 KB Output is correct
38 Correct 18 ms 51804 KB Output is correct
39 Correct 15 ms 51804 KB Output is correct
40 Correct 14 ms 51800 KB Output is correct
41 Correct 16 ms 52184 KB Output is correct
42 Correct 13 ms 51804 KB Output is correct
43 Correct 13 ms 51956 KB Output is correct
44 Correct 14 ms 51800 KB Output is correct
45 Correct 14 ms 51804 KB Output is correct
46 Correct 35 ms 51804 KB Output is correct
47 Correct 28 ms 52060 KB Output is correct
48 Correct 29 ms 51804 KB Output is correct
49 Correct 28 ms 52040 KB Output is correct
50 Correct 29 ms 52316 KB Output is correct
51 Correct 37 ms 52056 KB Output is correct
52 Correct 37 ms 52052 KB Output is correct
53 Correct 37 ms 52080 KB Output is correct
54 Correct 29 ms 51804 KB Output is correct
55 Correct 29 ms 52056 KB Output is correct
56 Correct 30 ms 52048 KB Output is correct
57 Correct 29 ms 52056 KB Output is correct
58 Correct 47 ms 52288 KB Output is correct
59 Correct 38 ms 52056 KB Output is correct
60 Correct 29 ms 52060 KB Output is correct
61 Correct 33 ms 52036 KB Output is correct
62 Correct 34 ms 52304 KB Output is correct
63 Correct 30 ms 51980 KB Output is correct
64 Correct 31 ms 52052 KB Output is correct
65 Correct 39 ms 52060 KB Output is correct
66 Correct 574 ms 55916 KB Output is correct
67 Correct 590 ms 55988 KB Output is correct
68 Correct 596 ms 56652 KB Output is correct
69 Correct 1188 ms 56776 KB Output is correct
70 Incorrect 1227 ms 57228 KB Output isn't correct
71 Halted 0 ms 0 KB -