oj.uz

Submission #444730

# Submission time Handle Problem Language Result Execution time Memory
444730 2021-07-15T02:06:50 Z penguinhacker Drvca (COCI19_drvca) C++14
50 / 110
 45 ms 4004 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=1e5;
int n, a[mxN], prv[mxN], nxt[mxN], cnt;
vector<int> cur={0};
bool rem[mxN]={1}, bad[mxN];

void calc(int i) {
	if (0<=i&&i<n) {
		cnt-=bad[i];
		if (rem[i])
			bad[i]=0;
		else {
			if (prv[i]<0||rem[prv[i]]||nxt[i]>=n||rem[nxt[i]])
				bad[i]=0;
			else
				bad[i]=a[i]-a[prv[i]]!=a[nxt[i]]-a[i];
		}
		cnt+=bad[i];
	}
}

void ck() {
	if (cnt)
		return;
	assert(cnt==0);
	vector<bool> other(n, 1);
	cout << cur.size() << "\n";
	for (int i : cur) {
		other[i]=0;
		cout << a[i] << " ";
	}
	cout << "\n" << n-cur.size() << "\n";
	for (int i=0; i<n; ++i)
		if (other[i])
			cout << a[i] << " ";
	exit(0);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i=0; i<n; ++i) {
		cin >> a[i];
		prv[i]=i-1;
		nxt[i]=i+1;
	}
	sort(a, a+n);
	for (int i=1; i<n; ++i)
		calc(i);
	ck();
	for (int i=1; i<n; ++i) {
		if (i>1&&a[i]==a[i-1])
			continue;
		int d=a[i]-a[0];
		for (int j=i; j<n;) {
			assert(!rem[j]);
			nxt[prv[j]]=nxt[j];
			prv[nxt[j]]=prv[j];
			rem[j]=1;
			cur.push_back(j);
			calc(j), calc(prv[j]), calc(nxt[j]);
			ck();
			int p=lower_bound(a, a+n, a[j]+d)-a;
			p=max(j+1, p);
			if (p==n||a[p]!=a[j]+d)
				break;
			j=p;
		}
		while(cur.size()>1) {
			int j=cur.back();
			cur.pop_back();
			nxt[prv[j]]=j;
			prv[nxt[j]]=j;
			rem[j]=0;
			calc(j), calc(prv[j]), calc(nxt[j]);
		}
	}
	cout << -1;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3884 KB Output is correct
2 Correct 36 ms 3912 KB Output is correct
3 Correct 37 ms 3880 KB Output is correct
4 Correct 39 ms 3908 KB Output is correct
5 Incorrect 37 ms 4004 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 45 ms 3884 KB Output is correct
32 Correct 36 ms 3912 KB Output is correct
33 Correct 37 ms 3880 KB Output is correct
34 Correct 39 ms 3908 KB Output is correct
35 Incorrect 37 ms 4004 KB Output isn't correct
36 Halted 0 ms 0 KB -