oj.uz

Submission #442971

# Submission time Handle Problem Language Result Execution time Memory
442971 2021-07-09T12:16:31 Z Abrar_Al_Samit Drvca (COCI19_drvca) C++17
0 / 110
 40 ms 2120 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define debug(x) cerr << '[' << (#x) << "] = " << x << '\n';

template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;

void PlayGround() {
    int N; cin >> N;
    vector<int>a(N);
    for(int i=0; i<N; ++i) cin >> a[i];
    sort(a.begin(), a.end());

    if(N < 4) {
        cout << 1 << '\n' << a[0] << '\n' << N-1 << '\n';
        for(int i=1; i<N; ++i) cout << a[i] << ' ';
        cout << '\n';
        return;
    }
    auto print = [=] (deque<int>&x, deque<int>&y) {
        sort(x.begin(), x.end());
        sort(y.begin(), y.end());
        cout << x.size() << '\n';
        for(auto it : x) cout << it << ' ';
        cout << '\n';
        cout << y.size() << '\n';
        for(auto it : y) cout << it << ' ';
        cout << "\n";
    };
    vector<int>b = {0, 1, 2};
    do {
        deque<int>x;
        x.push_back(a[b[0]]);
        x.push_back(a[b[1]]);
        deque<int>y;
        y.push_back(a[b[2]]);
        if(x[0]>x[1]) swap(x[0], x[1]);
        int dif = x[1] - x[0];

        for(int i=3; i<N; ++i) {
            if(a[i]-x.back()==dif) x.push_back(a[i]);
            else if(a[i]-x.front()==dif) x.push_front(a[i]);
            else if(y.size()<2 || a[i]-y.back()==abs(y[0]-y[1])) y.push_back(a[i]);
            else if(y.size()<2 || a[i]-y.front()==abs(y[0]-y[1])) y.push_front(a[i]);
            else break;
        }
        if(int(x.size()+y.size())==N) {
            print(x, y);
            return;
        }
    } while(next_permutation(b.begin(), b.end()));
    deque<int>x, y;
    x.push_back(a[0]);
    x.push_back(a[1]);
    if(a[2]-x.back()==x[1]-x[0]) x.push_back(a[2]);
    else if(a[2]-x.front()==x[1]-x[0]) x.push_front(a[2]);
    else {
        cout << -1 << '\n';
        return;
    }
    int dif1 = abs(x[1]-x[0]), dif2;
    for(int i=3; i<N; ++i) {
        if(a[i]-x.back()==dif1) x.push_back(a[i]);
        else if(a[i]-x.front()==dif1) x.push_front(a[i]);
        else if(y.size()<2) y.push_back(a[i]);
        else if(dif2==a[i]-y.back()) y.push_back(a[i]);
        else if(dif2==a[i]-y.front()) y.push_front(a[i]);
        else {
            cout << -1 << '\n';
            return;
        }
        if(y.size()==2) dif2 = abs(y[1]-y[0]);
    }
    if(y.empty()) y.push_back(x.back()), x.pop_back();
    print(x, y);

   
    #ifndef ONLINE_JUDGE
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
}   
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    // #endif
    PlayGround();

    return 0;
}

Compilation message

drvca.cpp: In function 'void PlayGround()':
drvca.cpp:72:14: warning: 'dif2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         else if(dif2==a[i]-y.front()) y.push_front(a[i]);
      |              ^~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 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 -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 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 -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2020 KB Output is correct
2 Correct 37 ms 2052 KB Output is correct
3 Correct 35 ms 2044 KB Output is correct
4 Correct 40 ms 2076 KB Output is correct
5 Correct 34 ms 2120 KB Output is correct
6 Correct 37 ms 2008 KB Output is correct
7 Correct 35 ms 2072 KB Output is correct
8 Correct 38 ms 2088 KB Output is correct
9 Incorrect 20 ms 1028 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 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 -