oj.uz

답안 #650918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650918 2022-10-16T03:59:19 Z Benq Uplifting Excursion (BOI22_vault) C++17
90 / 100
 5000 ms 319500 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;

using ll = long long;
using db = long double; // or double, if TL is tight
using str = string;		// yay python!

// pairs
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define mp make_pair
#define f first
#define s second

#define tcT template <class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()

#define lb lower_bound
#define ub upper_bound
tcT > int lwb(V<T> &a, const T &b) { return int(lb(all(a), b) - bg(a)); }
tcT > int upb(V<T> &a, const T &b) { return int(ub(all(a), b) - bg(a)); }

// loops
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)

const int MOD = (int)1e9 + 7; // 998244353;
const int MX = (int)2e5 + 5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(
	int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
	return x == 0 ? 0 : 31 - __builtin_clz(x);
} // floor(log2(x))
constexpr int p2(int x) { return 1 << x; }
constexpr int msk2(int x) { return p2(x) - 1; }

ll cdiv(ll a, ll b) {
	return a / b + ((a ^ b) > 0 && a % b);
} // divide a by b rounded up
ll fdiv(ll a, ll b) {
	return a / b - ((a ^ b) < 0 && a % b);
} // divide a by b rounded down

tcT > bool ckmin(T &a, const T &b) {
	return b < a ? a = b, 1 : 0;
} // set a = min(a,b)
tcT > bool ckmax(T &a, const T &b) {
	return a < b ? a = b, 1 : 0;
} // set a = max(a,b)

tcTU > T fstTrue(T lo, T hi, U f) {
	++hi;
	assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true
		T mid = lo + (hi - lo) / 2;
		f(mid) ? hi = mid : lo = mid + 1;
	}
	return lo;
}
tcTU > T lstTrue(T lo, T hi, U f) {
	--lo;
	assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true
		T mid = lo + (hi - lo + 1) / 2;
		f(mid) ? lo = mid : hi = mid - 1;
	}
	return lo;
}
tcT > void remDup(vector<T> &v) { // sort and remove duplicates
	sort(all(v));
	v.erase(unique(all(v)), end(v));
}
tcTU > void erase(T &t, const U &u) { // don't erase
	auto it = t.find(u);
	assert(it != end(t));
	t.erase(it);
} // element that doesn't exist from (multi)set

#define tcTUU tcT, class... U

inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void > struct is_iterable : false_type {};
tcT > struct is_iterable<
		  T, void_t<decltype(begin(declval<T>())), decltype(end(declval<T>()))>>
	: true_type {};
tcT > constexpr bool is_iterable_v = is_iterable<T>::value;

//////////// is_readable
tcT, class = void > struct is_readable : false_type {};
tcT > struct is_readable<T, typename std::enable_if_t<is_same_v<
								decltype(cin >> declval<T &>()), istream &>>>
	: true_type {};
tcT > constexpr bool is_readable_v = is_readable<T>::value;

//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void > struct is_printable : false_type {};
tcT > struct is_printable<T, typename std::enable_if_t<is_same_v<
								 decltype(cout << declval<T>()), ostream &>>>
	: true_type {};
tcT > constexpr bool is_printable_v = is_printable<T>::value;
} // namespace Helpers

inline namespace Input {
tcT > constexpr bool needs_input_v = !is_readable_v<T> && is_iterable_v<T>;
tcTUU > void re(T &t, U &...u);
tcTU > void re(pair<T, U> &p); // pairs

// re: read
tcT > typename enable_if<is_readable_v<T>, void>::type re(T &x) {
	cin >> x;
} // default
tcT > void re(complex<T> &c) {
	T a, b;
	re(a, b);
	c = {a, b};
} // complex
tcT > typename enable_if<needs_input_v<T>, void>::type
	  re(T &i); // ex. vectors, arrays
tcTU > void re(pair<T, U> &p) { re(p.f, p.s); }
tcT > typename enable_if<needs_input_v<T>, void>::type re(T &i) {
	each(x, i) re(x);
}
tcTUU > void re(T &t, U &...u) {
	re(t);
	re(u...);
} // read multiple

// rv: resize and read vectors
void rv(size_t) {}
tcTUU > void rv(size_t N, V<T> &t, U &...u);
template <class... U> void rv(size_t, size_t N2, U &...u);
tcTUU > void rv(size_t N, V<T> &t, U &...u) {
	t.rsz(N);
	re(t);
	rv(N, u...);
}
template <class... U> void rv(size_t, size_t N2, U &...u) { rv(N2, u...); }

// dumb shortcuts to read in ints
void decrement() {} // subtract one from each
tcTUU > void decrement(T &t, U &...u) {
	--t;
	decrement(u...);
}
#define ints(...)                                                              \
	int __VA_ARGS__;                                                           \
	re(__VA_ARGS__);
#define int1(...)                                                              \
	ints(__VA_ARGS__);                                                         \
	decrement(__VA_ARGS__);
} // namespace Input

