oj.uz

Submission #443139

# Submission time Handle Problem Language Result Execution time Memory
443139 2021-07-09T19:21:43 Z Abrar_Al_Samit Drvca (COCI19_drvca) C++17
110 / 110
 255 ms 7816 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 = [] (vector<int>&x, vector<int>&y) {
    
        cout << x.size() << '\n';
        for(auto it : x) cout << it << ' ';
        cout << '\n';
        cout << y.size() << '\n';
        for(auto it : y) cout << it << ' ';
        cout << "\n";
    };
    // auto check = [] (multiset<int>& ms) {
    //     if(ms.size()<3) return true;
    //     int dif = *(next(ms.begin(), 1)) - *ms.begin();
    //     int last = *ms.begin() - dif;
    //     bool ret = true;
    //     for(auto it : ms) {
    //         ret &= it==last+dif;
    //         last = it;
    //     }
    //     return ret;
    // };
    vector<int>b = {0, 1, 2};
    do {
        vector<int>x = {a[b[0]], a[b[1]]};
        if(x[0]>x[1]) swap(x[0], x[1]);
        int dif = x[1] - x[0];
    
        multiset<int>ms;
        ms.insert(a[b[2]]);
        for(int i=3; i<N; ++i) {
            if(a[i]-x.back()==dif) x.push_back(a[i]);
            else ms.insert(a[i]);
        }
        if(ms.empty()) {
            vector<int>y = {x.back()};
            x.pop_back();
            print(x, y);
            return;
        }
        map<int,int>mp;
        if(ms.size()>1) {
            auto it = ms.begin();
            auto it2 = it;
            ++it2;
            while(it2!=ms.end()) {
                mp[*it2-*it]++;
                ++it2, ++it;
            }
        }
        debug(mp.size())
        debug(x.size())
        debug(ms.size())
        for(int i=x.size(); i>0; --i) {
            if(i<x.size()) {
                ms.insert(x[i]);
                auto it = ms.find(x[i]);
                if(it!=ms.begin() && next(it, 1)!=ms.end()) {
                    int gap = *next(it, 1) - *prev(it, 1);
                    mp[gap]--;
                    if(mp[gap]==0) 
                        mp.erase(gap);
                    mp[*it - *prev(it, 1)]++;
                    mp[*next(it, 1) - *it]++;
                } else if(it!=ms.begin()) {
                    mp[*it-*prev(it, 1)]++;
                } else if(next(it, 1)!=ms.end()) {
                    mp[*next(it, 1)-*it]++;
                }
            }
            if(mp.size()<2) {
                vector<int>y;
                for(auto it : ms) y.push_back(it);
                x.resize(i);
                print(x, y);
                return;
            }
        }
        // if(check(ms)) {
        //     vector<int>y;
        //     for(auto it : ms) y.push_back(it);
        //     print(x, y);
        //     return;
        // }

    } while(next_permutation(b.begin(), b.end()));
    vector<int>x = {a[0], a[1], a[2]}, y;
    if(x[2]-x[1]!=x[1]-x[0]) {
        cout << -1 << '\n';
        return;
    }
    multiset<int>ms;
    map<int,int>mp;
    for(int i=3; i<N; ++i) {
        if(a[i]-x.back()==x[1]-x[0]) x.push_back(a[i]);
        else ms.insert(a[i]);
    }
    if(ms.empty()) {
        vector<int>y = {x.back()};
        x.pop_back();
        print(x, y);
        return;
    }
    if(ms.size()>1) {
        auto it = ms.begin();
        auto it2 = it;
        ++it2;
        while(it2!=ms.end()) {
            mp[*it2-*it]++;
            ++it2, ++it;
        }
    }
    for(int i=x.size(); i>0; --i) {
        if(i<x.size()) {
            ms.insert(x[i]);
            auto it = ms.find(x[i]);
            if(it!=ms.begin() && next(it, 1)!=ms.end()) {
                int gap = *next(it, 1) - *prev(it, 1);
                mp[gap]--;
                if(mp[gap]==0) 
                    mp.erase(gap);
                mp[*it - *prev(it, 1)]++;
                mp[*next(it, 1) - *it]++;
            } else if(it!=ms.begin()) {
                mp[*it-*prev(it, 1)]++;
            } else if(next(it, 1)!=ms.end()) {
                mp[*next(it, 1)-*it]++;
            }
        }
        if(mp.size()<2) {
            vector<int>y;
            for(auto it : ms) y.push_back(it);
            x.resize(i);
            print(x, y);
            return;
        }
    }
    // if(check(ms)) {
    //     vector<int>y;
    //     for(auto it : ms) y.push_back(it);
    //     print(x, y);
    //     return;
    // }
    cout << -1 << '\n';
    
    
    #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:77:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             if(i<x.size()) {
      |                ~^~~~~~~~~
drvca.cpp:136:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |         if(i<x.size()) {
      |            ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 6700 KB Output is correct
2 Correct 203 ms 6876 KB Output is correct
3 Correct 186 ms 6844 KB Output is correct
4 Correct 205 ms 6872 KB Output is correct
5 Correct 233 ms 7092 KB Output is correct
6 Correct 203 ms 6836 KB Output is correct
7 Correct 228 ms 7096 KB Output is correct
8 Correct 200 ms 6804 KB Output is correct
9 Correct 198 ms 6536 KB Output is correct
10 Correct 187 ms 6652 KB Output is correct
11 Correct 26 ms 2252 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 233 ms 6700 KB Output is correct
32 Correct 203 ms 6876 KB Output is correct
33 Correct 186 ms 6844 KB Output is correct
34 Correct 205 ms 6872 KB Output is correct
35 Correct 233 ms 7092 KB Output is correct
36 Correct 203 ms 6836 KB Output is correct
37 Correct 228 ms 7096 KB Output is correct
38 Correct 200 ms 6804 KB Output is correct
39 Correct 198 ms 6536 KB Output is correct
40 Correct 187 ms 6652 KB Output is correct
41 Correct 26 ms 2252 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 255 ms 7816 KB Output is correct
44 Correct 247 ms 7108 KB Output is correct
45 Correct 197 ms 7268 KB Output is correct
46 Correct 201 ms 7388 KB Output is correct
47 Correct 209 ms 6792 KB Output is correct
48 Correct 192 ms 7108 KB Output is correct
49 Correct 242 ms 7672 KB Output is correct
50 Correct 192 ms 6528 KB Output is correct
51 Correct 194 ms 7264 KB Output is correct
52 Correct 207 ms 7480 KB Output is correct
53 Correct 209 ms 6860 KB Output is correct
54 Correct 196 ms 7100 KB Output is correct
55 Correct 204 ms 7452 KB Output is correct
56 Correct 198 ms 6844 KB Output is correct
57 Correct 26 ms 3180 KB Output is correct
58 Correct 0 ms 204 KB Output is correct