oj.uz

답안 #795827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795827 2023-07-27T16:45:11 Z marvinthang Line Town (CCO23_day1problem3) C++17
25 / 25
 368 ms 25976 KB 
/*************************************
*    author: marvinthang             *
*    created: 27.07.2023 20:51:29    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// index from 0
template <class T = int>
    struct Fenwick {

        T *bit = nullptr;
        int n;

        Fenwick(int _n = 0) {
            resize(_n);
        }

        void reset(void) {
            fill(bit, bit + 1 + n, T(0));
        }

        void resize(int _n) {
            if (bit != nullptr) delete[] bit;
            n = _n;
            bit = new T[n + 1];
            reset();
        }

        void update(int i, T val) {
            assert(0 <= i);
            ++i;
            for (; i <= n; i += i & -i) bit[i] += val;
        }

        T get(int i) {
            if (i < 0) return T(0);
            ++i;
            i = min(i, n);
            T res(0);
            for (; i > 0; i -= i & -i)
                res += bit[i];
            return res;
        }

        int upper_bound(T val) {
            int res = 0;
            for (int i = __lg(n); i >= 0; --i) {
                if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) {
                    res |= MASK(i);
                    val -= bit[res];
                }
            }
            return res;
        }

        int lower_bound(T val) {
            int res = 0;
            for (int i = __lg(n); i >= 0; --i) {
                if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) {
                    res |= MASK(i);
                    val -= bit[res];
                }
            }
            return res;
        }

    };

// end of template

const int MAX = 5e5 + 5;
const long long INF = 1e18;

int N, H[MAX], P[MAX];

void init(void) {
	cin >> N;
	REP(i, N) cin >> H[i];
}

void process(void) {
	for (int i = 0; i < N; i += 2) H[i] = -H[i];
	vector <int> order(N);
	iota(ALL(order), 0);
	sort(ALL(order), [&] (int a, int b) { return make_pair(abs(H[a]), -a) > make_pair(abs(H[b]), -b); });

	Fenwick <int> bit_pref(N), bit_suff(N), cnt_zero(N);
	REP(i, N) cnt_zero.update(i, 1);
	long long dp[2] = {0, INF};

	REP(l, N) {
		if (!H[order[l]]) break;
		int r = l;
		while (r + 1 < N && abs(H[order[r + 1]]) == abs(H[order[l]])) ++r;
		vector <tuple <int, long long, long long>> pos[2];
		FORE(i, l, r) {
			cnt_zero.update(order[i], -1);
			int pref_zero = cnt_zero.get(order[i]);
			int suff_zero = N - r - 1 - pref_zero;
			if (H[order[i]] < 0) pos[0].emplace_back(order[i], pref_zero, suff_zero);
			else pos[1].emplace_back(order[i], pref_zero, suff_zero);
		}

		REP(i, 2) {
			REP(j, (int) pos[i].size() - 1) get<1>(pos[i][j + 1]) += get<1>(pos[i][j]);
			REPD(j, (int) pos[i].size() - 1) get<2>(pos[i][j]) += get<2>(pos[i][j + 1]);
		
		}
		int sz = pos[0].size() + pos[1].size();
		long long nxt[2] = {INF, INF};
		REP(p, 2) {
			int pl = !p;
			int pr = !((N - l + p) & 1);
			vector <int> pref(sz, 0), suff(sz, 0);
			REP(i, sz) {
				int v = pl ^ (i & 1);
				if (i / 2 < pos[v].size()) pref[i] = get<0>(pos[v][i / 2]);
				v = pr ^ (i & 1);
				if (i / 2 < pos[v].size()) suff[sz - i - 1] = get<0>(pos[v][(int) pos[v].size() - i / 2 - 1]);
			}

			long long inv = 0;
			REPD(i, sz) {
				inv += bit_suff.get(suff[i] - 1);
				bit_suff.update(suff[i], 1);
			}

			REP(i, sz + 1) {
				int pos_pref[2], pos_suff[2];
				pos_pref[pl] = (i + 1) / 2;
				pos_pref[!pl] = i / 2;
				pos_suff[pr] = (int) pos[pr].size() - (sz - i + 1) / 2;
				pos_suff[!pr] = (int) pos[!pr].size() - (sz - i) / 2;

				if (pos_pref[0] == pos_suff[0] && pos_pref[1] == pos_suff[1]) {
					long long cur = inv;
					REP(i, 2) {
						if (pos_pref[i]) cur += get<1>(pos[i][pos_pref[i] - 1]);
						if (pos_suff[i] < pos[i].size()) cur += get<2>(pos[i][pos_suff[i]]);
					}
					minimize(nxt[p ^ (i & 1)], dp[p] + cur);
				}

				if (i < sz) {
					inv -= bit_suff.get(suff[i] - 1);
					inv -= bit_pref.get(N - suff[i] - 2);
					bit_suff.update(suff[i], -1);

					inv += bit_suff.get(pref[i] - 1);
					inv += bit_pref.get(N - pref[i] - 2);
					bit_pref.update(N - pref[i] - 1, +1);
				}
			}
			for (int i: pref) bit_pref.update(N - i - 1, -1);
		}
		dp[0] = nxt[0], dp[1] = nxt[1];
		l = r;
	}
	long long res = min(dp[0], dp[1]);
	cout << (res == INF ? -1 : res) << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("cco23p3");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

Main.cpp: In function 'void process()':
Main.cpp:155:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     if (i / 2 < pos[v].size()) pref[i] = get<0>(pos[v][i / 2]);
      |         ~~~~~~^~~~~~~~~~~~~~~
Main.cpp:157:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |     if (i / 2 < pos[v].size()) suff[sz - i - 1] = get<0>(pos[v][(int) pos[v].size() - i / 2 - 1]);
      |         ~~~~~~^~~~~~~~~~~~~~~
Main.cpp:177:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  177 |       if (pos_suff[i] < pos[i].size()) cur += get<2>(pos[i][pos_suff[i]]);
      |           ~~~~~~~~~~~~^~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:203:2: note: in expansion of macro 'file'
  203 |  file("cco23p3");
      |  ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:203:2: note: in expansion of macro 'file'
  203 |  file("cco23p3");
      |  ^~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 202 ms 25704 KB Output is correct
16 Correct 199 ms 25848 KB Output is correct
17 Correct 202 ms 25796 KB Output is correct
18 Correct 225 ms 25844 KB Output is correct
19 Correct 198 ms 25748 KB Output is correct
20 Correct 203 ms 25976 KB Output is correct
21 Correct 202 ms 25772 KB Output is correct
22 Correct 209 ms 25792 KB Output is correct
23 Correct 209 ms 25920 KB Output is correct
24 Correct 214 ms 25784 KB Output is correct

Subtask #3
3.0 / 3.0

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

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 202 ms 25704 KB Output is correct
16 Correct 199 ms 25848 KB Output is correct
17 Correct 202 ms 25796 KB Output is correct
18 Correct 225 ms 25844 KB Output is correct
19 Correct 198 ms 25748 KB Output is correct
20 Correct 203 ms 25976 KB Output is correct
21 Correct 202 ms 25772 KB Output is correct
22 Correct 209 ms 25792 KB Output is correct
23 Correct 209 ms 25920 KB Output is correct
24 Correct 214 ms 25784 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 156 ms 18060 KB Output is correct
45 Correct 145 ms 17960 KB Output is correct
46 Correct 148 ms 18124 KB Output is correct
47 Correct 170 ms 17984 KB Output is correct
48 Correct 163 ms 20476 KB Output is correct
49 Correct 203 ms 25792 KB Output is correct
50 Correct 129 ms 17996 KB Output is correct
51 Correct 141 ms 17976 KB Output is correct
52 Correct 135 ms 18044 KB Output is correct
53 Correct 136 ms 18036 KB Output is correct
54 Correct 163 ms 23240 KB Output is correct
55 Correct 169 ms 23276 KB Output is correct
56 Correct 144 ms 23228 KB Output is correct
57 Correct 42 ms 10188 KB Output is correct
58 Correct 43 ms 10068 KB Output is correct
59 Correct 42 ms 10016 KB Output is correct

Subtask #5
4.0 / 4.0

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

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 228 ms 10316 KB Output is correct
15 Correct 341 ms 10324 KB Output is correct
16 Correct 366 ms 10136 KB Output is correct
17 Correct 362 ms 10248 KB Output is correct
18 Correct 335 ms 10304 KB Output is correct
19 Correct 314 ms 10264 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 292 ms 10348 KB Output is correct
23 Correct 275 ms 10404 KB Output is correct
24 Correct 230 ms 10124 KB Output is correct

Subtask #7
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 344 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 352 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct

Subtask #8
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 202 ms 25704 KB Output is correct
16 Correct 199 ms 25848 KB Output is correct
17 Correct 202 ms 25796 KB Output is correct
18 Correct 225 ms 25844 KB Output is correct
19 Correct 198 ms 25748 KB Output is correct
20 Correct 203 ms 25976 KB Output is correct
21 Correct 202 ms 25772 KB Output is correct
22 Correct 209 ms 25792 KB Output is correct
23 Correct 209 ms 25920 KB Output is correct
24 Correct 214 ms 25784 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 156 ms 18060 KB Output is correct
45 Correct 145 ms 17960 KB Output is correct
46 Correct 148 ms 18124 KB Output is correct
47 Correct 170 ms 17984 KB Output is correct
48 Correct 163 ms 20476 KB Output is correct
49 Correct 203 ms 25792 KB Output is correct
50 Correct 129 ms 17996 KB Output is correct
51 Correct 141 ms 17976 KB Output is correct
52 Correct 135 ms 18044 KB Output is correct
53 Correct 136 ms 18036 KB Output is correct
54 Correct 163 ms 23240 KB Output is correct
55 Correct 169 ms 23276 KB Output is correct
56 Correct 144 ms 23228 KB Output is correct
57 Correct 42 ms 10188 KB Output is correct
58 Correct 43 ms 10068 KB Output is correct
59 Correct 42 ms 10016 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 2 ms 340 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 0 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 228 ms 10316 KB Output is correct
74 Correct 341 ms 10324 KB Output is correct
75 Correct 366 ms 10136 KB Output is correct
76 Correct 362 ms 10248 KB Output is correct
77 Correct 335 ms 10304 KB Output is correct
78 Correct 314 ms 10264 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 1 ms 212 KB Output is correct
81 Correct 292 ms 10348 KB Output is correct
82 Correct 275 ms 10404 KB Output is correct
83 Correct 230 ms 10124 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 352 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 ms 340 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 198 ms 18228 KB Output is correct
97 Correct 175 ms 17692 KB Output is correct
98 Correct 190 ms 17756 KB Output is correct
99 Correct 289 ms 10164 KB Output is correct
100 Correct 179 ms 23564 KB Output is correct
101 Correct 368 ms 10472 KB Output is correct
102 Correct 322 ms 10444 KB Output is correct
103 Correct 351 ms 10128 KB Output is correct
104 Correct 311 ms 10244 KB Output is correct
105 Correct 288 ms 10460 KB Output is correct
106 Correct 268 ms 10784 KB Output is correct