inline namespace ToString {
tcT > constexpr bool needs_output_v = !is_printable_v<T> && is_iterable_v<T>;

// ts: string representation to print
tcT > typename enable_if<is_printable_v<T>, str>::type ts(T v) {
	stringstream ss;
	ss << fixed << setprecision(15) << v;
	return ss.str();
} // default
tcT > str bit_vec(T t) { // bit vector to string
	str res = "{";
	F0R(i, sz(t)) res += ts(t[i]);
	res += "}";
	return res;
}
str ts(V<bool> v) { return bit_vec(v); }
template <size_t SZ> str ts(bitset<SZ> b) { return bit_vec(b); } // bit vector
tcTU > str ts(pair<T, U> p);									 // pairs
tcT >
	typename enable_if<needs_output_v<T>, str>::type ts(T v); // vectors, arrays
tcTU > str ts(pair<T, U> p) { return "(" + ts(p.f) + ", " + ts(p.s) + ")"; }
tcT > typename enable_if<is_iterable_v<T>, str>::type ts_sep(T v, str sep) {
	// convert container to string w/ separator sep
	bool fst = 1;
	str res = "";
	for (const auto &x : v) {
		if (!fst) res += sep;
		fst = 0;
		res += ts(x);
	}
	return res;
}
tcT > typename enable_if<needs_output_v<T>, str>::type ts(T v) {
	return "{" + ts_sep(v, ", ") + "}";
}

// for nested DS
template <int, class T>
typename enable_if<!needs_output_v<T>, vs>::type ts_lev(const T &v) {
	return {ts(v)};
}
template <int lev, class T>
typename enable_if<needs_output_v<T>, vs>::type ts_lev(const T &v) {
	if (lev == 0 || !sz(v)) return {ts(v)};
	vs res;
	for (const auto &t : v) {
		if (sz(res)) res.bk += ",";
		vs tmp = ts_lev<lev - 1>(t);
		res.ins(end(res), all(tmp));
	}
	F0R(i, sz(res)) {
		str bef = " ";
		if (i == 0) bef = "{";
		res[i] = bef + res[i];
	}
	res.bk += "}";
	return res;
}
} // namespace ToString

inline namespace Output {
template <class T> void pr_sep(ostream &os, str, const T &t) { os << ts(t); }
template <class T, class... U>
void pr_sep(ostream &os, str sep, const T &t, const U &...u) {
	pr_sep(os, sep, t);
	os << sep;
	pr_sep(os, sep, u...);
}
// print w/ no spaces
template <class... T> void pr(const T &...t) { pr_sep(cout, "", t...); }
// print w/ spaces, end with newline
void ps() { cout << "\n"; }
template <class... T> void ps(const T &...t) {
	pr_sep(cout, " ", t...);
	ps();
}
// debug to cerr
template <class... T> void dbg_out(const T &...t) {
	pr_sep(cerr, " | ", t...);
	cerr << endl;
}
void loc_info(int line, str names) {
	cerr << "Line(" << line << ") -> [" << names << "]: ";
}
template <int lev, class T> void dbgl_out(const T &t) {
	cerr << "\n\n" << ts_sep(ts_lev<lev>(t), "\n") << "\n" << endl;
}
#ifdef LOCAL
#define dbg(...) loc_info(__LINE__, #__VA_ARGS__), dbg_out(__VA_ARGS__)
#define dbgl(lev, x) loc_info(__LINE__, #x), dbgl_out<lev>(x)
#else // don't actually submit with this
#define dbg(...) 0
#define dbgl(lev, x) 0
#endif

const clock_t beg = clock();
#define dbg_time() dbg((db)(clock() - beg) / CLOCKS_PER_SEC)
} // namespace Output

inline namespace FileIO {
void setIn(str s) { freopen(s.c_str(), "r", stdin); }
void setOut(str s) { freopen(s.c_str(), "w", stdout); }
void setIO(str s = "") {
	cin.tie(0)->sync_with_stdio(0); // unsync C / C++ I/O streams
	// cin.exceptions(cin.failbit);
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) setIn(s + ".in"), setOut(s + ".out"); // for old USACO
}
} // namespace FileIO

// conditions:
// <M unused out of negatives or <M unused out of positives
// you can split at some positive index such that <M unused on both sides

int M;

void add_min(vi &dp, int sum, int num) {
	assert(num > 0);
	if (sum > 0) {
		R0F(i, sz(dp) - sum) {
			if (dp[i] != M) ckmin(dp[i + sum], dp[i] + num);
		}

	} else {
		FOR(i, -sum, sz(dp)) {
			if (dp[i] != M) ckmin(dp[i + sum], dp[i] + num);
		}
	}
}

void add_max(vi &dp, int sum, int num) {
	if (sum > 0) {
		// dbg("ADD MAX", sum, num);
		R0F(i, sz(dp) - sum) {
			if (dp[i] != -1) ckmax(dp[i + sum], dp[i] + num);
		}
		// dbg("DONE MAX", sum, num);
	} else {
		FOR(i, -sum, sz(dp)) {
			if (dp[i] != -1) ckmax(dp[i + sum], dp[i] + num);
		}
	}
}

ll ans = -1;

void add_min_all(vi &v, int x, ll num) {
	ckmin(num, (ll)M - 1);
	// dbg("add min all", x, num);
	for (int j = 1;; j *= 2) {
		ckmin(j, (int)num);
		if (j == 0) break;
		num -= j;
		add_min(v, j * x, j);
	}
}

void add_max_all(vi &v, int x, ll num) {
	ckmin(num, (ll)M - 1);
	for (int j = 1;; j *= 2) {
		ckmin(j, (int)num);
		if (j == 0) break;
		num -= j;
		add_max(v, j * x, j);
	}
}

