oj.uz

Submission #579834

# Submission time Handle Problem Language Result Execution time Memory
579834 2022-06-20T05:04:17 Z AGE Drvca (COCI19_drvca) C++14
0 / 110
 1000 ms 3076 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define int long long
#define pb push_back
using namespace std;
const int N=1e6,M=2e3+1,mod=1e9+7;
int a[N],vis[N];
main(){

    int n;
    cin>>n;

    for(int i=0;i<n;i++)
        cin>>a[i];

    sort(a,a+n);

    int Final_ans=0;
    vector<int>v,vv;

    if(n==2){

        cout<<1<<endl;
        cout<<a[0]<<endl;
        cout<<1<<endl;
        cout<<a[1]<<endl;
        return 0;

    }

    if(n==3){

        cout<<2<<endl;
        cout<<a[0]<<" "<<a[1]<<endl;
        cout<<1<<endl;
        cout<<a[2]<<endl;

        return 0;

    }
    for(int num=2;num<n-1;num++){

        if(Final_ans)
            break;

        for(int i=1;i<n;i++){

            if(Final_ans)
                break;

            int x=a[i]-a[0];

            if(x==0)
                continue;

            if(x%(num-1)==0){

                int diff=x/(num-1);
                v.clear(),vv.clear();

                for(int j=0;j<n;j++)
                    vis[j]=0;

                v.pb(a[0]);
                vis[0]=1;
                int lst=a[0];

                for(int j=1;j<=i;j++){

                    if(a[j]==lst+diff){
                        v.pb(a[j]),lst=a[j],vis[j]=1;
                    }

                }

                for(int j=1;j<n;j++)
                    if(vis[j]==0)
                        vv.pb(a[j]);


                if(v.size()!=num)
                    continue;


                int ok=0,diff2;
                if(vv.size()>1){
                    diff2=vv[1]-vv[0];

                    for(int j=1;j<vv.size();j++)
                        if(vv[j]!=vv[j-1]+diff2)
                            ok=1;

                    if(ok==1)
                        continue;

                }


                Final_ans=1;


            }
        }
    }

    if(Final_ans==1){

        cout<<v.size()<<endl;

        for(int i=0;i<v.size();i++)
            cout<<v[i]<<" ";
        cout<<endl;

        cout<<vv.size()<<endl;

        for(int i=0;i<vv.size();i++)
            cout<<vv[i]<<" ";
        cout<<endl;

    }

    else
        cout<<"-1"<<endl;

    return 0;
}

Compilation message

drvca.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    9 | main(){
      | ^~~~
drvca.cpp: In function 'int main()':
drvca.cpp:82:28: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   82 |                 if(v.size()!=num)
      |                    ~~~~~~~~^~~~~
drvca.cpp:90:34: 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]
   90 |                     for(int j=1;j<vv.size();j++)
      |                                 ~^~~~~~~~~~
drvca.cpp:111:22: 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]
  111 |         for(int i=0;i<v.size();i++)
      |                     ~^~~~~~~~~
drvca.cpp:117:22: 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]
  117 |         for(int i=0;i<vv.size();i++)
      |                     ~^~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -