oj.uz

Submission #940298

# Submission time Handle Problem Language Result Execution time Memory
940298 2024-03-07T07:42:17 Z Trisanu_Das Beech Tree (IOI23_beechtree) C++17
71 / 100
 1680 ms 280108 KB 
#include<bits/stdc++.h>
 
#include <utility>
#include "beechtree.h"
 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
 
using namespace std;
 
using g_t = vector<vector<int>>;
 
struct dVal {
	unordered_map<int, int> de;
	list<set<pair<int, int>>> se;
	int seSi;
};
 
struct unordered_mapsVal {
	map<int, int> maDe;
	unordered_map<int, unordered_map<int, map<int, int>>> maCDe;
	unordered_map<int, map<int, int>> maCat;
	map<int, int> miDe;
	unordered_map<int, unordered_map<int, map<int, int>>> miCDe;
	map<int, map<int, int>> miCat;
};
 
struct sdVal {
	vector<pair<int, int>> edg;
	unordered_map<int, unordered_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;
g_t g;
vector<bool> po;
vector<int> c;
 
 
 
dVal dfs(int n) {
	unordered_map<int, int> r;
	unordered_map<int, vector<pair<int, int>>> ve;
	list<set<pair<int, int>>> se;
	unordered_map<int, unordered_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);
		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 != se.end() && 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, vector<bool> &vis) {
	if (vis[n]) return {};
	vis[n] = true;
	sdVal res;
	for (auto e: g[n]) {
		auto re = sdfs(e, vis);
		if (!po[e]) po[n] = false;
		if (!po[n]) continue;
		if (re.edg.size() > res.edg.size()) {
			swap(re, res);
		}
		re.edg.emplace_back(e, n);
		for (auto &ed: re.edg) {
			res.edg.push_back(ed);
			auto &ch = de2[ed.first];
			auto &miDe = res.maV[ch.actC].miDe;
			auto up = miDe.upper_bound(ch.pDe);
			if (up != miDe.end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (miDe.find(ch.pDe) == miDe.end())
				miDe[ch.pDe] = ch.actDe;
			miDe[ch.pDe] = min(miDe[ch.pDe], ch.actDe);
			auto &miCDe = res.maV[ch.actC].miCDe[ch.pC][ch.pDe];
			up = miCDe.upper_bound(de2[ed.second].pDe);
			if (up != miCDe.end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (miCDe.find(de2[ed.second].pDe) == miCDe.end())
				miCDe[de2[ed.second].pDe] = ch.actDe;
			miCDe[de2[ed.second].pDe] = min(
					miCDe[de2[ed.second].pDe], ch.actDe);
			auto &miCat =  res.maV[ch.actC].miCat[de2[ed.second].cat];
			up = miCat.upper_bound(-ch.pO);
			if (up != miCat.end() && up->second < ch.actDe) {
				po[n] = false;
				break;
			}
			if (miCat.find(-ch.pO) == miCat.end())
				miCat[-ch.pO] = ch.actDe;
			miCat[-ch.pO] = min(miCat[-ch.pO], ch.actDe);
			auto &maDe =  res.maV[ch.actC].maDe;
			up = maDe.upper_bound(-ch.pDe);
			if (up !=maDe.end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (maDe.find(-ch.pDe) == maDe.end())
				maDe[-ch.pDe] = ch.actDe;
			maDe[-ch.pDe] = max(maDe[-ch.pDe], ch.actDe);
			auto &maCDe = res.maV[ch.actC].maCDe[ch.pC][ch.pDe];
			up = maCDe.upper_bound(-de2[ed.second].pDe);
			if (up != maCDe.end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (maCDe.find(-de2[ed.second].pDe) == maCDe.end())
				maCDe[-de2[ed.second].pDe] = ch.actDe;
			maCDe[-de2[ed.second].pDe] = max(
					maCDe[-de2[ed.second].pDe], ch.actDe);
			auto &maCat = res.maV[ch.actC].maCat[de2[ed.second].cat];
			up = maCat.upper_bound(ch.pO);
			if (up != maCat.end() && up->second > ch.actDe) {
				po[n] = false;
				break;
			}
			if (maCat.find(ch.pO) == maCat.end())
				maCat[ch.pO] = ch.actDe;
			maCat[ch.pO] = max(maCat[ch.pO], ch.actDe);
		}
	}
	return std::move(res);
}
 
void bfs(int n, 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 = g_t(N);
	for (int i = 1; i < N; ++i) {
		g[P[i]].push_back(i);
	}
	de = vector<int>(N);
	de2 = vector<BFSSorting>(N);
	po= vector<bool> (N, true);
	c = std::move(C);
	dfs(0);
	vector<bool> vis(N, false);
	for (int i = 0; i < N; ++i) {
		if (po[i]) {
			bfs(i, vis);
		}
	}
	std::fill(vis.begin(), vis.end(), false);
	for (int i = 0; i < N; ++i) {
		if (po[i]) {
			sdfs(i, vis);
		}
	}
	return {po.begin(), po.end()};
}

Compilation message

beechtree.cpp: In function 'sdVal sdfs(int, std::vector<bool>&)':
beechtree.cpp:203:18: warning: moving a local object in a return statement prevents copy elision [-Wpessimizing-move]
  203 |  return std::move(res);
      |         ~~~~~~~~~^~~~~
beechtree.cpp:203:18: note: remove 'std::move' call

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 388 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 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 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 432 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 0 ms 436 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 436 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 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 432 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 412 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 600 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 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 219 ms 207968 KB Output is correct
8 Correct 234 ms 208064 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 5 ms 3008 KB Output is correct
14 Correct 4 ms 2652 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2392 KB Output is correct
17 Correct 791 ms 280108 KB Output is correct
18 Correct 567 ms 234880 KB Output is correct
19 Correct 289 ms 207956 KB Output is correct
20 Correct 213 ms 207952 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 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 2 ms 440 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 444 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 233 ms 10684 KB Output is correct
16 Correct 213 ms 9872 KB Output is correct
17 Correct 214 ms 9948 KB Output is correct
18 Correct 816 ms 111868 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 219 ms 207968 KB Output is correct
6 Correct 234 ms 208064 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 221 ms 33096 KB Output is correct
12 Correct 332 ms 41908 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 432 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 0 ms 436 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 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 412 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 600 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 600 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 440 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 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 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 1 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 544 KB Output is correct
64 Correct 1 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 432 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 436 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 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 0 ms 348 KB Output is correct
20 Correct 1 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 432 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 3164 KB Output is correct
26 Correct 4 ms 2652 KB Output is correct
27 Correct 3 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 5 ms 3164 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 10 ms 1372 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 8 ms 1468 KB Output is correct
35 Correct 6 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 1372 KB Output is correct
38 Correct 3 ms 1112 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 432 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 0 ms 436 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 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 412 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 600 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 600 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 440 KB Output is correct
42 Correct 5 ms 3008 KB Output is correct
43 Correct 4 ms 2652 KB Output is correct
44 Correct 3 ms 2396 KB Output is correct
45 Correct 2 ms 2392 KB Output is correct
46 Correct 1 ms 348 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 2 ms 440 KB Output is correct
57 Correct 3 ms 344 KB Output is correct
58 Correct 2 ms 444 KB Output is correct
59 Correct 4 ms 1628 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 604 KB Output is correct
63 Correct 2 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 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 1 ms 544 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 5 ms 3164 KB Output is correct
76 Correct 4 ms 2652 KB Output is correct
77 Correct 3 ms 2396 KB Output is correct
78 Correct 2 ms 2396 KB Output is correct
79 Correct 5 ms 3164 KB Output is correct
80 Correct 4 ms 1112 KB Output is correct
81 Correct 10 ms 1372 KB Output is correct
82 Correct 7 ms 860 KB Output is correct
83 Correct 4 ms 604 KB Output is correct
84 Correct 8 ms 1468 KB Output is correct
85 Correct 6 ms 604 KB Output is correct
86 Correct 4 ms 604 KB Output is correct
87 Correct 4 ms 1372 KB Output is correct
88 Correct 3 ms 1112 KB Output is correct
89 Correct 5 ms 2396 KB Output is correct
90 Correct 4 ms 860 KB Output is correct
91 Correct 7 ms 1372 KB Output is correct
92 Correct 6 ms 860 KB Output is correct
93 Correct 4 ms 856 KB Output is correct
94 Correct 7 ms 1372 KB Output is correct
95 Correct 6 ms 840 KB Output is correct
96 Correct 4 ms 448 KB Output is correct
97 Correct 5 ms 1492 KB Output is correct
98 Correct 3 ms 1116 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 432 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 436 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 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 0 ms 348 KB Output is correct
20 Correct 1 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 432 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 3164 KB Output is correct
26 Correct 4 ms 2652 KB Output is correct
27 Correct 3 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 5 ms 3164 KB Output is correct
30 Correct 4 ms 1112 KB Output is correct
31 Correct 10 ms 1372 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 8 ms 1468 KB Output is correct
35 Correct 6 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 1372 KB Output is correct
38 Correct 3 ms 1112 KB Output is correct
39 Correct 777 ms 279632 KB Output is correct
40 Correct 523 ms 225364 KB Output is correct
41 Correct 464 ms 209572 KB Output is correct
42 Correct 255 ms 207096 KB Output is correct
43 Correct 825 ms 233796 KB Output is correct
44 Correct 539 ms 63728 KB Output is correct
45 Correct 1680 ms 94636 KB Output is correct
46 Correct 800 ms 28136 KB Output is correct
47 Incorrect 596 ms 22312 KB 2nd lines differ - on the 43958th token, expected: '0', found: '1'
48 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 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 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 432 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 0 ms 436 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 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 412 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 600 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 219 ms 207968 KB Output is correct
39 Correct 234 ms 208064 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 440 KB Output is correct
44 Correct 5 ms 3008 KB Output is correct
45 Correct 4 ms 2652 KB Output is correct
46 Correct 3 ms 2396 KB Output is correct
47 Correct 2 ms 2392 KB Output is correct
48 Correct 791 ms 280108 KB Output is correct
49 Correct 567 ms 234880 KB Output is correct
50 Correct 289 ms 207956 KB Output is correct
51 Correct 213 ms 207952 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 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 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 2 ms 440 KB Output is correct
63 Correct 3 ms 344 KB Output is correct
64 Correct 2 ms 444 KB Output is correct
65 Correct 4 ms 1628 KB Output is correct
66 Correct 233 ms 10684 KB Output is correct
67 Correct 213 ms 9872 KB Output is correct
68 Correct 214 ms 9948 KB Output is correct
69 Correct 816 ms 111868 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 221 ms 33096 KB Output is correct
75 Correct 332 ms 41908 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 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 1 ms 544 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 5 ms 3164 KB Output is correct
88 Correct 4 ms 2652 KB Output is correct
89 Correct 3 ms 2396 KB Output is correct
90 Correct 2 ms 2396 KB Output is correct
91 Correct 5 ms 3164 KB Output is correct
92 Correct 4 ms 1112 KB Output is correct
93 Correct 10 ms 1372 KB Output is correct
94 Correct 7 ms 860 KB Output is correct
95 Correct 4 ms 604 KB Output is correct
96 Correct 8 ms 1468 KB Output is correct
97 Correct 6 ms 604 KB Output is correct
98 Correct 4 ms 604 KB Output is correct
99 Correct 4 ms 1372 KB Output is correct
100 Correct 3 ms 1112 KB Output is correct
101 Correct 5 ms 2396 KB Output is correct
102 Correct 4 ms 860 KB Output is correct
103 Correct 7 ms 1372 KB Output is correct
104 Correct 6 ms 860 KB Output is correct
105 Correct 4 ms 856 KB Output is correct
106 Correct 7 ms 1372 KB Output is correct
107 Correct 6 ms 840 KB Output is correct
108 Correct 4 ms 448 KB Output is correct
109 Correct 5 ms 1492 KB Output is correct
110 Correct 3 ms 1116 KB Output is correct
111 Correct 777 ms 279632 KB Output is correct
112 Correct 523 ms 225364 KB Output is correct
113 Correct 464 ms 209572 KB Output is correct
114 Correct 255 ms 207096 KB Output is correct
115 Correct 825 ms 233796 KB Output is correct
116 Correct 539 ms 63728 KB Output is correct
117 Correct 1680 ms 94636 KB Output is correct
118 Correct 800 ms 28136 KB Output is correct
119 Incorrect 596 ms 22312 KB 2nd lines differ - on the 43958th token, expected: '0', found: '1'
120 Halted 0 ms 0 KB -