void solve(vl A, ll L) {
	ll tot_sum = 0;
	FOR(i, -M, M + 1) tot_sum += i * A.at(i + M);
	if (tot_sum + M * M < L) return;
	V<vi> psums(M + 1, vi(2 * M * M + 1, M));
	psums.ft.at(M * M) = 0;
	FOR(x, -M, 0) { add_min_all(psums.at(0), x, A.at(x + M)); }
	FOR(x, 1, M + 1) {
		psums.at(x) = psums.at(x - 1);
		add_min_all(psums.at(x), x, A.at(x + M));
	}
	V<vi> suf_sums(M + 2, vi(M * M, -1));
	suf_sums.bk.at(0) = 0;
	ROF(x, 1, M + 1) {
		suf_sums.at(x) = suf_sums.at(x + 1);
		add_max_all(suf_sums.at(x), x, A.at(x + M));
	}
	ll sum_so_far = 0, num_so_far = 0;
	FOR(i, -M, 1) {
		sum_so_far += A.at(i + M) * i;
		num_so_far += A.at(i + M);
	}
	FOR(x, 1, M + 1) {
		// sum_so_far - i + ? * x + j = L
		FOR(i, -M * M, M * x) if (psums.at(x - 1).at(i + M * M) < M) {
			ll rem = L - sum_so_far + i; // 5 - ()
			if (rem < 0) continue;
			ll j = 0;
			ckmax(j, rem - x * A.at(x + M));
			int dif = (rem % x - j % x);
			if (dif < 0) dif += x;
			j += dif;
			for (; j < M * M && j <= rem; j += x) {
				assert((rem - j) % x == 0);
				ll need_x = (rem - j) / x;
				// at least j/M numbers
				if (j / M >= x && A.at(x + M) - need_x >= M) break;
				if (suf_sums.at(x + 1).at(j) != -1) {
					if (ckmax(ans, num_so_far - psums.at(x - 1).at(i + M * M) +
									   suf_sums.at(x + 1).at(j) + need_x)) {}
				}
			}
		} // M^2 * (M^2/x)
		sum_so_far += A.at(x + M) * x;
		num_so_far += A.at(x + M);
	}
}

