# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201171 | 2020-02-09T15:02:13 Z | rzbt | Drvca (COCI19_drvca) | C++14 | 45 ms | 2420 KB |
#include <bits/stdc++.h> #define MAXN 100005 #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() using namespace std; int n; int visine[MAXN]; vector<int> a,b; bool provera(){ if(b.empty()){ b.pb(a.back()); a.pop_back(); return true; } for(int i=2;i<b.size();i++){ if(b[i]-b[i-1]!=b[i-1]-b[i-2])return false; } return true; } void ispis(){ printf("%d\n",a.size()); for(auto x:a)printf("%d ",x); printf("\n%d\n",b.size()); for(auto x:b)printf("%d ",x); exit(0); } int main() { scanf("%d", &n); for(int i=0;i<n;i++)scanf("%d",visine+i); if(n==2){ printf("1\n%d\n1\n%d\n",visine[1],visine[0]); return 0; } sort(visine,visine+n); a.pb(visine[0]); a.pb(visine[1]); for(int i=2;i<n;i++){ if(visine[i]-a.back()==a.back()-a[a.size()-2])a.pb(visine[i]); else b.pb(visine[i]); } if(provera())ispis(); a.clear(); b.clear(); /// ///////////////////// a.pb(visine[0]); a.pb(visine[2]); b.pb(visine[1]); for(int i=3;i<n;i++){ if(visine[i]-a.back()==a.back()-a[a.size()-2])a.pb(visine[i]); else b.pb(visine[i]); } if(provera())ispis(); a.clear(); b.clear(); /// ///////////////////// a.pb(visine[1]); a.pb(visine[2]); b.pb(visine[0]); for(int i=3;i<n;i++){ if(visine[i]-a.back()==a.back()-a[a.size()-2])a.pb(visine[i]); else b.pb(visine[i]); } if(provera())ispis(); a.clear(); b.clear(); printf("-1"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 256 KB | Output is correct |
3 | Correct | 5 ms | 256 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 256 KB | Output is correct |
8 | Correct | 5 ms | 256 KB | Output is correct |
9 | Incorrect | 5 ms | 256 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 256 KB | Output is correct |
3 | Correct | 5 ms | 256 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 256 KB | Output is correct |
8 | Correct | 5 ms | 256 KB | Output is correct |
9 | Incorrect | 5 ms | 256 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 2420 KB | Output is correct |
2 | Correct | 45 ms | 2164 KB | Output is correct |
3 | Correct | 45 ms | 2292 KB | Output is correct |
4 | Correct | 45 ms | 2292 KB | Output is correct |
5 | Correct | 43 ms | 2292 KB | Output is correct |
6 | Correct | 43 ms | 2292 KB | Output is correct |
7 | Correct | 44 ms | 2292 KB | Output is correct |
8 | Correct | 45 ms | 2292 KB | Output is correct |
9 | Incorrect | 32 ms | 1524 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 256 KB | Output is correct |
3 | Correct | 5 ms | 256 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 256 KB | Output is correct |
8 | Correct | 5 ms | 256 KB | Output is correct |
9 | Incorrect | 5 ms | 256 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |