oj.uz

Submission #887367

# Submission time Handle Problem Language Result Execution time Memory
887367 2023-12-14T10:15:33 Z 42kangaroo Beech Tree (IOI23_beechtree) C++17
31 / 100
 1151 ms 249176 KB 
//  D. Beech Tree

#include<bits/stdc++.h>
#include "beechtree.h"

using namespace std;

using g_t = vector<vector<int>>;

struct dVal {
	map<int, int> de;
	list<set<pair<int, int>>> se;
	int seSi;
};

struct MapsVal {
	map<int, int> maDe;
	map<int, map<int, map<int, int>>> maCDe;
	map<int, map<int, int>> maCat;
	map<int, int> miDe;
	map<int, map<int, map<int, int>>> miCDe;
	map<int, map<int, int>> miCat;
};

struct sdVal {
	vector<pair<int, int>> edg;
	map<int, MapsVal> maV;
};


struct BFSSorting {
	int n, actDe, actC, pDe, pC, cat, pO;
};

bool operator<(const BFSSorting &l, const BFSSorting &r) {
	return tie(l.actDe, l.pDe, l.actC, l.pC, l.cat, r.pO) < tie(r.actDe, r.pDe, r.actC, r.pC, r.cat, l.pO);
}

vector<int> de;
vector<BFSSorting> de2;


dVal dfs(int n, g_t &g, vector<bool> &po, vector<int> &c) {
	map<int, int> r;
	map<int, vector<pair<int, int>>> ve;
	list<set<pair<int, int>>> se;
	map<int, map<int, int>> OmiR;
	int seSi = 0;
	for (auto e: g[n]) {
		if (r.find(c[e]) != r.end()) po[n] = false;
		r[c[e]] = 1;
		ve[c[e]] = {};
	}
	for (auto e: g[n]) {
		auto [re, li, ssi] = dfs(e, g, po, c);
		if (!po[e]) {
			po[n] = false;
		}
		if (!po[n]) continue;
		for (auto &[co, d]: re) {
			if (r.find(co) == r.end()) {
				po[n] = false;
				break;
			}
			if (co == c[e]) r[c[e]] = d + 1;
			ve[co].emplace_back(d, e);
		}
		if (!po[n]) continue;
		if (ssi > seSi) {
			swap(se, li);
			swap(ssi, seSi);
		}
		auto itS = se.begin();
		for (auto &it: li) {
			while (itS != se.end() && itS->size() <= it.size()) {
				for (auto cos: *itS) {
					if (it.erase(cos) == 0) {
						po[n] = false;
						break;
					}
				}
				if (!po[n]) break;
				itS++;
			}
			if (!po[n]) break;
			if (!it.empty()) {
				auto act = se.insert(itS, set<pair<int, int>>());
				for (auto cos: it) {
					if (itS->erase(cos) == 0) {
						po[n] = false;
						break;
					}
					act->insert(cos);
				}
			}
			if (itS->empty()) itS++;
			if (!po[n]) break;
		}
	}
	if (!po[n]) return {};
	se.emplace_back();
	for (auto &[co, vec]: ve) {
		bool dD = true;
		for (auto [d, e]: vec) {
			if (d > r[co]) {
				po[n] = false;
				return {};
			} else if (d == r[co]) {
				dD = false;
				break;
			}
		}
		if (dD) {
			se.back().insert({co, r[co]});
			seSi++;
		}
	}
	if (se.back().empty()) se.pop_back();
	de[n] = seSi;
	return {std::move(r), std::move(se), seSi};
}

sdVal sdfs(int n, g_t &g, vector<bool> &po, vector<int> &c, vector<bool> &vis) {
	if (vis[n]) return {};
	vis[n] = true;
	sdVal res;
	for (auto e: g[n]) {
		auto re = sdfs(e, g, po, c, vis);
		if (!po[e]) po[n] = false;
		if (!po[n]) continue;
		re.edg.emplace_back(e, n);
		if (re.edg.size() > res.edg.size()) {
			swap(re, res);
		}
		for (auto &ed: re.edg) {
			res.edg.push_back(ed);
			auto &ch = de2[ed.first];
			auto up = res.maV[ch.actC].miDe.upper_bound(ch.pDe);
			if (up != res.maV[ch.actC].miDe.end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].miDe.find(ch.pDe) == res.maV[ch.actC].miDe.end())
				res.maV[ch.actC].miDe[ch.pDe] = ch.actDe;
			res.maV[ch.actC].miDe[ch.pDe] = min(res.maV[ch.actC].miDe[ch.pDe], ch.actDe);
			up = res.maV[ch.actC].miCDe[ch.pC][ch.pDe].upper_bound(de2[ed.second].pDe);
			if (up != res.maV[ch.actC].miCDe[ch.pC][ch.pDe].end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].miCDe[ch.pC][ch.pDe].find(de2[ed.second].pDe) == res.maV[ch.actC].miCDe[ch.pC][ch.pDe].end())
				res.maV[ch.actC].miCDe[ch.pC][ch.pDe][de2[ed.second].pDe] = ch.actDe;
			res.maV[ch.actC].miCDe[ch.pC][ch.pDe][de2[ed.second].pDe] = min(
					res.maV[ch.actC].miCDe[ch.pC][ch.pDe][de2[ed.second].pDe], ch.actDe);
			up = res.maV[ch.actC].miCat[ch.cat].upper_bound(-ch.pO);
			if (up != res.maV[ch.actC].miCat[ch.cat].end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].miCat[ch.cat].find(-ch.pO) == res.maV[ch.actC].miCat[ch.cat].end())
				res.maV[ch.actC].miCat[ch.cat][-ch.pO] = ch.actDe;
			res.maV[ch.actC].miCat[ch.cat][-ch.pO] = min(res.maV[ch.actC].miCat[ch.cat][-ch.pO], ch.actDe);
			up = res.maV[ch.actC].maDe.upper_bound(-ch.pDe);
			if (up != res.maV[ch.actC].maDe.end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].maDe.find(-ch.pDe) == res.maV[ch.actC].maDe.end())
				res.maV[ch.actC].maDe[-ch.pDe] = ch.actDe;
			res.maV[ch.actC].maDe[-ch.pDe] = max(res.maV[ch.actC].maDe[-ch.pDe], ch.actDe);
			up = res.maV[ch.actC].maCDe[ch.pC][ch.pDe].upper_bound(-de2[ed.second].pDe);
			if (up != res.maV[ch.actC].maCDe[ch.pC][ch.pDe].end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].maCDe[ch.pC][ch.pDe].find(-de2[ed.second].pDe) == res.maV[ch.actC].maCDe[ch.pC][ch.pDe].end())
				res.maV[ch.actC].maCDe[ch.pC][ch.pDe][-de2[ed.second].pDe] = ch.actDe;
			res.maV[ch.actC].maCDe[ch.pC][ch.pDe][-de2[ed.second].pDe] = max(
					res.maV[ch.actC].maCDe[ch.pC][ch.pDe][-de2[ed.second].pDe], ch.actDe);
			up = res.maV[ch.actC].maCat[ch.cat].upper_bound(ch.pO);
			if (up != res.maV[ch.actC].maCat[ch.cat].end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (res.maV[ch.actC].maCat[ch.cat].find(ch.pO) == res.maV[ch.actC].maCat[ch.cat].end())
				res.maV[ch.actC].maCat[ch.cat][ch.pO] = ch.actDe;
			res.maV[ch.actC].maCat[ch.cat][ch.pO] = max(res.maV[ch.actC].maCat[ch.cat][ch.pO], ch.actDe);
		}
	}
	return res;
}

void bfs(int n, g_t &g, vector<int> &c, vector<bool> &vi) {
	int d = 0, col = 0;
	BFSSorting la{n, de[n], c[n], de[n], c[n], 0, 1};
	priority_queue<BFSSorting> pq;
	pq.push({n, de[n], c[n], de[n], c[n], 0, 1});
	while (!pq.empty()) {
		auto bO = pq.top();
		pq.pop();
		if (vi[bO.n]) continue;
		vi[bO.n] = true;
		if (bO.actDe != la.actDe || bO.pDe != la.pDe || bO.pO != la.pO) {
			d++;
		}
		if (bO.actC != la.actC || bO.pC != la.pC || bO.cat != la.cat || bO.actDe != la.actDe || bO.pDe != la.pDe) {
			col++;
		}
		de2[bO.n] = la = {bO.n, bO.actDe, bO.actC, bO.pDe, bO.pC, col, d};
		for (auto e: g[bO.n]) {
			pq.push({e, de[e], c[e], de[bO.n], c[bO.n], de2[bO.n].cat, de2[bO.n].pO});
		}
	}
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
	g_t g(N);
	for (int i = 1; i < N; ++i) {
		g[P[i]].push_back(i);
	}
	de = vector<int>(N);
	de2 = vector<BFSSorting>(N);
	vector<bool> po(N, true);
	dfs(0, g, po, C);
	vector<bool> vis(N, false);
	for (int i = 0; i < N; ++i) {
		if (po[i]) {
			bfs(i, g, C, vis);
		}
	}
	std::fill(vis.begin(), vis.end(), false);
	for (int i = 0; i < N; ++i) {
		if (po[i]) {
			sdfs(i, g, po, C, vis);
		}
	}
	return {po.begin(), po.end()};
}

#ifndef EVAL

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<int> p(n), c(n);
	for (auto &e: p) {
		cin >> e;
	}
	for (auto &e: c) {
		cin >> e;
	}
	auto res = beechtree(n, m, p, c);
	for (auto e: res) {
		cout << e << " ";
	}
	cout << "\n";
}

#endif

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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 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 0 ms 344 KB Output is correct
10 Correct 1 ms 600 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 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 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 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 0 ms 348 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 344 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

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
7 Correct 184 ms 164960 KB Output is correct
8 Correct 174 ms 164804 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 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 3 ms 2908 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 277 ms 249176 KB Output is correct
18 Correct 223 ms 180052 KB Output is correct
19 Correct 189 ms 164968 KB Output is correct
20 Correct 183 ms 164696 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 6 ms 1372 KB Output is correct
15 Correct 370 ms 9664 KB Output is correct
16 Correct 324 ms 8796 KB Output is correct
17 Correct 323 ms 8760 KB Output is correct
18 Correct 1151 ms 92764 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory 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 184 ms 164960 KB Output is correct
6 Correct 174 ms 164804 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 199 ms 28120 KB Output is correct
12 Correct 556 ms 33140 KB Output is correct

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory 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 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 0 ms 348 KB Output is correct
9 Correct 0 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 344 KB Output is correct
13 Correct 1 ms 600 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 500 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 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 0 ms 348 KB Output is correct
31 Correct 0 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 356 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 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 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 432 KB Output is correct
57 Correct 1 ms 600 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Incorrect 1 ms 348 KB 2nd lines differ - on the 110th token, expected: '0', found: '1'
60 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory 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 0 ms 344 KB Output is correct
6 Correct 1 ms 600 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2140 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 3 ms 2904 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 11 ms 1368 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 4 ms 692 KB Output is correct
34 Correct 15 ms 1372 KB Output is correct
35 Incorrect 8 ms 792 KB 2nd lines differ - on the 806th token, expected: '0', found: '1'
36 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory 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 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 0 ms 348 KB Output is correct
9 Correct 0 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 344 KB Output is correct
13 Correct 1 ms 600 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 500 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 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 0 ms 348 KB Output is correct
31 Correct 0 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 356 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 3 ms 2908 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 2 ms 1884 KB Output is correct
45 Correct 2 ms 2028 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 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 3 ms 348 KB Output is correct
57 Correct 2 ms 344 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 6 ms 1372 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 2 ms 604 KB Output is correct
63 Correct 3 ms 604 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 432 KB Output is correct
67 Correct 1 ms 600 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Incorrect 1 ms 348 KB 2nd lines differ - on the 110th token, expected: '0', found: '1'
70 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory 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 0 ms 344 KB Output is correct
6 Correct 1 ms 600 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2140 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 3 ms 2904 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 11 ms 1368 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 4 ms 692 KB Output is correct
34 Correct 15 ms 1372 KB Output is correct
35 Incorrect 8 ms 792 KB 2nd lines differ - on the 806th token, expected: '0', found: '1'
36 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory 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 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 0 ms 348 KB Output is correct
9 Correct 0 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 344 KB Output is correct
13 Correct 1 ms 600 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 500 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 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 0 ms 348 KB Output is correct
31 Correct 0 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 356 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 184 ms 164960 KB Output is correct
39 Correct 174 ms 164804 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 1 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 3 ms 2908 KB Output is correct
45 Correct 2 ms 2140 KB Output is correct
46 Correct 2 ms 1884 KB Output is correct
47 Correct 2 ms 2028 KB Output is correct
48 Correct 277 ms 249176 KB Output is correct
49 Correct 223 ms 180052 KB Output is correct
50 Correct 189 ms 164968 KB Output is correct
51 Correct 183 ms 164696 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 1 ms 344 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 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 3 ms 348 KB Output is correct
63 Correct 2 ms 344 KB Output is correct
64 Correct 2 ms 348 KB Output is correct
65 Correct 6 ms 1372 KB Output is correct
66 Correct 370 ms 9664 KB Output is correct
67 Correct 324 ms 8796 KB Output is correct
68 Correct 323 ms 8760 KB Output is correct
69 Correct 1151 ms 92764 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 3 ms 604 KB Output is correct
74 Correct 199 ms 28120 KB Output is correct
75 Correct 556 ms 33140 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 432 KB Output is correct
79 Correct 1 ms 600 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Incorrect 1 ms 348 KB 2nd lines differ - on the 110th token, expected: '0', found: '1'
82 Halted 0 ms 0 KB -