답안 #947626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947626	2024-03-16T16:40:10 Z	marvinthang	Cookies (JOI23_cookies)	C++17	100 / 100	196 ms	207468 KB

/*************************************
*    author: marvinthang             *
*    created: 16.03.2024 22:48:39    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCK_PERS_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) 
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
template <class U, class V> scan_op(pair <U, V>) { return in >> u.fi >> u.se; };
template <class T> scan_op(vector <T>) { for (T &x: u) in >> x; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.fi << ", " << u.se << ')'; }
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 (auto it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it;
	return out << '}';
}

const int MAX = 15005;
#define Bitset bitset <MAX>

void process(void) {
	int n; cin >> n;
	vector <int> a(n); cin >> a;
	int m; cin >> m;
	vector <int> b(m); cin >> b;
	reverse(ALL(b));
	vector <int> c(a);
	sort(ALL(c));
	int sum = accumulate(ALL(a), 0);
	vector <int> max_cap(sum + 1);
	int j = 0, cur = 0;
	max_cap[0] = n;
	FORE(i, 1, sum) {
		while (j < n && c[j] < i) cur += c[j++];
		max_cap[i] = cur + (n - j) * i;
	}
	vector <vector <Bitset>> dp(m);
	Bitset all; all.set();
	REP(i, m) dp[i].resize(sum / b[i] + 1);
	dp[0][0][0] = 1;
	REP(i, m) {
		int sz = sum / b[i] + 1;
		REP(j, sz) {
			dp[i][j] &= all >> (MAX - max_cap[j] - 1);
			if (i + 1 < m) dp[i + 1][j] |= dp[i][j];
			if (j + 1 < sz) dp[i][j + 1] |= dp[i][j] << b[i];
		}
	}
	int mi = -1;
	REP(j, dp[m - 1].size()) if (dp[m - 1][j][sum]) {
		mi = j;
		break;
	}
	cout << mi << '\n';
	if (mi == -1) return;
	int k = sum;
	vector <int> boxes;
	REPD(i, m) {
		while (k >= b[i] && mi && dp[i][mi - 1][k - b[i]]) {
			boxes.push_back(b[i]);
			--mi;
			k -= b[i];
		}
	}
	priority_queue <pair <int, int>> pq;
	REP(i, n) pq.emplace(a[i], i);
	for (int sz: boxes) {
		vector <int> v;
		REP(love, sz) {
			v.push_back(pq.top().se);
			pq.pop();
		}
		cout << sz;
		for (int i: v) {
			cout << ' ' << i + 1;
			pq.emplace(--a[i], i);
		}
		cout << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	file("cookies");
	process();
	return (0 ^ 0);
}

Compilation message

cookies.cpp: In function 'int main()':
cookies.cpp:27:57: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cookies.cpp:105:2: note: in expansion of macro 'file'
  105 |  file("cookies");
      |  ^~~~
cookies.cpp:27:90: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cookies.cpp:105:2: note: in expansion of macro 'file'
  105 |  file("cookies");
      |  ^~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	1368 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	6 ms	7260 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	3 ms	3676 KB	Output is correct
13	Correct	1 ms	1372 KB	Output is correct
14	Correct	1 ms	1628 KB	Output is correct
15	Correct	1 ms	1372 KB	Output is correct
16	Correct	2 ms	1368 KB	Output is correct
17	Correct	1 ms	600 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	3 ms	3476 KB	Output is correct
23	Correct	3 ms	2908 KB	Output is correct
24	Correct	1 ms	1628 KB	Output is correct
25	Correct	1 ms	1628 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	1624 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	1372 KB	Output is correct
9	Correct	6 ms	5980 KB	Output is correct
10	Correct	20 ms	28252 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	6 ms	7260 KB	Output is correct
19	Correct	9 ms	9820 KB	Output is correct
20	Correct	3 ms	948 KB	Output is correct
21	Correct	2 ms	600 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	1368 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	6 ms	7260 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	3 ms	3676 KB	Output is correct
13	Correct	1 ms	1372 KB	Output is correct
14	Correct	1 ms	1628 KB	Output is correct
15	Correct	1 ms	1372 KB	Output is correct
16	Correct	2 ms	1368 KB	Output is correct
17	Correct	1 ms	600 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	3 ms	3476 KB	Output is correct
23	Correct	3 ms	2908 KB	Output is correct
24	Correct	1 ms	1628 KB	Output is correct
25	Correct	1 ms	1628 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	600 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	464 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	1 ms	344 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	344 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	1 ms	348 KB	Output is correct
67	Correct	1 ms	1372 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	604 KB	Output is correct
71	Correct	2 ms	1884 KB	Output is correct
72	Correct	1 ms	1400 KB	Output is correct
73	Correct	1 ms	604 KB	Output is correct
74	Correct	1 ms	604 KB	Output is correct
75	Correct	2 ms	1884 KB	Output is correct
76	Correct	2 ms	1628 KB	Output is correct
77	Correct	2 ms	1884 KB	Output is correct
78	Correct	2 ms	1628 KB	Output is correct
79	Correct	2 ms	1884 KB	Output is correct
80	Correct	2 ms	1880 KB	Output is correct
81	Correct	1 ms	600 KB	Output is correct
82	Correct	2 ms	2396 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	2 ms	2652 KB	Output is correct
85	Correct	2 ms	1884 KB	Output is correct
86	Correct	2 ms	3164 KB	Output is correct
87	Correct	2 ms	2904 KB	Output is correct
88	Correct	2 ms	3164 KB	Output is correct
89	Correct	3 ms	3420 KB	Output is correct
90	Correct	3 ms	2904 KB	Output is correct
91	Correct	2 ms	2908 KB	Output is correct
92	Correct	3 ms	4188 KB	Output is correct
93	Correct	4 ms	4444 KB	Output is correct
94	Correct	3 ms	3932 KB	Output is correct
95	Correct	2 ms	2908 KB	Output is correct
96	Correct	2 ms	2140 KB	Output is correct
97	Correct	2 ms	2136 KB	Output is correct

Subtask #5
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	1368 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	6 ms	7260 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	3 ms	3676 KB	Output is correct
13	Correct	1 ms	1372 KB	Output is correct
14	Correct	1 ms	1628 KB	Output is correct
15	Correct	1 ms	1372 KB	Output is correct
16	Correct	2 ms	1368 KB	Output is correct
17	Correct	1 ms	600 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	3 ms	3476 KB	Output is correct
23	Correct	3 ms	2908 KB	Output is correct
24	Correct	1 ms	1628 KB	Output is correct
25	Correct	1 ms	1628 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	600 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	464 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	1 ms	344 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	344 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	1 ms	348 KB	Output is correct
67	Correct	1 ms	1372 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	604 KB	Output is correct
71	Correct	2 ms	1884 KB	Output is correct
72	Correct	1 ms	1400 KB	Output is correct
73	Correct	1 ms	604 KB	Output is correct
74	Correct	1 ms	604 KB	Output is correct
75	Correct	2 ms	1884 KB	Output is correct
76	Correct	2 ms	1628 KB	Output is correct
77	Correct	2 ms	1884 KB	Output is correct
78	Correct	2 ms	1628 KB	Output is correct
79	Correct	2 ms	1884 KB	Output is correct
80	Correct	2 ms	1880 KB	Output is correct
81	Correct	1 ms	600 KB	Output is correct
82	Correct	2 ms	2396 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	2 ms	2652 KB	Output is correct
85	Correct	2 ms	1884 KB	Output is correct
86	Correct	2 ms	3164 KB	Output is correct
87	Correct	2 ms	2904 KB	Output is correct
88	Correct	2 ms	3164 KB	Output is correct
89	Correct	3 ms	3420 KB	Output is correct
90	Correct	3 ms	2904 KB	Output is correct
91	Correct	2 ms	2908 KB	Output is correct
92	Correct	3 ms	4188 KB	Output is correct
93	Correct	4 ms	4444 KB	Output is correct
94	Correct	3 ms	3932 KB	Output is correct
95	Correct	2 ms	2908 KB	Output is correct
96	Correct	2 ms	2140 KB	Output is correct
97	Correct	2 ms	2136 KB	Output is correct
98	Correct	4 ms	5980 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct
100	Correct	6 ms	8880 KB	Output is correct
101	Correct	3 ms	2648 KB	Output is correct
102	Correct	3 ms	2908 KB	Output is correct
103	Correct	14 ms	17340 KB	Output is correct
104	Correct	15 ms	15708 KB	Output is correct
105	Correct	26 ms	31732 KB	Output is correct
106	Correct	29 ms	33628 KB	Output is correct
107	Correct	22 ms	27732 KB	Output is correct
108	Correct	17 ms	21084 KB	Output is correct
109	Correct	9 ms	11356 KB	Output is correct
110	Correct	8 ms	11612 KB	Output is correct

Subtask #6
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	1368 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	6 ms	7260 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	3 ms	3676 KB	Output is correct
13	Correct	1 ms	1372 KB	Output is correct
14	Correct	1 ms	1628 KB	Output is correct
15	Correct	1 ms	1372 KB	Output is correct
16	Correct	2 ms	1368 KB	Output is correct
17	Correct	1 ms	600 KB	Output is correct
18	Correct	1 ms	1116 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	3 ms	3476 KB	Output is correct
23	Correct	3 ms	2908 KB	Output is correct
24	Correct	1 ms	1628 KB	Output is correct
25	Correct	1 ms	1628 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	1116 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	604 KB	Output is correct
33	Correct	1 ms	1624 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	1372 KB	Output is correct
37	Correct	6 ms	5980 KB	Output is correct
38	Correct	20 ms	28252 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	6 ms	7260 KB	Output is correct
47	Correct	9 ms	9820 KB	Output is correct
48	Correct	3 ms	948 KB	Output is correct
49	Correct	2 ms	600 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	1 ms	600 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	1 ms	344 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	464 KB	Output is correct
65	Correct	1 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	0 ms	344 KB	Output is correct
73	Correct	1 ms	344 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	1 ms	348 KB	Output is correct
76	Correct	0 ms	348 KB	Output is correct
77	Correct	0 ms	348 KB	Output is correct
78	Correct	1 ms	348 KB	Output is correct
79	Correct	0 ms	348 KB	Output is correct
80	Correct	0 ms	348 KB	Output is correct
81	Correct	0 ms	344 KB	Output is correct
82	Correct	0 ms	348 KB	Output is correct
83	Correct	1 ms	348 KB	Output is correct
84	Correct	0 ms	348 KB	Output is correct
85	Correct	0 ms	348 KB	Output is correct
86	Correct	1 ms	348 KB	Output is correct
87	Correct	0 ms	348 KB	Output is correct
88	Correct	0 ms	348 KB	Output is correct
89	Correct	1 ms	348 KB	Output is correct
90	Correct	1 ms	1372 KB	Output is correct
91	Correct	1 ms	348 KB	Output is correct
92	Correct	0 ms	348 KB	Output is correct
93	Correct	1 ms	604 KB	Output is correct
94	Correct	2 ms	1884 KB	Output is correct
95	Correct	1 ms	1400 KB	Output is correct
96	Correct	1 ms	604 KB	Output is correct
97	Correct	1 ms	604 KB	Output is correct
98	Correct	2 ms	1884 KB	Output is correct
99	Correct	2 ms	1628 KB	Output is correct
100	Correct	2 ms	1884 KB	Output is correct
101	Correct	2 ms	1628 KB	Output is correct
102	Correct	2 ms	1884 KB	Output is correct
103	Correct	2 ms	1880 KB	Output is correct
104	Correct	1 ms	600 KB	Output is correct
105	Correct	2 ms	2396 KB	Output is correct
106	Correct	0 ms	348 KB	Output is correct
107	Correct	2 ms	2652 KB	Output is correct
108	Correct	2 ms	1884 KB	Output is correct
109	Correct	2 ms	3164 KB	Output is correct
110	Correct	2 ms	2904 KB	Output is correct
111	Correct	2 ms	3164 KB	Output is correct
112	Correct	3 ms	3420 KB	Output is correct
113	Correct	3 ms	2904 KB	Output is correct
114	Correct	2 ms	2908 KB	Output is correct
115	Correct	3 ms	4188 KB	Output is correct
116	Correct	4 ms	4444 KB	Output is correct
117	Correct	3 ms	3932 KB	Output is correct
118	Correct	2 ms	2908 KB	Output is correct
119	Correct	2 ms	2140 KB	Output is correct
120	Correct	2 ms	2136 KB	Output is correct
121	Correct	4 ms	5980 KB	Output is correct
122	Correct	0 ms	348 KB	Output is correct
123	Correct	6 ms	8880 KB	Output is correct
124	Correct	3 ms	2648 KB	Output is correct
125	Correct	3 ms	2908 KB	Output is correct
126	Correct	14 ms	17340 KB	Output is correct
127	Correct	15 ms	15708 KB	Output is correct
128	Correct	26 ms	31732 KB	Output is correct
129	Correct	29 ms	33628 KB	Output is correct
130	Correct	22 ms	27732 KB	Output is correct
131	Correct	17 ms	21084 KB	Output is correct
132	Correct	9 ms	11356 KB	Output is correct
133	Correct	8 ms	11612 KB	Output is correct
134	Correct	32 ms	40304 KB	Output is correct
135	Correct	7 ms	5468 KB	Output is correct
136	Correct	3 ms	1116 KB	Output is correct
137	Correct	54 ms	67420 KB	Output is correct
138	Correct	50 ms	69468 KB	Output is correct
139	Correct	196 ms	197316 KB	Output is correct
140	Correct	183 ms	207468 KB	Output is correct
141	Correct	130 ms	159316 KB	Output is correct
142	Correct	101 ms	127828 KB	Output is correct
143	Correct	49 ms	55892 KB	Output is correct
144	Correct	39 ms	56356 KB	Output is correct

답안 #947626

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 12.0 / 12.0

Subtask #4 45.0 / 45.0

Subtask #5 15.0 / 15.0

Subtask #6 15.0 / 15.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
12.0 / 12.0

Subtask #4
45.0 / 45.0

Subtask #5
15.0 / 15.0

Subtask #6
15.0 / 15.0