oj.uz

Submission #773111

# Submission time Handle Problem Language Result Execution time Memory
773111 2023-07-04T15:22:50 Z marvinthang Council (JOI23_council) C++17
100 / 100
 964 ms 198772 KB 
/*************************************
*    author: marvinthang             *
*    created: 04.07.2023 20:59:38    *
*************************************/

#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--; )
#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; }

// end of template

const int MAX_N = 3e5 + 5;
const int MAX_M = 20;

int N, M, A[MAX_N], cnt[MAX_M];

void init(void) {
	cin >> N >> M;
	REP(i, N) {
		REP(j, M) {
			int v; cin >> v;
			if (v) {
				A[i] ^= MASK(j);
				++cnt[j];
			}
		}
	}
}

pair <int, int> max_bit[MASK(MAX_M)];
long long cnt_mask[MASK(MAX_M)][MAX_M + 1];
int num_bit[MASK(MAX_M)];

void process(void) {
	int mask_zero = 0, mask_one = 0, cnt_two = 0;
	REP(i, M) {
		if (cnt[i] >= N / 2 + 2) ++cnt_two;
		else if (cnt[i] == N / 2 + 1) mask_one ^= MASK(i);
		else if (cnt[i] == N / 2) mask_zero ^= MASK(i);
	}

	REP(i, MASK(M)) num_bit[i] = __builtin_popcount(i);

	REP(i, N) {
		int v = (MASK(M) - 1) ^ A[i];
		++cnt_mask[v][num_bit[v]];
	}

	REP(i, M) REP(mask, MASK(M)) if (BIT(mask, i)) 
		cnt_mask[mask ^ MASK(i)][num_bit[mask] - 1] += cnt_mask[mask][num_bit[mask]];

	REP(i, M) REP(mask, MASK(M)) if (BIT(mask, i)) 
		REP(j, M + 1) cnt_mask[mask][j] += cnt_mask[mask ^ MASK(i)][j] - (j < M ? cnt_mask[mask][j + 1] : 0);

	REP(mask, MASK(M)) {
		REP(i, M + 1) if (cnt_mask[mask][i]) {
			if (cnt_mask[mask][i] == 1) {
				max_bit[mask].se = max_bit[mask].fi;
				max_bit[mask].fi = i;
			} else max_bit[mask].fi = max_bit[mask].se = i;
		}
	}

	REP(i, N) {
		int rem_zero = (mask_zero & ((MASK(M) - 1) ^ A[i])) ^ (mask_one & A[i]);
		int res = cnt_two + num_bit[mask_one & ((MASK(M) - 1) ^ A[i])];
		res += max_bit[rem_zero].fi == num_bit[rem_zero & ((MASK(M) - 1) ^ A[i])] ? max_bit[rem_zero].se : max_bit[rem_zero].fi;
		cout << res << '\n';
	}
}

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

Compilation message

council.cpp: In function 'int main()':
council.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:109:2: note: in expansion of macro 'file'
  109 |  file("council");
      |  ^~~~
council.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:109:2: note: in expansion of macro 'file'
  109 |  file("council");
      |  ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 657 ms 184988 KB Output is correct
6 Correct 659 ms 184980 KB Output is correct
7 Correct 685 ms 184908 KB Output is correct
8 Correct 686 ms 184976 KB Output is correct
9 Correct 681 ms 185036 KB Output is correct
10 Correct 671 ms 185008 KB Output is correct
11 Correct 678 ms 184976 KB Output is correct
12 Correct 692 ms 184984 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 4 ms 3156 KB Output is correct
42 Correct 4 ms 3156 KB Output is correct
43 Correct 4 ms 3156 KB Output is correct
44 Correct 5 ms 3156 KB Output is correct
45 Correct 4 ms 3156 KB Output is correct
46 Correct 64 ms 23404 KB Output is correct
47 Correct 66 ms 23416 KB Output is correct
48 Correct 66 ms 23420 KB Output is correct
49 Correct 68 ms 23408 KB Output is correct
50 Correct 67 ms 23416 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 657 ms 184988 KB Output is correct
6 Correct 659 ms 184980 KB Output is correct
7 Correct 685 ms 184908 KB Output is correct
8 Correct 686 ms 184976 KB Output is correct
9 Correct 681 ms 185036 KB Output is correct
10 Correct 671 ms 185008 KB Output is correct
11 Correct 678 ms 184976 KB Output is correct
12 Correct 692 ms 184984 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 4 ms 3156 KB Output is correct
42 Correct 4 ms 3156 KB Output is correct
43 Correct 4 ms 3156 KB Output is correct
44 Correct 5 ms 3156 KB Output is correct
45 Correct 4 ms 3156 KB Output is correct
46 Correct 64 ms 23404 KB Output is correct
47 Correct 66 ms 23416 KB Output is correct
48 Correct 66 ms 23420 KB Output is correct
49 Correct 68 ms 23408 KB Output is correct
50 Correct 67 ms 23416 KB Output is correct
51 Correct 687 ms 184992 KB Output is correct
52 Correct 695 ms 184976 KB Output is correct
53 Correct 663 ms 184992 KB Output is correct
54 Correct 767 ms 184928 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 65 ms 23352 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 42 ms 2036 KB Output is correct
3 Correct 35 ms 840 KB Output is correct
4 Correct 27 ms 2112 KB Output is correct
5 Correct 46 ms 2004 KB Output is correct
6 Correct 33 ms 2008 KB Output is correct
7 Correct 46 ms 2112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 42 ms 2036 KB Output is correct
3 Correct 35 ms 840 KB Output is correct
4 Correct 27 ms 2112 KB Output is correct
5 Correct 46 ms 2004 KB Output is correct
6 Correct 33 ms 2008 KB Output is correct
7 Correct 46 ms 2112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 153 ms 2236 KB Output is correct
21 Correct 134 ms 7244 KB Output is correct
22 Correct 132 ms 7376 KB Output is correct
23 Correct 137 ms 8360 KB Output is correct
24 Correct 125 ms 6800 KB Output is correct
25 Correct 143 ms 8008 KB Output is correct
26 Correct 144 ms 7996 KB Output is correct
27 Correct 1 ms 468 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 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 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 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 464 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 42 ms 2036 KB Output is correct
3 Correct 35 ms 840 KB Output is correct
4 Correct 27 ms 2112 KB Output is correct
5 Correct 46 ms 2004 KB Output is correct
6 Correct 33 ms 2008 KB Output is correct
7 Correct 46 ms 2112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 153 ms 2236 KB Output is correct
21 Correct 134 ms 7244 KB Output is correct
22 Correct 132 ms 7376 KB Output is correct
23 Correct 137 ms 8360 KB Output is correct
24 Correct 125 ms 6800 KB Output is correct
25 Correct 143 ms 8008 KB Output is correct
26 Correct 144 ms 7996 KB Output is correct
27 Correct 1 ms 468 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 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 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 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 1 ms 980 KB Output is correct
47 Correct 194 ms 12996 KB Output is correct
48 Correct 182 ms 11016 KB Output is correct
49 Correct 182 ms 11056 KB Output is correct
50 Correct 184 ms 13304 KB Output is correct
51 Correct 168 ms 11864 KB Output is correct
52 Correct 201 ms 13004 KB Output is correct
53 Correct 201 ms 13352 KB Output is correct
54 Correct 4 ms 3156 KB Output is correct
55 Correct 6 ms 3232 KB Output is correct
56 Correct 5 ms 3152 KB Output is correct
57 Correct 5 ms 3156 KB Output is correct
58 Correct 4 ms 3156 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 42 ms 2036 KB Output is correct
3 Correct 35 ms 840 KB Output is correct
4 Correct 27 ms 2112 KB Output is correct
5 Correct 46 ms 2004 KB Output is correct
6 Correct 33 ms 2008 KB Output is correct
7 Correct 46 ms 2112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 153 ms 2236 KB Output is correct
21 Correct 134 ms 7244 KB Output is correct
22 Correct 132 ms 7376 KB Output is correct
23 Correct 137 ms 8360 KB Output is correct
24 Correct 125 ms 6800 KB Output is correct
25 Correct 143 ms 8008 KB Output is correct
26 Correct 144 ms 7996 KB Output is correct
27 Correct 1 ms 468 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 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 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 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 1 ms 980 KB Output is correct
47 Correct 194 ms 12996 KB Output is correct
48 Correct 182 ms 11016 KB Output is correct
49 Correct 182 ms 11056 KB Output is correct
50 Correct 184 ms 13304 KB Output is correct
51 Correct 168 ms 11864 KB Output is correct
52 Correct 201 ms 13004 KB Output is correct
53 Correct 201 ms 13352 KB Output is correct
54 Correct 4 ms 3156 KB Output is correct
55 Correct 6 ms 3232 KB Output is correct
56 Correct 5 ms 3152 KB Output is correct
57 Correct 5 ms 3156 KB Output is correct
58 Correct 4 ms 3156 KB Output is correct
59 Correct 232 ms 23192 KB Output is correct
60 Correct 152 ms 27924 KB Output is correct
61 Correct 154 ms 28208 KB Output is correct
62 Correct 163 ms 28360 KB Output is correct
63 Correct 236 ms 22808 KB Output is correct
64 Correct 286 ms 34964 KB Output is correct
65 Correct 292 ms 34988 KB Output is correct
66 Correct 276 ms 35276 KB Output is correct
67 Correct 252 ms 33808 KB Output is correct
68 Correct 298 ms 35104 KB Output is correct
69 Correct 292 ms 35280 KB Output is correct
70 Correct 61 ms 23380 KB Output is correct
71 Correct 62 ms 23360 KB Output is correct
72 Correct 78 ms 23424 KB Output is correct
73 Correct 64 ms 23372 KB Output is correct
74 Correct 69 ms 23412 KB Output is correct
75 Correct 65 ms 23480 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 657 ms 184988 KB Output is correct
6 Correct 659 ms 184980 KB Output is correct
7 Correct 685 ms 184908 KB Output is correct
8 Correct 686 ms 184976 KB Output is correct
9 Correct 681 ms 185036 KB Output is correct
10 Correct 671 ms 185008 KB Output is correct
11 Correct 678 ms 184976 KB Output is correct
12 Correct 692 ms 184984 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 4 ms 3156 KB Output is correct
42 Correct 4 ms 3156 KB Output is correct
43 Correct 4 ms 3156 KB Output is correct
44 Correct 5 ms 3156 KB Output is correct
45 Correct 4 ms 3156 KB Output is correct
46 Correct 64 ms 23404 KB Output is correct
47 Correct 66 ms 23416 KB Output is correct
48 Correct 66 ms 23420 KB Output is correct
49 Correct 68 ms 23408 KB Output is correct
50 Correct 67 ms 23416 KB Output is correct
51 Correct 687 ms 184992 KB Output is correct
52 Correct 695 ms 184976 KB Output is correct
53 Correct 663 ms 184992 KB Output is correct
54 Correct 767 ms 184928 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 65 ms 23352 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 42 ms 2036 KB Output is correct
59 Correct 35 ms 840 KB Output is correct
60 Correct 27 ms 2112 KB Output is correct
61 Correct 46 ms 2004 KB Output is correct
62 Correct 33 ms 2008 KB Output is correct
63 Correct 46 ms 2112 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 340 KB Output is correct
69 Correct 0 ms 340 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 0 ms 340 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 153 ms 2236 KB Output is correct
77 Correct 134 ms 7244 KB Output is correct
78 Correct 132 ms 7376 KB Output is correct
79 Correct 137 ms 8360 KB Output is correct
80 Correct 125 ms 6800 KB Output is correct
81 Correct 143 ms 8008 KB Output is correct
82 Correct 144 ms 7996 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 332 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 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 1 ms 468 KB Output is correct
101 Correct 1 ms 464 KB Output is correct
102 Correct 1 ms 980 KB Output is correct
103 Correct 194 ms 12996 KB Output is correct
104 Correct 182 ms 11016 KB Output is correct
105 Correct 182 ms 11056 KB Output is correct
106 Correct 184 ms 13304 KB Output is correct
107 Correct 168 ms 11864 KB Output is correct
108 Correct 201 ms 13004 KB Output is correct
109 Correct 201 ms 13352 KB Output is correct
110 Correct 4 ms 3156 KB Output is correct
111 Correct 6 ms 3232 KB Output is correct
112 Correct 5 ms 3152 KB Output is correct
113 Correct 5 ms 3156 KB Output is correct
114 Correct 4 ms 3156 KB Output is correct
115 Correct 232 ms 23192 KB Output is correct
116 Correct 152 ms 27924 KB Output is correct
117 Correct 154 ms 28208 KB Output is correct
118 Correct 163 ms 28360 KB Output is correct
119 Correct 236 ms 22808 KB Output is correct
120 Correct 286 ms 34964 KB Output is correct
121 Correct 292 ms 34988 KB Output is correct
122 Correct 276 ms 35276 KB Output is correct
123 Correct 252 ms 33808 KB Output is correct
124 Correct 298 ms 35104 KB Output is correct
125 Correct 292 ms 35280 KB Output is correct
126 Correct 61 ms 23380 KB Output is correct
127 Correct 62 ms 23360 KB Output is correct
128 Correct 78 ms 23424 KB Output is correct
129 Correct 64 ms 23372 KB Output is correct
130 Correct 69 ms 23412 KB Output is correct
131 Correct 65 ms 23480 KB Output is correct
132 Correct 957 ms 198752 KB Output is correct
133 Correct 914 ms 198396 KB Output is correct
134 Correct 949 ms 198772 KB Output is correct
135 Correct 919 ms 198512 KB Output is correct
136 Correct 964 ms 198540 KB Output is correct
137 Correct 568 ms 105628 KB Output is correct
138 Correct 556 ms 105964 KB Output is correct
139 Correct 890 ms 198688 KB Output is correct
140 Correct 879 ms 197060 KB Output is correct
141 Correct 925 ms 198284 KB Output is correct
142 Correct 958 ms 198696 KB Output is correct