oj.uz

답안 #229726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229726 2020-05-06T05:48:35 Z rrrr10000 Drvca (COCI19_drvca) C++14
0 / 110
 95 ms 4328 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}

int main(){
    ll n;cin>>n;
    vi v(n);
    rep(i,n)cin>>v[i];
    sort(all(v));
    if(n==2){
        out(1);out(v[0]);out(1);out(v[1]);
        return 0;
    }
    vi a,b;
    a.pb(v[0]);
    vb used(n,false);
    used[0]=true;
    ll k=v[0],d=v[1]-v[0];
    REP(i,1,n){
        if(v[i]-k==d){
            used[i]=true;
            a.pb(v[i]);
            k=v[i];
        }
    }
    rep(i,n)if(!used[i])b.pb(v[i]);
    bool ok=true;
    if(b.size()>1){
        d=b[1]-b[0];
        rep(i,b.size()-1)if(b[i+1]-b[i]!=d)ok=false;
    }
    if(!b.size()){
        a.pop_back();
        b.pb(v[n-1]);
    }
    if(ok){
        out(a.size());outv(a);out(b.size());outv(b);return 0;
    }
    a=vi(0);b=vi(0);used=vb(n,false);
    a.pb(v[0]);
    used[0]=true;
    k=v[0];d=v[2]-v[0];
    REP(i,2,n){
        if(v[i]-k==d){
            used[i]=true;
            a.pb(v[i]);
            k=v[i];
        }
    }
    rep(i,n)if(!used[i])b.pb(v[i]);
    ok=true;
    if(b.size()>1){
        d=b[1]-b[0];
        rep(i,b.size()-1)if(b[i+1]-b[i]!=d)ok=false;
    }
    if(!b.size()){
        a.pop_back();
        b.pb(v[n-1]);
    }
    if(ok){
        out(a.size());outv(a);out(b.size());outv(b);return 0;
    }
    a=vi(0);b=vi(0);used=vb(n,false);
    a.pb(v[1]);
    used[1]=true;
    k=v[1];d=v[2]-v[1];
    REP(i,2,n){
        if(v[i]-k==d){
            used[i]=true;
            a.pb(v[i]);
            k=v[i];
        }
    }
    rep(i,n)if(!used[i])b.pb(v[i]);
    ok=true;
    if(b.size()>1){
        d=b[1]-b[0];
        rep(i,b.size()-1)if(b[i+1]-b[i]!=d)ok=false;
    }
    if(!b.size()){
        a.pop_back();
        b.pb(v[n-1]);
    }
    if(ok){
        out(a.size());outv(a);out(b.size());outv(b);return 0;
    }
    out(-1);
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 4328 KB Output is correct
2 Correct 94 ms 4328 KB Output is correct
3 Correct 85 ms 4328 KB Output is correct
4 Correct 91 ms 4328 KB Output is correct
5 Correct 95 ms 4328 KB Output is correct
6 Correct 84 ms 4328 KB Output is correct
7 Correct 85 ms 4328 KB Output is correct
8 Correct 92 ms 4328 KB Output is correct
9 Incorrect 62 ms 3680 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -