답안 #498968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498968 2021-12-26T20:08:25 Z inksamurai Drvca (COCI19_drvca) C++17
110 / 110
27 ms 3416 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int main(){
_3qplfh5;
	int n;
	cin>>n;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	sort(all(a));

	vi wata(n,-1);
	wata[n-1]=-1;
	wata[n-2]=-1;
	drep(i,n-2){
		if(a[i+1]-a[i]!=a[i+2]-a[i+1]){
			break;
		}
		wata[i]=a[i+1]-a[i];
	}
	// rep(i,n){
	// 	cout<<wata[i]<<" ";
	// }
	// cout<<"\n";

	auto g=[&](vi up,vi dw){
		vec(vi) cands;
		cands.pb(up);
		cands.pb(dw);
		int now=0;
		rep(t,2){
			if(!sz(cands[t]))
				return;
			now+=sz(cands[t]);
		}
		if(now!=n){
			return;
		}
		rep(t,2){
			crep(i,2,sz(cands[t])){
				if(cands[t][i]-cands[t][i-1]!=cands[t][i-1]-cands[t][i-2])
					return;
			}
		}
		rep(t,2){
			cout<<sz(cands[t])<<"\n";
			for(auto x : cands[t]){
				cout<<x<<" ";
			}
			cout<<"\n";
		}
		exit(0);
	};
	
	auto f=[&](int id,int id2){
		vi up,dw;
		up.pb(a[id]);
		up.pb(a[id2]);
		int diff=a[id2]-a[id];
		rep(i,n){
			if(i==id or i==id2){
				continue;
			}
			if(sz(dw)>=3){
				if(dw[sz(dw)-1]-dw[sz(dw)-2]!=dw[sz(dw)-2]-dw[sz(dw)-3]){
					return;
				}
			}
			int x=a[i];
			if(x-up.back()!=diff){
				dw.pb(x);
			}else{
				if(i>=n-3 or wata[i+1]!=-1){
					if(sz(dw)<=1 or i>=n-3 or a[i]-dw[sz(dw)-1]==dw[sz(dw)-1]-dw[sz(dw)-2]){
						crep(j,i,n){
							dw.pb(a[j]);
						}
						g(up,dw);
						crep(j,i,n){
							dw.pop_back();
						}
					}
				}
				up.pb(x);
			}
		}
		g(up,dw);
	};
	if(n!=2){
		f(0,1);
		f(0,2);
		f(1,2);
	}else{
		g({a[0]},{a[1]});
	}
	cout<<"-1\n";
//	
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3268 KB Output is correct
2 Correct 27 ms 3396 KB Output is correct
3 Correct 25 ms 3264 KB Output is correct
4 Correct 26 ms 3408 KB Output is correct
5 Correct 25 ms 3180 KB Output is correct
6 Correct 25 ms 3404 KB Output is correct
7 Correct 25 ms 3176 KB Output is correct
8 Correct 25 ms 3416 KB Output is correct
9 Correct 24 ms 2884 KB Output is correct
10 Correct 25 ms 3396 KB Output is correct
11 Correct 20 ms 3396 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 25 ms 3268 KB Output is correct
32 Correct 27 ms 3396 KB Output is correct
33 Correct 25 ms 3264 KB Output is correct
34 Correct 26 ms 3408 KB Output is correct
35 Correct 25 ms 3180 KB Output is correct
36 Correct 25 ms 3404 KB Output is correct
37 Correct 25 ms 3176 KB Output is correct
38 Correct 25 ms 3416 KB Output is correct
39 Correct 24 ms 2884 KB Output is correct
40 Correct 25 ms 3396 KB Output is correct
41 Correct 20 ms 3396 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 25 ms 3256 KB Output is correct
44 Correct 16 ms 1476 KB Output is correct
45 Correct 24 ms 3048 KB Output is correct
46 Correct 26 ms 3404 KB Output is correct
47 Correct 16 ms 1488 KB Output is correct
48 Correct 22 ms 2924 KB Output is correct
49 Correct 25 ms 3236 KB Output is correct
50 Correct 16 ms 1356 KB Output is correct
51 Correct 24 ms 3056 KB Output is correct
52 Correct 25 ms 3244 KB Output is correct
53 Correct 16 ms 1536 KB Output is correct
54 Correct 22 ms 2932 KB Output is correct
55 Correct 25 ms 3264 KB Output is correct
56 Correct 20 ms 3316 KB Output is correct
57 Correct 19 ms 3404 KB Output is correct
58 Correct 0 ms 204 KB Output is correct