# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448708 | 2021-07-31T20:28:36 Z | Antekb | Drvca (COCI19_drvca) | C++14 | 72 ms | 3264 KB |
#include<bits/stdc++.h> using namespace std; bool czy(vector<int> V){ if(V.size()==0)return 0; if(V.size()==1)return 1; int d=V[1]-V[0]; for(int i=1; i<V.size(); i++)if(V[i]-V[i-1]!=d)return 0; return 1; } void out(vector<int> V){ cout<<V.size()<<"\n"; for(int i:V)cout<<i<<" "; cout<<"\n"; } vector<int> V; bool roz(int a, int d){ vector<int> A, B; for(int i:V){ if(i==a)A.push_back(i), a+=d; else B.push_back(i); } if(czy(B)){ out(A); out(B); return 1; } B.push_back(A.back()); A.pop_back(); if(A.size() && czy(B)){ out(A); out(B); return 1; } return 0; } int main(){ int n; cin>>n; V.resize(n); for(int &i:V)cin>>i; sort(V.begin(), V.end()); if(roz(V[0], V[1]-V[0]))return 0; if(n==2){ cout<<"-1"; return 0; } if(roz(V[0], V[2]-V[0]))return 0; if(roz(V[1], V[2]-V[1]))return 0; cout<<-1; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 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 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 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 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 69 ms | 3216 KB | Output is correct |
2 | Correct | 69 ms | 3112 KB | Output is correct |
3 | Correct | 70 ms | 3264 KB | Output is correct |
4 | Correct | 68 ms | 3168 KB | Output is correct |
5 | Correct | 72 ms | 3264 KB | Output is correct |
6 | Correct | 69 ms | 3164 KB | Output is correct |
7 | Correct | 69 ms | 3228 KB | Output is correct |
8 | Correct | 68 ms | 3144 KB | Output is correct |
9 | Incorrect | 46 ms | 2144 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 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 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |