| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 498207 | inksamurai | Drvca (COCI19_drvca) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
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));
int id=-1;
auto g=[](dq up,dq dw){
if(!sz(up) or !sz(dw)) return;
int diff=0;
if(sz(up)>=2) diff=up[1]-up[0];
crep(i,2,sz(up)){
if(up[i]-up[i-1]!=diff){
return;
}
}
diff=0;
if(sz(dw)>=2) diff=dw[1]-dw[0];
crep(i,2,sz(dw)){
if(dw[i]-dw[i-1]!=diff){
return;
}
}
if(sz(up)){
rep(i,sz(up)){
if(i+2<sz(up) and id!=-1){
if(up[i]==a[id] and up[i+1]==a[id+1] and up[i+2]==a[id+2]) assert(false);
}
}
}
if(sz(dw)){
rep(i,sz(dw)){
if(i+2<sz(dw) and id!=-1){
if(dw[i]==a[id] and dw[i+1]==a[id+1] and dw[i+2]==a[id+2]) assert(false);
}
}
}
cout<<sz(up)<<"\n";
for(auto x : up){
cout<<x<<" ";
}
cout<<"\n";
cout<<sz(dw)<<"\n";
for(auto x : dw){
cout<<x<<" ";
}
cout<<"\n";
exit(0);
};
auto f=[&](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);
}
}
}
g(up,dw);
};
rep(i,n-1){
if(i+2<n){
if(a[i+1]-a[i]!=a[i+2]-a[i+1]){
id=i;
break;
}
}
}
f(0,a[1]-a[0]);
dq up,dw;
rep(_,2){
for(int i=_;i<n;i+=2){
if(_==0) up.pb(a[i]);
else dw.pb(a[i]);
}
}
g(up,dw);
cout<<"-1\n";
//
return 0;
}