답안 #862201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862201	2023-10-17T16:57:04 Z	TAhmed33	Volontiranje (COCI21_volontiranje)	C++	50 / 110	100 ms	604 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
pair <int, int> comp (pair <int, int> a, pair <int, int> b) {
	if (a.first == b.first) return a.second < b.second ? a : b;
	return a.first < b.first ? b : a;
}
struct SegmentTree {
	pair <int, int> tree[2001];
	void update (int l, int r, int a, pair <int, int> b, int node) {
		if (l > a || r < a) return;
		if (l == r) {
			tree[node] = comp(tree[node], b);
			return;
		}
		update(l, mid, a, b, tl);
		update(mid + 1, r, a, b, tr);
		tree[node] = comp(tree[tl], tree[tr]);
	}
	pair <int, int> get (int l, int r, int a, int b, int node) {
		if (a > b) return {0, 0};
		if (l > b || r < a) return {0, 0};
		if (l >= a && r <= b) return tree[node];
		return comp(get(l, mid, a, b, tl), get(mid + 1, r, a, b, tr));
	}
};
int arr[1001];
int n;
int main () {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
	}
	bool active[n + 1];
	for (int i = 1; i <= n; i++) active[i] = 1;
	vector <vector <int>> ans;
	int mx = 0;
	while (true) {
		int dp[n + 1] = {}, par[n + 1] = {};
		SegmentTree p; int l = 0;
		for (int i = 1; i <= n; i++) {
			if (!active[i]) continue;
			auto t = p.get(1, n, 1, arr[i] - 1, 1);
			dp[i] = t.first + 1;
			par[i] = t.second; l = max(l, dp[i]);
			p.update(1, n, arr[i], {dp[i], i}, 1);
		}
		if (l < mx) break;
		mx = l;
		bool ok[n + 1]; memset(ok, 0, sizeof(ok));
		int nxt[n + 1] = {};
		for (int i = n; i >= 1; i--) {
			if (!active[i]) continue;
			if (dp[i] == l) ok[i] = 1;
			if (!ok[i]) continue;
			ok[par[i]] = 1;
			nxt[par[i]] = i;
		}
		vector <int> u;
		for (int i = 1; i <= n; i++) {
			if (!active[i]) continue;
			if (ok[i]) {
				while (dp[i] != l) {
					u.push_back(i);
					active[i] = 0;
					i = nxt[i];
				}
				u.push_back(i);
				active[i] = 0;
				break;
			}
		}
		ans.push_back(u);
	}
	cout << ans.size() << " " << mx << '\n';
	for (auto i : ans) {
		for (auto j : i) cout << j << " ";
		cout << '\n';
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	388 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	448 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	504 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 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	1 ms	448 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	352 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	100 ms	460 KB	Output is correct
31	Correct	3 ms	352 KB	Output is correct
32	Correct	4 ms	472 KB	Output is correct
33	Correct	32 ms	348 KB	Output is correct
34	Correct	28 ms	352 KB	Output is correct
35	Correct	30 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	0 ms	344 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	456 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct

Subtask #3
0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	388 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	448 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	504 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 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	1 ms	448 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	352 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	100 ms	460 KB	Output is correct
31	Correct	3 ms	352 KB	Output is correct
32	Correct	4 ms	472 KB	Output is correct
33	Correct	32 ms	348 KB	Output is correct
34	Correct	28 ms	352 KB	Output is correct
35	Correct	30 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	0 ms	344 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	456 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Runtime error	1 ms	604 KB	Execution killed with signal 11
48	Halted	0 ms	0 KB	-

답안 #862201

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
0 / 60.0