oj.uz

Submission #765699

# Submission time Handle Problem Language Result Execution time Memory
765699 2023-06-25T03:19:17 Z 1075508020060209tc Drvca (COCI19_drvca) C++14
50 / 110
 1000 ms 4116 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
int ar[200005];
int tar[200005];
int sfok[200005];
int chk(vector<int>A){
for(int i=1;i<A.size();i++){
       // cout<<A[i]-A[i-1]<<endl;
    if((A[i]-A[i-1])!=(A[1]-A[0]) ){
        return 0;
    }
}
return 1;
}

void ot(vector<int>pl){
vector<int>A;
vector<int>B;
for(int i=1;i<=n;i++){
    tar[i]=0;
}
for(int i=0;i<pl.size();i++){
    tar[pl[i]]=1;
}
for(int i=1;i<=n;i++){
    if(tar[i]==1){
        A.push_back(ar[i]);
    }else{
        B.push_back(ar[i]);
    }
}
if(chk(A)&&chk(B)){
    if(B.size()==0){
        B.push_back(ar[n]);
        A.pop_back();
    }
}else{return;}
cout<<A.size()<<endl;
for(int i=0;i<A.size();i++){
    cout<<A[i]<<" ";
}cout<<endl;
cout<<B.size()<<endl;
for(int i=0;i<B.size();i++){
    cout<<B[i]<<" ";
}cout<<endl;
exit(0);
}


signed main(){
cin>>n;
for(int i=1;i<=n;i++){
    cin>>ar[i];
}
if(n==2){
    cout<<"1\n";
    cout<<ar[1]<<endl;
    cout<<"1\n";
    cout<<ar[2]<<endl;return 0;
}
sort(ar+1,ar+n+1);
sfok[n]=1;
for(int i=n-1;i>=1;i--){
    if(ar[i]-ar[i+1]!=ar[n-1]-ar[n]){
        break;
    }
    sfok[i]=1;
}
vector<int>A;
vector<int>B;
A.clear();B.clear();
A.push_back(1);
A.push_back(2);
ot(A);
for(int i=3;i<=n;i++){
    if(ar[i]-ar[A.back()]==ar[2]-ar[1]){
        A.push_back(i);
        ot(A);
    }
}
A.clear();
A.push_back(1);
A.push_back(3);
ot(A);
for(int i=4;i<=n;i++){
    if(ar[i]-ar[A.back()]==ar[3]-ar[1]){
        A.push_back(i);
        ot(A);
    }
}
A.clear();
A.push_back(2);
A.push_back(3);
ot(A);
for(int i=4;i<=n;i++){
    if(ar[i]-ar[A.back()]==ar[3]-ar[2]){
        A.push_back(i);
        ot(A);
    }
}
cout<<-1<<endl;

}

Compilation message

drvca.cpp: In function 'long long int chk(std::vector<long long int>)':
drvca.cpp:11:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | for(int i=1;i<A.size();i++){
      |             ~^~~~~~~~~
drvca.cpp: In function 'void ot(std::vector<long long int>)':
drvca.cpp:26:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | for(int i=0;i<pl.size();i++){
      |             ~^~~~~~~~~~
drvca.cpp:43:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 | for(int i=0;i<A.size();i++){
      |             ~^~~~~~~~~
drvca.cpp:47:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 | for(int i=0;i<B.size();i++){
      |             ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 308 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 308 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 4116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 308 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Execution timed out 1080 ms 4116 KB Time limit exceeded
32 Halted 0 ms 0 KB -