int main() {
	// read read read
	setIO();
	re(M);
	ll L;
	re(L);
	vl A(2 * M + 1);
	re(A);
	solve(A, L);
	reverse(all(A));
	solve(A, -L);
	if (ans == -1) ps("impossible");
	else ps(ans);

	// everything < M*M:

	// you should actually read the stuff at the bottom
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

Compilation message

vault.cpp: In function 'void FileIO::setIn(str)':
vault.cpp:312:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  312 | void setIn(str s) { freopen(s.c_str(), "r", stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
vault.cpp: In function 'void FileIO::setOut(str)':
vault.cpp:313:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  313 | void setOut(str s) { freopen(s.c_str(), "w", stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 5 ms 1748 KB Output is correct
6 Correct 21 ms 1756 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 15 ms 1748 KB Output is correct
9 Correct 18 ms 1748 KB Output is correct
10 Correct 5 ms 1756 KB Output is correct
11 Correct 6 ms 1756 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 5 ms 1748 KB Output is correct
6 Correct 21 ms 1756 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 15 ms 1748 KB Output is correct
9 Correct 18 ms 1748 KB Output is correct
10 Correct 5 ms 1756 KB Output is correct
11 Correct 6 ms 1756 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1728 KB Output is correct
17 Correct 21 ms 1756 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 12 ms 1852 KB Output is correct
20 Correct 17 ms 1748 KB Output is correct
21 Correct 5 ms 1756 KB Output is correct
22 Correct 5 ms 1756 KB Output is correct
23 Correct 44 ms 12272 KB Output is correct
24 Correct 167 ms 12272 KB Output is correct
25 Correct 21 ms 12244 KB Output is correct
26 Correct 99 ms 12284 KB Output is correct
27 Correct 120 ms 12276 KB Output is correct
28 Correct 36 ms 12308 KB Output is correct
29 Correct 39 ms 12248 KB Output is correct

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 724 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 2 ms 648 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 6 ms 648 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 648 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 4 ms 1760 KB Output is correct
22 Correct 5 ms 1760 KB Output is correct
23 Correct 8 ms 1756 KB Output is correct
24 Correct 8 ms 1852 KB Output is correct
25 Correct 7 ms 1756 KB Output is correct
26 Correct 6 ms 1756 KB Output is correct
27 Correct 4 ms 1760 KB Output is correct
28 Correct 6 ms 1756 KB Output is correct

Subtask #4-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 5 ms 1748 KB Output is correct
6 Correct 21 ms 1756 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 15 ms 1748 KB Output is correct
9 Correct 18 ms 1748 KB Output is correct
10 Correct 5 ms 1756 KB Output is correct
11 Correct 6 ms 1756 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 648 KB Output is correct
28 Correct 3 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 6 ms 648 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 3 ms 596 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 648 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 4 ms 1760 KB Output is correct
51 Correct 5 ms 1760 KB Output is correct
52 Correct 8 ms 1756 KB Output is correct
53 Correct 8 ms 1852 KB Output is correct
54 Correct 7 ms 1756 KB Output is correct
55 Correct 6 ms 1756 KB Output is correct
56 Correct 4 ms 1760 KB Output is correct
57 Correct 6 ms 1756 KB Output is correct
58 Correct 1 ms 220 KB Output is correct
59 Correct 1 ms 220 KB Output is correct
60 Correct 1 ms 220 KB Output is correct
61 Correct 1 ms 220 KB Output is correct
62 Correct 5 ms 1756 KB Output is correct
63 Correct 21 ms 1852 KB Output is correct
64 Correct 3 ms 1748 KB Output is correct
65 Correct 11 ms 1748 KB Output is correct
66 Correct 14 ms 1844 KB Output is correct
67 Correct 4 ms 1756 KB Output is correct
68 Correct 5 ms 1852 KB Output is correct
69 Correct 2 ms 596 KB Output is correct
70 Correct 2 ms 648 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 2 ms 596 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 596 KB Output is correct
76 Correct 1 ms 600 KB Output is correct
77 Correct 2 ms 596 KB Output is correct
78 Correct 6 ms 648 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 3 ms 596 KB Output is correct
81 Correct 4 ms 596 KB Output is correct
82 Correct 2 ms 596 KB Output is correct
83 Correct 8 ms 1748 KB Output is correct
84 Correct 7 ms 1852 KB Output is correct
85 Correct 8 ms 1852 KB Output is correct
86 Correct 5 ms 1748 KB Output is correct
87 Correct 4 ms 1748 KB Output is correct
88 Correct 7 ms 1748 KB Output is correct
89 Correct 28 ms 1860 KB Output is correct
90 Correct 15 ms 1752 KB Output is correct
91 Correct 15 ms 1752 KB Output is correct
92 Correct 8 ms 1752 KB Output is correct

Subtask #5-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 648 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 4 ms 1760 KB Output is correct
22 Correct 5 ms 1760 KB Output is correct
23 Correct 8 ms 1756 KB Output is correct
24 Correct 8 ms 1852 KB Output is correct
25 Correct 7 ms 1756 KB Output is correct
26 Correct 6 ms 1756 KB Output is correct
27 Correct 4 ms 1760 KB Output is correct
28 Correct 6 ms 1756 KB Output is correct
29 Correct 1 ms 216 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 2 ms 656 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 5 ms 1756 KB Output is correct
40 Correct 5 ms 1756 KB Output is correct
41 Correct 8 ms 1844 KB Output is correct
42 Correct 8 ms 1852 KB Output is correct
43 Correct 9 ms 1748 KB Output is correct
44 Correct 6 ms 1748 KB Output is correct
45 Correct 3 ms 1748 KB Output is correct
46 Correct 6 ms 1748 KB Output is correct
47 Correct 35 ms 12284 KB Output is correct
48 Correct 34 ms 12248 KB Output is correct
49 Correct 63 ms 12276 KB Output is correct
50 Correct 60 ms 12424 KB Output is correct
51 Correct 57 ms 12236 KB Output is correct
52 Correct 51 ms 12244 KB Output is correct
53 Correct 28 ms 12280 KB Output is correct
54 Correct 47 ms 12244 KB Output is correct

Subtask #5-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 5 ms 1748 KB Output is correct
6 Correct 21 ms 1756 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 15 ms 1748 KB Output is correct
9 Correct 18 ms 1748 KB Output is correct
10 Correct 5 ms 1756 KB Output is correct
11 Correct 6 ms 1756 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1728 KB Output is correct
17 Correct 21 ms 1756 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 12 ms 1852 KB Output is correct
20 Correct 17 ms 1748 KB Output is correct
21 Correct 5 ms 1756 KB Output is correct
22 Correct 5 ms 1756 KB Output is correct
23 Correct 44 ms 12272 KB Output is correct
24 Correct 167 ms 12272 KB Output is correct
25 Correct 21 ms 12244 KB Output is correct
26 Correct 99 ms 12284 KB Output is correct
27 Correct 120 ms 12276 KB Output is correct
28 Correct 36 ms 12308 KB Output is correct
29 Correct 39 ms 12248 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 2 ms 648 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 6 ms 648 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 2 ms 648 KB Output is correct
61 Correct 2 ms 596 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 596 KB Output is correct
65 Correct 1 ms 596 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 2 ms 600 KB Output is correct
68 Correct 4 ms 1760 KB Output is correct
69 Correct 5 ms 1760 KB Output is correct
70 Correct 8 ms 1756 KB Output is correct
71 Correct 8 ms 1852 KB Output is correct
72 Correct 7 ms 1756 KB Output is correct
73 Correct 6 ms 1756 KB Output is correct
74 Correct 4 ms 1760 KB Output is correct
75 Correct 6 ms 1756 KB Output is correct
76 Correct 1 ms 220 KB Output is correct
77 Correct 1 ms 220 KB Output is correct
78 Correct 1 ms 220 KB Output is correct
79 Correct 1 ms 220 KB Output is correct
80 Correct 5 ms 1756 KB Output is correct
81 Correct 21 ms 1852 KB Output is correct
82 Correct 3 ms 1748 KB Output is correct
83 Correct 11 ms 1748 KB Output is correct
84 Correct 14 ms 1844 KB Output is correct
85 Correct 4 ms 1756 KB Output is correct
86 Correct 5 ms 1852 KB Output is correct
87 Correct 2 ms 596 KB Output is correct
88 Correct 2 ms 648 KB Output is correct
89 Correct 1 ms 596 KB Output is correct
90 Correct 2 ms 596 KB Output is correct
91 Correct 1 ms 596 KB Output is correct
92 Correct 1 ms 596 KB Output is correct
93 Correct 1 ms 596 KB Output is correct
94 Correct 1 ms 600 KB Output is correct
95 Correct 2 ms 596 KB Output is correct
96 Correct 6 ms 648 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 3 ms 596 KB Output is correct
99 Correct 4 ms 596 KB Output is correct
100 Correct 2 ms 596 KB Output is correct
101 Correct 8 ms 1748 KB Output is correct
102 Correct 7 ms 1852 KB Output is correct
103 Correct 8 ms 1852 KB Output is correct
104 Correct 5 ms 1748 KB Output is correct
105 Correct 4 ms 1748 KB Output is correct
106 Correct 7 ms 1748 KB Output is correct
107 Correct 28 ms 1860 KB Output is correct
108 Correct 15 ms 1752 KB Output is correct
109 Correct 15 ms 1752 KB Output is correct
110 Correct 8 ms 1752 KB Output is correct
111 Correct 1 ms 216 KB Output is correct
112 Correct 2 ms 600 KB Output is correct
113 Correct 2 ms 656 KB Output is correct
114 Correct 2 ms 604 KB Output is correct
115 Correct 2 ms 600 KB Output is correct
116 Correct 1 ms 600 KB Output is correct
117 Correct 1 ms 596 KB Output is correct
118 Correct 1 ms 596 KB Output is correct
119 Correct 1 ms 596 KB Output is correct
120 Correct 2 ms 596 KB Output is correct
121 Correct 5 ms 1756 KB Output is correct
122 Correct 5 ms 1756 KB Output is correct
123 Correct 8 ms 1844 KB Output is correct
124 Correct 8 ms 1852 KB Output is correct
125 Correct 9 ms 1748 KB Output is correct
126 Correct 6 ms 1748 KB Output is correct
127 Correct 3 ms 1748 KB Output is correct
128 Correct 6 ms 1748 KB Output is correct
129 Correct 35 ms 12284 KB Output is correct
130 Correct 34 ms 12248 KB Output is correct
131 Correct 63 ms 12276 KB Output is correct
132 Correct 60 ms 12424 KB Output is correct
133 Correct 57 ms 12236 KB Output is correct
134 Correct 51 ms 12244 KB Output is correct
135 Correct 28 ms 12280 KB Output is correct
136 Correct 47 ms 12244 KB Output is correct
137 Correct 1 ms 212 KB Output is correct
138 Correct 0 ms 212 KB Output is correct
139 Correct 0 ms 212 KB Output is correct
140 Correct 0 ms 212 KB Output is correct
141 Correct 5 ms 1748 KB Output is correct
142 Correct 20 ms 1756 KB Output is correct
143 Correct 3 ms 1748 KB Output is correct
144 Correct 12 ms 1848 KB Output is correct
145 Correct 16 ms 1748 KB Output is correct
146 Correct 5 ms 1756 KB Output is correct
147 Correct 5 ms 1756 KB Output is correct
148 Correct 42 ms 12288 KB Output is correct
149 Correct 157 ms 12236 KB Output is correct
150 Correct 21 ms 12244 KB Output is correct
151 Correct 92 ms 12236 KB Output is correct
152 Correct 115 ms 12280 KB Output is correct
153 Correct 36 ms 12316 KB Output is correct
154 Correct 34 ms 12316 KB Output is correct
155 Correct 2 ms 596 KB Output is correct
156 Correct 2 ms 648 KB Output is correct
157 Correct 2 ms 596 KB Output is correct
158 Correct 2 ms 596 KB Output is correct
159 Correct 1 ms 596 KB Output is correct
160 Correct 1 ms 596 KB Output is correct
161 Correct 1 ms 596 KB Output is correct
162 Correct 1 ms 596 KB Output is correct
163 Correct 1 ms 596 KB Output is correct
164 Correct 9 ms 1856 KB Output is correct
165 Correct 7 ms 1748 KB Output is correct
166 Correct 8 ms 1748 KB Output is correct
167 Correct 7 ms 1748 KB Output is correct
168 Correct 5 ms 1748 KB Output is correct
169 Correct 7 ms 1748 KB Output is correct
170 Correct 6 ms 648 KB Output is correct
171 Correct 1 ms 596 KB Output is correct
172 Correct 3 ms 596 KB Output is correct
173 Correct 4 ms 596 KB Output is correct
174 Correct 3 ms 596 KB Output is correct
175 Correct 24 ms 1848 KB Output is correct
176 Correct 12 ms 1748 KB Output is correct
177 Correct 12 ms 1748 KB Output is correct
178 Correct 8 ms 1748 KB Output is correct
179 Correct 62 ms 12272 KB Output is correct
180 Correct 54 ms 12280 KB Output is correct
181 Correct 53 ms 12364 KB Output is correct
182 Correct 51 ms 12268 KB Output is correct
183 Correct 31 ms 12244 KB Output is correct
184 Correct 48 ms 12244 KB Output is correct
185 Correct 195 ms 12324 KB Output is correct
186 Correct 106 ms 12268 KB Output is correct
187 Correct 72 ms 12244 KB Output is correct
188 Correct 74 ms 12260 KB Output is correct

Subtask #6-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 648 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 4 ms 1760 KB Output is correct
22 Correct 5 ms 1760 KB Output is correct
23 Correct 8 ms 1756 KB Output is correct
24 Correct 8 ms 1852 KB Output is correct
25 Correct 7 ms 1756 KB Output is correct
26 Correct 6 ms 1756 KB Output is correct
27 Correct 4 ms 1760 KB Output is correct
28 Correct 6 ms 1756 KB Output is correct
29 Correct 1 ms 216 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 2 ms 656 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 5 ms 1756 KB Output is correct
40 Correct 5 ms 1756 KB Output is correct
41 Correct 8 ms 1844 KB Output is correct
42 Correct 8 ms 1852 KB Output is correct
43 Correct 9 ms 1748 KB Output is correct
44 Correct 6 ms 1748 KB Output is correct
45 Correct 3 ms 1748 KB Output is correct
46 Correct 6 ms 1748 KB Output is correct
47 Correct 35 ms 12284 KB Output is correct
48 Correct 34 ms 12248 KB Output is correct
49 Correct 63 ms 12276 KB Output is correct
50 Correct 60 ms 12424 KB Output is correct
51 Correct 57 ms 12236 KB Output is correct
52 Correct 51 ms 12244 KB Output is correct
53 Correct 28 ms 12280 KB Output is correct
54 Correct 47 ms 12244 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 2 ms 648 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 1 ms 596 KB Output is correct
62 Correct 1 ms 596 KB Output is correct
63 Correct 2 ms 640 KB Output is correct
64 Correct 2 ms 596 KB Output is correct
65 Correct 4 ms 1756 KB Output is correct
66 Correct 4 ms 1756 KB Output is correct
67 Correct 9 ms 1748 KB Output is correct
68 Correct 8 ms 1756 KB Output is correct
69 Correct 9 ms 1852 KB Output is correct
70 Correct 6 ms 1748 KB Output is correct
71 Correct 4 ms 1748 KB Output is correct
72 Correct 6 ms 1748 KB Output is correct
73 Correct 33 ms 12372 KB Output is correct
74 Correct 33 ms 12320 KB Output is correct
75 Correct 62 ms 12284 KB Output is correct
76 Correct 52 ms 12304 KB Output is correct
77 Correct 60 ms 12280 KB Output is correct
78 Correct 53 ms 12276 KB Output is correct
79 Correct 39 ms 12276 KB Output is correct
80 Correct 55 ms 12400 KB Output is correct
81 Correct 1875 ms 319408 KB Output is correct
82 Correct 1484 ms 319392 KB Output is correct
83 Correct 1826 ms 319500 KB Output is correct
84 Correct 1352 ms 319392 KB Output is correct
85 Correct 280 ms 319332 KB Output is correct
86 Correct 263 ms 319500 KB Output is correct
87 Correct 2686 ms 319472 KB Output is correct

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 5 ms 1748 KB Output is correct
6 Correct 21 ms 1756 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 15 ms 1748 KB Output is correct
9 Correct 18 ms 1748 KB Output is correct
10 Correct 5 ms 1756 KB Output is correct
11 Correct 6 ms 1756 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1728 KB Output is correct
17 Correct 21 ms 1756 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 12 ms 1852 KB Output is correct
20 Correct 17 ms 1748 KB Output is correct
21 Correct 5 ms 1756 KB Output is correct
22 Correct 5 ms 1756 KB Output is correct
23 Correct 44 ms 12272 KB Output is correct
24 Correct 167 ms 12272 KB Output is correct
25 Correct 21 ms 12244 KB Output is correct
26 Correct 99 ms 12284 KB Output is correct
27 Correct 120 ms 12276 KB Output is correct
28 Correct 36 ms 12308 KB Output is correct
29 Correct 39 ms 12248 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 2 ms 648 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 6 ms 648 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 2 ms 648 KB Output is correct
61 Correct 2 ms 596 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 596 KB Output is correct
65 Correct 1 ms 596 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 2 ms 600 KB Output is correct
68 Correct 4 ms 1760 KB Output is correct
69 Correct 5 ms 1760 KB Output is correct
70 Correct 8 ms 1756 KB Output is correct
71 Correct 8 ms 1852 KB Output is correct
72 Correct 7 ms 1756 KB Output is correct
73 Correct 6 ms 1756 KB Output is correct
74 Correct 4 ms 1760 KB Output is correct
75 Correct 6 ms 1756 KB Output is correct
76 Correct 1 ms 220 KB Output is correct
77 Correct 1 ms 220 KB Output is correct
78 Correct 1 ms 220 KB Output is correct
79 Correct 1 ms 220 KB Output is correct
80 Correct 5 ms 1756 KB Output is correct
81 Correct 21 ms 1852 KB Output is correct
82 Correct 3 ms 1748 KB Output is correct
83 Correct 11 ms 1748 KB Output is correct
84 Correct 14 ms 1844 KB Output is correct
85 Correct 4 ms 1756 KB Output is correct
86 Correct 5 ms 1852 KB Output is correct
87 Correct 2 ms 596 KB Output is correct
88 Correct 2 ms 648 KB Output is correct
89 Correct 1 ms 596 KB Output is correct
90 Correct 2 ms 596 KB Output is correct
91 Correct 1 ms 596 KB Output is correct
92 Correct 1 ms 596 KB Output is correct
93 Correct 1 ms 596 KB Output is correct
94 Correct 1 ms 600 KB Output is correct
95 Correct 2 ms 596 KB Output is correct
96 Correct 6 ms 648 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 3 ms 596 KB Output is correct
99 Correct 4 ms 596 KB Output is correct
100 Correct 2 ms 596 KB Output is correct
101 Correct 8 ms 1748 KB Output is correct
102 Correct 7 ms 1852 KB Output is correct
103 Correct 8 ms 1852 KB Output is correct
104 Correct 5 ms 1748 KB Output is correct
105 Correct 4 ms 1748 KB Output is correct
106 Correct 7 ms 1748 KB Output is correct
107 Correct 28 ms 1860 KB Output is correct
108 Correct 15 ms 1752 KB Output is correct
109 Correct 15 ms 1752 KB Output is correct
110 Correct 8 ms 1752 KB Output is correct
111 Correct 1 ms 216 KB Output is correct
112 Correct 2 ms 600 KB Output is correct
113 Correct 2 ms 656 KB Output is correct
114 Correct 2 ms 604 KB Output is correct
115 Correct 2 ms 600 KB Output is correct
116 Correct 1 ms 600 KB Output is correct
117 Correct 1 ms 596 KB Output is correct
118 Correct 1 ms 596 KB Output is correct
119 Correct 1 ms 596 KB Output is correct
120 Correct 2 ms 596 KB Output is correct
121 Correct 5 ms 1756 KB Output is correct
122 Correct 5 ms 1756 KB Output is correct
123 Correct 8 ms 1844 KB Output is correct
124 Correct 8 ms 1852 KB Output is correct
125 Correct 9 ms 1748 KB Output is correct
126 Correct 6 ms 1748 KB Output is correct
127 Correct 3 ms 1748 KB Output is correct
128 Correct 6 ms 1748 KB Output is correct
129 Correct 35 ms 12284 KB Output is correct
130 Correct 34 ms 12248 KB Output is correct
131 Correct 63 ms 12276 KB Output is correct
132 Correct 60 ms 12424 KB Output is correct
133 Correct 57 ms 12236 KB Output is correct
134 Correct 51 ms 12244 KB Output is correct
135 Correct 28 ms 12280 KB Output is correct
136 Correct 47 ms 12244 KB Output is correct
137 Correct 1 ms 212 KB Output is correct
138 Correct 0 ms 212 KB Output is correct
139 Correct 0 ms 212 KB Output is correct
140 Correct 0 ms 212 KB Output is correct
141 Correct 5 ms 1748 KB Output is correct
142 Correct 20 ms 1756 KB Output is correct
143 Correct 3 ms 1748 KB Output is correct
144 Correct 12 ms 1848 KB Output is correct
145 Correct 16 ms 1748 KB Output is correct
146 Correct 5 ms 1756 KB Output is correct
147 Correct 5 ms 1756 KB Output is correct
148 Correct 42 ms 12288 KB Output is correct
149 Correct 157 ms 12236 KB Output is correct
150 Correct 21 ms 12244 KB Output is correct
151 Correct 92 ms 12236 KB Output is correct
152 Correct 115 ms 12280 KB Output is correct
153 Correct 36 ms 12316 KB Output is correct
154 Correct 34 ms 12316 KB Output is correct
155 Correct 2 ms 596 KB Output is correct
156 Correct 2 ms 648 KB Output is correct
157 Correct 2 ms 596 KB Output is correct
158 Correct 2 ms 596 KB Output is correct
159 Correct 1 ms 596 KB Output is correct
160 Correct 1 ms 596 KB Output is correct
161 Correct 1 ms 596 KB Output is correct
162 Correct 1 ms 596 KB Output is correct
163 Correct 1 ms 596 KB Output is correct
164 Correct 9 ms 1856 KB Output is correct
165 Correct 7 ms 1748 KB Output is correct
166 Correct 8 ms 1748 KB Output is correct
167 Correct 7 ms 1748 KB Output is correct
168 Correct 5 ms 1748 KB Output is correct
169 Correct 7 ms 1748 KB Output is correct
170 Correct 6 ms 648 KB Output is correct
171 Correct 1 ms 596 KB Output is correct
172 Correct 3 ms 596 KB Output is correct
173 Correct 4 ms 596 KB Output is correct
174 Correct 3 ms 596 KB Output is correct
175 Correct 24 ms 1848 KB Output is correct
176 Correct 12 ms 1748 KB Output is correct
177 Correct 12 ms 1748 KB Output is correct
178 Correct 8 ms 1748 KB Output is correct
179 Correct 62 ms 12272 KB Output is correct
180 Correct 54 ms 12280 KB Output is correct
181 Correct 53 ms 12364 KB Output is correct
182 Correct 51 ms 12268 KB Output is correct
183 Correct 31 ms 12244 KB Output is correct
184 Correct 48 ms 12244 KB Output is correct
185 Correct 195 ms 12324 KB Output is correct
186 Correct 106 ms 12268 KB Output is correct
187 Correct 72 ms 12244 KB Output is correct
188 Correct 74 ms 12260 KB Output is correct
189 Correct 1 ms 340 KB Output is correct
190 Correct 2 ms 596 KB Output is correct
191 Correct 2 ms 648 KB Output is correct
192 Correct 1 ms 596 KB Output is correct
193 Correct 2 ms 596 KB Output is correct
194 Correct 1 ms 596 KB Output is correct
195 Correct 1 ms 596 KB Output is correct
196 Correct 1 ms 596 KB Output is correct
197 Correct 2 ms 640 KB Output is correct
198 Correct 2 ms 596 KB Output is correct
199 Correct 4 ms 1756 KB Output is correct
200 Correct 4 ms 1756 KB Output is correct
201 Correct 9 ms 1748 KB Output is correct
202 Correct 8 ms 1756 KB Output is correct
203 Correct 9 ms 1852 KB Output is correct
204 Correct 6 ms 1748 KB Output is correct
205 Correct 4 ms 1748 KB Output is correct
206 Correct 6 ms 1748 KB Output is correct
207 Correct 33 ms 12372 KB Output is correct
208 Correct 33 ms 12320 KB Output is correct
209 Correct 62 ms 12284 KB Output is correct
210 Correct 52 ms 12304 KB Output is correct
211 Correct 60 ms 12280 KB Output is correct
212 Correct 53 ms 12276 KB Output is correct
213 Correct 39 ms 12276 KB Output is correct
214 Correct 55 ms 12400 KB Output is correct
215 Correct 1875 ms 319408 KB Output is correct
216 Correct 1484 ms 319392 KB Output is correct
217 Correct 1826 ms 319500 KB Output is correct
218 Correct 1352 ms 319392 KB Output is correct
219 Correct 280 ms 319332 KB Output is correct
220 Correct 263 ms 319500 KB Output is correct
221 Correct 2686 ms 319472 KB Output is correct
222 Correct 1 ms 212 KB Output is correct
223 Correct 2 ms 596 KB Output is correct
224 Correct 2 ms 648 KB Output is correct
225 Correct 2 ms 596 KB Output is correct
226 Correct 2 ms 596 KB Output is correct
227 Correct 1 ms 596 KB Output is correct
228 Correct 1 ms 596 KB Output is correct
229 Correct 1 ms 596 KB Output is correct
230 Correct 2 ms 596 KB Output is correct
231 Correct 2 ms 596 KB Output is correct
232 Correct 4 ms 1756 KB Output is correct
233 Correct 6 ms 1756 KB Output is correct
234 Correct 8 ms 1748 KB Output is correct
235 Correct 8 ms 1748 KB Output is correct
236 Correct 9 ms 1748 KB Output is correct
237 Correct 6 ms 1748 KB Output is correct
238 Correct 4 ms 1748 KB Output is correct
239 Correct 8 ms 1760 KB Output is correct
240 Correct 34 ms 12336 KB Output is correct
241 Correct 34 ms 12292 KB Output is correct
242 Correct 63 ms 12220 KB Output is correct
243 Correct 60 ms 12244 KB Output is correct
244 Correct 57 ms 12268 KB Output is correct
245 Correct 49 ms 12280 KB Output is correct
246 Correct 28 ms 12284 KB Output is correct
247 Correct 57 ms 12280 KB Output is correct
248 Correct 0 ms 212 KB Output is correct
249 Correct 1 ms 212 KB Output is correct
250 Correct 1 ms 212 KB Output is correct
251 Correct 5 ms 1748 KB Output is correct
252 Correct 25 ms 1736 KB Output is correct
253 Correct 3 ms 1748 KB Output is correct
254 Correct 13 ms 1748 KB Output is correct
255 Correct 14 ms 1748 KB Output is correct
256 Correct 37 ms 12244 KB Output is correct
257 Correct 162 ms 12312 KB Output is correct
258 Correct 21 ms 12272 KB Output is correct
259 Correct 101 ms 12236 KB Output is correct
260 Correct 119 ms 12364 KB Output is correct
261 Correct 6 ms 648 KB Output is correct
262 Correct 1 ms 596 KB Output is correct
263 Correct 3 ms 544 KB Output is correct
264 Correct 4 ms 596 KB Output is correct
265 Correct 2 ms 544 KB Output is correct
266 Correct 25 ms 1756 KB Output is correct
267 Correct 14 ms 1748 KB Output is correct
268 Correct 12 ms 1748 KB Output is correct
269 Correct 9 ms 1748 KB Output is correct
270 Correct 207 ms 12268 KB Output is correct
271 Correct 108 ms 12236 KB Output is correct
272 Correct 74 ms 12284 KB Output is correct
273 Correct 59 ms 12272 KB Output is correct
274 Correct 1893 ms 319468 KB Output is correct
275 Correct 1455 ms 319452 KB Output is correct
276 Correct 1773 ms 319488 KB Output is correct
277 Correct 1383 ms 319388 KB Output is correct
278 Correct 269 ms 319428 KB Output is correct
279 Correct 293 ms 319500 KB Output is correct
280 Correct 2695 ms 319480 KB Output is correct
281 Execution timed out 5069 ms 319448 KB Time limit exceeded
282 Halted 0 ms 0 KB -