oj.uz

Submission #498234

# Submission time Handle Problem Language Result Execution time Memory
498234 2021-12-24T16:09:55 Z inksamurai Drvca (COCI19_drvca) C++17
0 / 110
 1000 ms 3924 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 _32bB6rn ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
 
inline int read(){
	int x;
	cin>>x;
	return x;
}
 
inline void print(int x){
	cout<<x<<" ";
}
 
inline void println(int x){
	cout<<x<<"\n";
}

inline void put(string s){
	cout<<s<<"\n";
}
 
using pii=pair<int,int>;
using vi=vector<int>;
using dq=deque<int>;
 
int main(){
_32bB6rn;
	int n;
	cin>>n;
	vi a(n);
	rep(i,n) cin>>a[i];
	sort(all(a));
 
	vec(vi) wata(2,vi(n));
	wata[0][0]=wata[0][1]=1;
	crep(i,2,n){
		if(a[i]-a[i-1]!=a[i-1]-a[i-2]){
			break;
		}
		wata[0][i]=1;
	}
	wata[1][n-1]=wata[1][n-2]=1;
	drep(i,n-2){
		if(a[i+1]-a[i]!=a[i+2]-a[i+1]){
			break;
		}
		wata[1][i]=1;
	}
 	
 	// rep(i,n){
 	// 	print(wata[1][i]);
 	// }
 	// put("");

	auto out=[](dq up,dq dw){
		vec(dq) cand;
		cand.pb(up);
		cand.pb(dw);
		rep(t,2){
			dq rbt=cand[t];
			if(!sz(rbt))
				return;
			crep(i,2,sz(rbt)){
				if(rbt[i]-rbt[i-1]!=rbt[i-1]-rbt[i-2]){
					return;
				}
			}
		}
		rep(t,2){
			dq rbt=cand[t];
			println(sz(rbt));
			for(auto x : rbt){
				print(x);
			}
			put("");
		}
		exit(0);
	};
 
	auto affine=[&](int i,int diff){
		dq up={a[i]},dw;
		rep(type,2){
			int j=i+(type==0?1:-1);
			while((type==0?j<n:j>=0)){
				while((type==0?j<n and a[j]-up.back()!=diff:j>=0 and up.front()-a[j]!=diff)){
					if(type==0) dw.pb(a[j]);
					else dw.push_front(a[j]);
					j=j+(type==0?1:-1);
				}
				if((type==0?j<n:j>=0)){
					if(type==0) up.pb(a[j]);
					else up.push_front(a[j]);
					// int oj=(type==0?j+1:j-1);
					// int cnt=0;
					// while((type==0?oj<n:oj>=0)){
					// 	if(type==0) dw.pb(a[oj]);
					// 	else dw.push_front(a[oj]);
					// 	oj+=(type==0?1:-1);
					// 	cnt++;
					// }
					// if(type==1) g(up,dw);
					// rep(_,cnt){
					// 	if(type==0) dw.pop_back();
					// 	else dw.pop_front();
					// }
					j=j+(type==0?1:-1);
				}
			}
		}
		out(up,dw);
	};
 
	rep(i,n){
		if(i+1<n){
			// if(a[i+1]-a[i]!=a[i+2]-a[i+1]){
				affine(i,a[i+1]-a[i]);
				// affine(i,i+2);
				// affine(i+1,i+2);
				// break;
			// }
		}
	}
	
	dq up,dw;
	rep(_,2){
		for(int i=_;i<n;i+=2){
			if(_==0) up.pb(a[i]);
			else dw.pb(a[i]);
		}
	}
	out(up,dw);
	puts("-1");
//	
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3908 KB Output is correct
2 Correct 28 ms 3908 KB Output is correct
3 Correct 25 ms 3900 KB Output is correct
4 Correct 26 ms 3908 KB Output is correct
5 Correct 25 ms 3924 KB Output is correct
6 Correct 27 ms 3920 KB Output is correct
7 Correct 26 ms 3900 KB Output is correct
8 Correct 25 ms 3856 KB Output is correct
9 Execution timed out 1082 ms 2884 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -