oj.uz

Submission #1052408

# Submission time Handle Problem Language Result Execution time Memory
1052408 2024-08-10T14:20:08 Z Nonoze Graph (BOI20_graph) C++17
58 / 100
 700 ms 33228 KB 
/*
*	Author: Nonoze
*	Created: Wednesday 07/08/2024
*/
#include <bits/stdc++.h>
using namespace std;

namespace std {

// https://judge.yosupo.jp/submission/193613
struct IOPre {
	static constexpr int TEN = 10, SZ = TEN * TEN * TEN * TEN;
	std::array<char, 4 * SZ> num;
	constexpr IOPre() : num{} {
		for (int i = 0; i < SZ; i++) for (int n = i, j = 3; j >= 0; j--) num[i * 4 + j] = n % TEN + '0', n /= TEN;
	}
};

struct IO {
#if !HAVE_DECL_FREAD_UNLOCKED
	#define fread_unlocked fread
#endif
#if !HAVE_DECL_FWRITE_UNLOCKED
	#define fwrite_unlocked fwrite
#endif
	static constexpr int SZ = 1 << 17, LEN = 32, TEN = 10, HUNDRED = TEN * TEN,
						 THOUSAND = HUNDRED * TEN, TENTHOUSAND = THOUSAND * TEN,
						 MAGIC_MULTIPLY = 205, MAGIC_SHIFT = 11, MASK = 15,
						 TWELVE = 12, SIXTEEN = 16;
	static constexpr IOPre io_pre = {};
	std::array<char, SZ> input_buffer, output_buffer;
	int input_ptr_left, input_ptr_right, output_ptr_right;

	IO() : input_buffer{}, output_buffer{}, input_ptr_left{}, input_ptr_right{}, output_ptr_right{} {}
	IO(const IO&) = delete;
	IO(IO&&) = delete;
	IO& operator=(const IO&) = delete;
	IO& operator=(IO&&) = delete;
	~IO() { flush(); }

	template<typename T> static constexpr bool is_char_v    = std::is_same_v<T, char>;
	template<typename T> static constexpr bool is_bool_v    = std::is_same_v<T, bool>;
	template<typename T> static constexpr bool is_string_v  =
			std::is_same_v<T, std::string> || std::is_same_v<T, const char*> ||
			std::is_same_v<T, char*> || std::is_same_v< std::decay_t<T>, char*>;
	template<typename T> static constexpr bool is_default_v =
			is_char_v<T> || is_bool_v<T> || is_string_v<T> || std::is_integral_v<T>;

	inline void load() {
		memmove(std::begin(input_buffer),
				std::begin(input_buffer) + input_ptr_left,
				input_ptr_right - input_ptr_left);
		input_ptr_right =
			input_ptr_right - input_ptr_left +
			fread_unlocked(
				std::begin(input_buffer) + input_ptr_right - input_ptr_left, 1,
				SZ - input_ptr_right + input_ptr_left, stdin);
		input_ptr_left = 0;
	}

	inline void read_char(char& c) {
		if (input_ptr_left + LEN > input_ptr_right) load();
		c = input_buffer[input_ptr_left++];
	}
	inline void read_string(std::string& x) {
		char c;
		while (read_char(c), c < '!') continue;
		x = c;
		while (read_char(c), c >= '!') x += c;
	}
	template<typename T>
	inline std::enable_if_t<std::is_integral_v<T>, void> read_int(T& x) {
		if (input_ptr_left + LEN > input_ptr_right) load();
		char c = 0;
		do c = input_buffer[input_ptr_left++];
		while (c < '-');
		[[maybe_unused]] bool minus = false;
		if constexpr (std::is_signed<T>::value == true)
			if (c == '-') minus = true, c = input_buffer[input_ptr_left++];
		x = 0;
		while (c >= '0')
			x = x * TEN + (c & MASK), c = input_buffer[input_ptr_left++];
		if constexpr (std::is_signed<T>::value == true)
			if (minus) x = -x;
	}

	inline void skip_space() {
		if (input_ptr_left + LEN > input_ptr_right) load();
		while (input_buffer[input_ptr_left] <= ' ') input_ptr_left++;
	}

	inline void flush() {
		fwrite_unlocked(std::begin(output_buffer), 1, output_ptr_right, stdout);
		output_ptr_right = 0;
	}

	inline void write_char(char c) {
		if (output_ptr_right > SZ - LEN) flush();
		output_buffer[output_ptr_right++] = c;
	}

	inline void write_bool(bool b) {
		if (output_ptr_right > SZ - LEN) flush();
		output_buffer[output_ptr_right++] = b ? '1' : '0';
	}

	inline void write_string(const std::string& s) {
		for (auto x : s) write_char(x);
	}

	inline void write_string(const char* s) {
		while (*s) write_char(*s++);
	}

	inline void write_string(char* s) {
		while (*s) write_char(*s++);
	}

	template <typename T>
	inline std::enable_if_t< std::is_integral_v<T>, void> write_int(T x) {
		if (output_ptr_right > SZ - LEN) flush();
		if (!x) {
			output_buffer[output_ptr_right++] = '0';
			return;
		}
		if constexpr (std::is_signed_v<T>) if (x < 0) output_buffer[output_ptr_right++] = '-', x = -x;
		int i = TWELVE;
		std::array<char, SIXTEEN> buf{};
		for (; x >= TENTHOUSAND; x /= TENTHOUSAND, i -= 4)
			memcpy(std::begin(buf) + i, std::begin(io_pre.num) + (x % TENTHOUSAND) * 4, 4);
		if (x < HUNDRED) {
			if (x < TEN) output_buffer[output_ptr_right++] = '0' + x;
			else {
				uint32_t q = (uint32_t(x) * MAGIC_MULTIPLY) >> MAGIC_SHIFT;
				uint32_t r = uint32_t(x) - q * TEN;
				output_buffer[output_ptr_right++] = '0' + q;
				output_buffer[output_ptr_right++] = '0' + r;
			}
		} else {
			if (x < THOUSAND) 
				memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(io_pre.num) + (x << 2) + 1, 3),
				output_ptr_right += 3;
			else
				memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(io_pre.num) + (x << 2), 4),
				output_ptr_right += 4;
		}
		memcpy(std::begin(output_buffer) + output_ptr_right, std::begin(buf) + i + 4, TWELVE - i);
		output_ptr_right += TWELVE - i;
	}

	template <typename T_>
	std::enable_if_t<(is_default_v< std::remove_cv_t< std::remove_reference_t<T_> > >), IO&> operator<<(T_&& x) {
		using T = std::remove_cv_t< std::remove_reference_t<T_> >;
		if constexpr (is_bool_v<T>) write_bool(x);
		else if constexpr (is_string_v<T>) write_string(x);
		else if constexpr (is_char_v<T>) write_char(x);
		else if constexpr (std::is_integral_v<T>) write_int(x);
		return *this;
	}

	template<typename T>
	std::enable_if_t<(is_default_v<T> && !is_bool_v<T>), IO&> operator>>(T& x) {
		if constexpr (is_string_v<T>) read_string(x);
		else if constexpr (is_char_v<T>) read_char(x);
		else if constexpr (std::is_integral_v<T>) read_int(x);
		return *this;
	}

	IO* tie(std::nullptr_t) { return this; }
	void sync_with_stdio(bool) {}
} io;

} // namespace std

using std::io;

// #define cin io

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

// #define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<pair<int, int>> adj[100000];
bool visited[100000];
int weights[100000], obligated[100000];

vector<vector<int>> contains;
vector<int> roots;

void dfspre(int u) {
	visited[u]=1;
	contains.back().pb(u);
	for (auto [v, w] : adj[u]) if (!visited[v]) dfspre(v);
}

void precalc() {
	vector<int> a(n); iota(all(a), 0);
	for (int i: a) if (!visited[i]) {
		contains.pb({});
		dfspre(i);
		roots.pb(i);
		for (auto u: contains.back()) {
			if (sz(adj[u])<sz(adj[roots.back()])) roots.back()=u;
		}
	}
}


int dfs(int u) {
	if (obligated[u]!=-inf && weights[u]!=obligated[u]) return inf;
	visited[u]=1;
	int act=abs(weights[u]);
	for (auto [v, w]: adj[u]) {
		if (weights[v]!=-inf) {
			if (weights[v]+weights[u]!=w) return inf;
			continue;
		}
		weights[v]=w-weights[u];
		int t=dfs(v);
		if (t==inf) return inf;
		act+=t;
	}
	return act;
}

int calcw(int src, int empl, int w) {
	for (auto u: contains[empl]) weights[u]=-inf;
	weights[src]=w;
	return dfs(src);
}

int calc(int src, int empl) {
	int l=-1000, r=1000, ans=0;
	while (l<=r) {
		int mid=(l+r)/2;
		int t1=calcw(src, empl, mid-1), t2=calcw(src, empl, mid+1), t=calcw(src, empl, mid);
		if (t<t1 && t<t2) return t;
		if (t1<t2) r=mid-1, ans=mid-1;
		else l=mid+1, ans=mid+1;
	}
	calcw(src, empl, ans);
	return ans;
}

void solve() {
	cin >> n >> m;
	map<int, int> ver[n];
	for (int i=0; i<n; i++) weights[i]=obligated[i]=-inf;
	for (int i=0; i<m; i++) {
		int u, v, w; cin >> u >> v >> w; u--, v--; if (v<u) swap(u, v);
		if (u==v) {
			if (obligated[u]!=-inf && obligated[u]!=w) quit("NO");
			obligated[u]=w;
			continue;
		}
		if (ver[u].count(v)) {
			if (ver[u][v]==w*2) continue;
			else quit("NO");
		}
		ver[u][v]=w*2;
		adj[u].pb({v, w*2});
		adj[v].pb({u, w*2});
	}
	precalc();
	int empl=-1;
	for (auto src: roots) {
		empl++;
		int obl=-1;
		for (auto u: contains[empl]) if (obligated[u]!=-inf) obl=u;
		if (obl!=-1) {
			src=obl;
			if (calcw(src, empl, obligated[src])==inf) quit("NO");
			continue;
		}
		if (calcw(src, empl, 1)!=inf && calcw(src, empl, 0)!=inf) {
			calc(src, empl);
			continue;
		}
		bool ok=0;
		for (int t=-90; t<=130; t++) {
			int x=calcw(src, empl, t);
			if (x!=inf) {ok=1; break;}
		}
		if (!ok) quit("NO");
	}
	cout << "YES" << endl;
	for (int i=0; i<n; i++) cout << (double)weights[i]/2 << ' ';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3676 KB answer = YES
6 Correct 1 ms 3536 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3676 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3676 KB answer = YES
16 Correct 1 ms 3832 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3676 KB answer = NO
23 Correct 1 ms 3716 KB answer = NO

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3676 KB answer = YES
6 Correct 1 ms 3536 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3676 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3676 KB answer = YES
16 Correct 1 ms 3832 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3676 KB answer = NO
23 Correct 1 ms 3716 KB answer = NO
24 Correct 1 ms 3928 KB answer = YES
25 Correct 1 ms 3676 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3676 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3676 KB answer = YES
36 Correct 1 ms 3676 KB answer = YES

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3676 KB answer = YES
6 Correct 1 ms 3536 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3676 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3676 KB answer = YES
16 Correct 1 ms 3832 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3676 KB answer = NO
23 Correct 1 ms 3716 KB answer = NO
24 Correct 1 ms 3928 KB answer = YES
25 Correct 1 ms 3676 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3676 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3676 KB answer = YES
36 Correct 1 ms 3676 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 1 ms 3932 KB answer = YES
41 Correct 3 ms 3932 KB answer = NO
42 Correct 1 ms 3932 KB answer = YES
43 Correct 1 ms 3676 KB answer = YES
44 Correct 1 ms 3676 KB answer = YES
45 Correct 1 ms 3676 KB answer = YES
46 Correct 1 ms 3676 KB answer = YES
47 Correct 1 ms 3676 KB answer = YES
48 Correct 2 ms 3932 KB answer = YES

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3676 KB answer = YES
6 Correct 1 ms 3536 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3676 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3676 KB answer = YES
16 Correct 1 ms 3832 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3676 KB answer = NO
23 Correct 1 ms 3716 KB answer = NO
24 Correct 1 ms 3928 KB answer = YES
25 Correct 1 ms 3676 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3676 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3676 KB answer = YES
36 Correct 1 ms 3676 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 1 ms 3932 KB answer = YES
41 Correct 3 ms 3932 KB answer = NO
42 Correct 1 ms 3932 KB answer = YES
43 Correct 1 ms 3676 KB answer = YES
44 Correct 1 ms 3676 KB answer = YES
45 Correct 1 ms 3676 KB answer = YES
46 Correct 1 ms 3676 KB answer = YES
47 Correct 1 ms 3676 KB answer = YES
48 Correct 2 ms 3932 KB answer = YES
49 Correct 6 ms 5212 KB answer = YES
50 Correct 7 ms 5468 KB answer = YES
51 Correct 10 ms 5376 KB answer = YES
52 Correct 7 ms 5468 KB answer = NO
53 Correct 1 ms 3928 KB answer = YES
54 Correct 2 ms 4028 KB answer = YES
55 Correct 5 ms 4444 KB answer = YES
56 Correct 11 ms 5212 KB answer = YES
57 Correct 8 ms 5208 KB answer = YES
58 Correct 8 ms 5108 KB answer = YES
59 Correct 6 ms 4956 KB answer = YES
60 Correct 10 ms 5212 KB answer = YES
61 Correct 3 ms 4440 KB answer = YES
62 Correct 5 ms 5140 KB answer = NO
63 Correct 74 ms 18244 KB answer = YES
64 Correct 66 ms 18408 KB answer = NO
65 Correct 71 ms 18448 KB answer = YES
66 Correct 2 ms 3932 KB answer = YES

Subtask #5
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB answer = YES
2 Correct 1 ms 3676 KB answer = YES
3 Correct 1 ms 3676 KB answer = YES
4 Correct 1 ms 3676 KB answer = NO
5 Correct 1 ms 3676 KB answer = YES
6 Correct 1 ms 3536 KB answer = YES
7 Correct 1 ms 3676 KB answer = YES
8 Correct 1 ms 3676 KB answer = YES
9 Correct 1 ms 3676 KB answer = NO
10 Correct 1 ms 3676 KB answer = YES
11 Correct 1 ms 3676 KB answer = YES
12 Correct 1 ms 3676 KB answer = NO
13 Correct 1 ms 3676 KB answer = YES
14 Correct 1 ms 3676 KB answer = YES
15 Correct 1 ms 3676 KB answer = YES
16 Correct 1 ms 3832 KB answer = YES
17 Correct 1 ms 3676 KB answer = YES
18 Correct 1 ms 3676 KB answer = YES
19 Correct 1 ms 3676 KB answer = YES
20 Correct 1 ms 3676 KB answer = YES
21 Correct 1 ms 3676 KB answer = YES
22 Correct 1 ms 3676 KB answer = NO
23 Correct 1 ms 3716 KB answer = NO
24 Correct 1 ms 3928 KB answer = YES
25 Correct 1 ms 3676 KB answer = YES
26 Correct 1 ms 3676 KB answer = YES
27 Correct 1 ms 3676 KB answer = YES
28 Correct 1 ms 3676 KB answer = YES
29 Correct 1 ms 3676 KB answer = YES
30 Correct 1 ms 3676 KB answer = NO
31 Correct 1 ms 3676 KB answer = YES
32 Correct 1 ms 3676 KB answer = YES
33 Correct 1 ms 3676 KB answer = YES
34 Correct 1 ms 3676 KB answer = YES
35 Correct 1 ms 3676 KB answer = YES
36 Correct 1 ms 3676 KB answer = YES
37 Correct 1 ms 3672 KB answer = YES
38 Correct 1 ms 3676 KB answer = YES
39 Correct 1 ms 3676 KB answer = YES
40 Correct 1 ms 3932 KB answer = YES
41 Correct 3 ms 3932 KB answer = NO
42 Correct 1 ms 3932 KB answer = YES
43 Correct 1 ms 3676 KB answer = YES
44 Correct 1 ms 3676 KB answer = YES
45 Correct 1 ms 3676 KB answer = YES
46 Correct 1 ms 3676 KB answer = YES
47 Correct 1 ms 3676 KB answer = YES
48 Correct 2 ms 3932 KB answer = YES
49 Correct 6 ms 5212 KB answer = YES
50 Correct 7 ms 5468 KB answer = YES
51 Correct 10 ms 5376 KB answer = YES
52 Correct 7 ms 5468 KB answer = NO
53 Correct 1 ms 3928 KB answer = YES
54 Correct 2 ms 4028 KB answer = YES
55 Correct 5 ms 4444 KB answer = YES
56 Correct 11 ms 5212 KB answer = YES
57 Correct 8 ms 5208 KB answer = YES
58 Correct 8 ms 5108 KB answer = YES
59 Correct 6 ms 4956 KB answer = YES
60 Correct 10 ms 5212 KB answer = YES
61 Correct 3 ms 4440 KB answer = YES
62 Correct 5 ms 5140 KB answer = NO
63 Correct 74 ms 18244 KB answer = YES
64 Correct 66 ms 18408 KB answer = NO
65 Correct 71 ms 18448 KB answer = YES
66 Correct 2 ms 3932 KB answer = YES
67 Correct 67 ms 21980 KB answer = YES
68 Correct 69 ms 21980 KB answer = YES
69 Correct 106 ms 21980 KB answer = YES
70 Correct 141 ms 33228 KB answer = YES
71 Correct 109 ms 21980 KB answer = YES
72 Correct 147 ms 17880 KB answer = YES
73 Correct 141 ms 17888 KB answer = YES
74 Correct 59 ms 15060 KB answer = YES
75 Correct 50 ms 15060 KB answer = NO
76 Correct 12 ms 5468 KB answer = YES
77 Correct 29 ms 7452 KB answer = YES
78 Correct 53 ms 10072 KB answer = YES
79 Correct 119 ms 16084 KB answer = YES
80 Correct 79 ms 15564 KB answer = YES
81 Correct 490 ms 21448 KB answer = NO
82 Correct 70 ms 21576 KB answer = YES
83 Correct 322 ms 21968 KB answer = YES
84 Correct 231 ms 22092 KB answer = YES
85 Correct 69 ms 21964 KB answer = YES
86 Correct 98 ms 21980 KB answer = YES
87 Correct 413 ms 18892 KB answer = NO
88 Execution timed out 744 ms 19388 KB Time limit exceeded
89 Halted 0 ms 0 KB -