oj.uz

답안 #995580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995580 2024-06-09T11:59:33 Z alex_2008 참나무 (IOI23_beechtree) C++17
31 / 100
 148 ms 33320 KB 
#include "beechtree.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
using namespace std;
const int N = 2e5 + 10;
vector <vector<pair<int, int>>> G;
vector <pair<int, int>> get_subtree(int v, int c) {
	vector <pair<int, int>> cur;
	cur.push_back({ v, c });
	for (auto it : G[v]) {
		for (auto& j : get_subtree(it.first, it.second)) {
			cur.push_back(j);
		}
	}
	return cur;
}
bool check(vector <pair<int, int>>& w, vector <int>& P, vector <int>& C) {
	map <int, int> mp;
	for (int i = 1; i < (int)w.size(); i++) {
		if (P[w[i].first] != w[mp[w[i].second]].first) return false;
		mp[w[i].second]++;
	}
	return true;
}
bool cmp(set <int> x, set <int> y) {
	return (int)x.size() > (int)y.size();
}
vector <int> beechtree(int N, int M, vector <int> P, vector <int> C) {
	bool subtask1 = (N <= 8);
	bool subtask2 = true;
	bool subtask3 = true;
	bool subtask4 = true;
	bool subtask5 = (N <= 200);
	G.clear();
	G.resize(N);
	map <int, int> mp;
	for (int i = 1; i < N; i++) {
		if (P[i] != (i - 1)) {
			subtask2 = false;
		}
		G[P[i]].push_back({ i, C[i] });
		mp[C[i]]++;
		if (P[i] != 0 && P[P[i]] != 0) {
			subtask3 = false;
		}
	}
	for (auto it : mp) {
		if (it.second > 2) {
			subtask4 = false;
		}
	}
	if (subtask1) {
		vector <int> ret = {};
		for (int i = 0; i < N; i++) {
			vector <pair<int, int>> w = get_subtree(i, C[i]);
			sort(w.begin() + 1, w.end());
			bool ch = false;
			if (check(w, P, C)) ch = true;
			while (next_permutation(w.begin() + 1, w.end())) {
				if (check(w, P, C)) ch = true;
			}
			ret.push_back(ch);
		}
		return ret;
	}
	if (subtask2) {
		vector <int> ret = {};
		if (N == 1) return { 1 };
		int cnt = 2;
		for (int i = N - 2; i > 0; i--) {
			if (C[i] != C[N - 1]) break;
			cnt++;
		}
		for (int i = 0; i < N - cnt; i++) {
			ret.push_back(0);
		}
		for (int i = 0; i < cnt; i++) {
			ret.push_back(1);
		}
		return ret;
	}
	if (subtask3) {
		bool esim = true;
		vector <int> ret(N, 0);
		vector <set<int>> sets;
		for (int i = N - 1; i >= 1; i--) {
			if (G[i].empty()) {
				ret[i] = 1;
			}
			else {
				bool ch = true;
				set <int> ms;
				for (auto it : G[i]) {
					if (ms.find(it.second) != ms.end()) {
						esim = false;
						ch = false;
					}
					ms.insert(it.second);
				}
				if (ch) {
					ret[i] = 1;
					sets.push_back(ms);
				}
			}
		}
		if (!esim) return ret;
		set <int> ms;
		for (auto it : G[0]) {
			if (ms.find(it.second) != ms.end()) {
				return ret;
			}
			ms.insert(it.second);
		}
		sort(sets.begin(), sets.end(), cmp);
		for (auto& it : sets) {
			for (auto& j : it) {
				if (ms.find(j) == ms.end()) {
					return ret;
				}
			}
			ms = it;
		}
		ret[0] = 1;
		return ret;
	}
	if (subtask4) {
		vector <int> ret(N, 0);
		vector <bool> lvl1(N, 0);
		vector <bool> different(N, true);
		vector <set<int>> sets(N, set<int>());
		for (int v = N - 1; v >= 0; v--) {
			if (G[v].empty()) {
				ret[v] = 1;
				continue;
			}
			lvl1[v] = true;
			for (auto& it : G[v]) {
				if (!G[it.first].empty()) lvl1[v] = false;
			}
			if (lvl1[v]) {
				for (auto& it : G[v]) {
					if (sets[v].find(it.second) != sets[v].end()) {
						different[v] = false;
					}
					sets[v].insert(it.second);
				}
				if (different[v]) {
					ret[v] = 1;
					continue;
				}
			}
			bool lvl2 = true;
			for (auto it : G[v]) {
				if (!G[it.first].empty() && !lvl1[it.first]) {
					lvl2 = false;
				}
			}
			if (!lvl2) continue;
			bool ch = true;
			for (auto it : G[v]) {
				if (!different[it.first]) ch = false;
			}
			set <int> ms;
			for (auto it : G[v]) {
				if (ms.find(it.second) != ms.end()) {
					ch = false;
				}
				ms.insert(it.second);
			}
			vector <set<int>> cur_sets;
			for (auto it : G[v]) {
				if (!G[it.first].empty()) cur_sets.push_back(sets[it.first]);
			}
			sort(cur_sets.begin(), cur_sets.end(), cmp);
			for (auto& it : cur_sets) {
				for (auto& j : it) {
					if (ms.find(j) == ms.end()) {
						ch = false;
					}
				}
				ms = it;
			}
			ret[v] = ch;
		}
		return ret;
	}
	if (subtask5) {
		vector <int> ret(N, 1);
		vector <set<int>> sets(N, set<int>());
		vector <bool> ch(N, true);
		for (int v = N - 1; v >= 0; v--) {
			for (auto it : G[v]) {
				if (!ch[it.first]) ch[v] = false;
			}
			for (auto it : G[v]) {
				if (sets[v].find(it.second) != sets[v].end()) {
					ch[v] = false;
				}
				sets[v].insert(it.second);
			}
			if (ch[v]) {
				priority_queue <pair<pair<pair<int, int>, int>, set<int>>> Q;
				set <int> ms = sets[v];
				Q.push({ { make_pair(0, (int)G[v].size()),  v}, sets[v] });
				while (!Q.empty()) {
					pair<pair<pair<int, int>, int>, set<int>> x = Q.top(); Q.pop();
					for (auto it : x.second) {
						if (ms.find(it) == ms.end()) {
							ret[v] = 0;
						}
					}
					ms = x.second;
					for (auto& it : G[x.first.second]) {
						Q.push({{ { x.first.first.first - 1, (int)G[it.first].size()}, it.first }, sets[it.first]});
					}
				}
			}
			else {
				ret[v] = 0;
			}
		}
		return ret;
	}
	return {};
}
/*
int main() {
	for (auto it : beechtree(18, 3, { -1, 0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 5, 10, 11, 11 }, { 0, 1, 2, 3, 1, 2, 3, 1, 3, 3, 2, 1, 1, 2, 2, 1, 2, 3 })) {
		cout << it << " ";
	}
}
*/

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 134 ms 25176 KB Output is correct
8 Correct 102 ms 22740 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 61 ms 17868 KB Output is correct
18 Correct 51 ms 18120 KB Output is correct
19 Correct 121 ms 22408 KB Output is correct
20 Correct 130 ms 24092 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 94 ms 11968 KB Output is correct
16 Correct 91 ms 11356 KB Output is correct
17 Correct 107 ms 11348 KB Output is correct
18 Correct 101 ms 11844 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 134 ms 25176 KB Output is correct
6 Correct 102 ms 22740 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 133 ms 33320 KB Output is correct
12 Correct 148 ms 30284 KB Output is correct

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Incorrect 1 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
55 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Incorrect 1 ms 344 KB 2nd lines differ - expected: 1995 tokens, found 0 tokens
31 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 444 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 2 ms 604 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Incorrect 1 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
65 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Incorrect 1 ms 344 KB 2nd lines differ - expected: 1995 tokens, found 0 tokens
31 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 134 ms 25176 KB Output is correct
39 Correct 102 ms 22740 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 444 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 61 ms 17868 KB Output is correct
49 Correct 51 ms 18120 KB Output is correct
50 Correct 121 ms 22408 KB Output is correct
51 Correct 130 ms 24092 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 94 ms 11968 KB Output is correct
67 Correct 91 ms 11356 KB Output is correct
68 Correct 107 ms 11348 KB Output is correct
69 Correct 101 ms 11844 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 133 ms 33320 KB Output is correct
75 Correct 148 ms 30284 KB Output is correct
76 Incorrect 1 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
77 Halted 0 ms 0 KB -