oj.uz

답안 #201170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201170 2020-02-09T15:01:29 Z rzbt Drvca (COCI19_drvca) C++14
0 / 110
 52 ms 3400 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]);
    }
    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

drvca.cpp: In function 'bool provera()':
drvca.cpp:18:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=2;i<b.size();i++){
                 ~^~~~~~~~~
drvca.cpp: In function 'void ispis()':
drvca.cpp:24:27: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",a.size());
                   ~~~~~~~~^
drvca.cpp:26:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("\n%d\n",b.size());
                     ~~~~~~~~^
drvca.cpp: In function 'int main()':
drvca.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
drvca.cpp:35:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%d",visine+i);
                         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 128 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 256 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 376 KB Output is correct
9 Incorrect 5 ms 376 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 128 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 256 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 376 KB Output is correct
9 Incorrect 5 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 3316 KB Output is correct
2 Correct 44 ms 3188 KB Output is correct
3 Correct 43 ms 3312 KB Output is correct
4 Correct 43 ms 3188 KB Output is correct
5 Correct 43 ms 3320 KB Output is correct
6 Correct 44 ms 3400 KB Output is correct
7 Correct 44 ms 3316 KB Output is correct
8 Correct 52 ms 3188 KB Output is correct
9 Incorrect 34 ms 2292 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 128 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 256 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 376 KB Output is correct
9 Incorrect 5 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -