oj.uz

Submission #224864

# Submission time Handle Problem Language Result Execution time Memory
224864 2020-04-19T03:52:57 Z SorahISA Drvca (COCI19_drvca) C++17
50 / 110
 1000 ms 3340 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int n;
vector<int> val, valA, valB;

bool solve() {
    /*  Four types of solve() :
     *      A, A, A, ...
     *      A, A, B, ...
     *      A, B, A, ...
     *      B, A, A, ...
     */
    
    int diffA = valA[1] - valA[0];
    for (int i = 3; i < n; ++i) {
        if (val[i] - valA.back() == diffA) valA.eb(val[i]);
        else valB.eb(val[i]);
    }
    
    if (valB.empty()) {valB.eb(valA.back()), valA.pop_back(); return true;}
    if (valB.size() == 1) return true;
    
    int szB = valB.size();
    int diffB = valB[1] - valB[0];
    int fl = 1;
    for (int i = 1; i < szB; ++i) {
        if (valB[i] - valB[i-1] != diffB) {fl = 0; break;}
    }
    
    while (valA.size() >= 2 and !fl) {
        valB.eb(valA.back()), valA.pop_back(), sort(ALL(valB));
    
        ++szB;
        diffB = valB[1] - valB[0];
        fl = 1;
        for (int i = 1; i < szB; ++i) {
            if (valB[i] - valB[i-1] != diffB) {fl = 0; break;}
        }
    }
    
    return fl;
}

int32_t main() {
    fastIO();
    
    cin >> n;
    
    val.resize(n);
    for (auto &x : val) cin >> x;
    sort(ALL(val));
    
    if (n == 2) {
        cout << 1 << "\n" << val[0] << "\n";
        cout << 1 << "\n" << val[1] << "\n";
        return 0;
    }
    
    /// A, A, A, ... ///
    valA.clear(), valB.clear();
    valA.eb(val[0]), valA.eb(val[1]), valA.eb(val[2]);
    if (valA[1] - valA[0] == valA[2] - valA[1] and solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << valB.size() << "\n";
        for (auto x : valB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// A, A, B, ... ///
    valA.clear(), valB.clear();
    valA.eb(val[0]), valA.eb(val[1]), valB.eb(val[2]);
    if (solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << valB.size() << "\n";
        for (auto x : valB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// A, B, A, ... ///
    valA.clear(), valB.clear();
    valA.eb(val[0]), valB.eb(val[1]), valA.eb(val[2]);
    if (solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << valB.size() << "\n";
        for (auto x : valB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// B, A, A, ... ///
    valA.clear(), valB.clear();
    valB.eb(val[0]), valA.eb(val[1]), valA.eb(val[2]);
    if (solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << valB.size() << "\n";
        for (auto x : valB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    cout << -1 << "\n";
    
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3180 KB Output is correct
2 Correct 38 ms 3196 KB Output is correct
3 Correct 37 ms 3340 KB Output is correct
4 Correct 37 ms 3188 KB Output is correct
5 Correct 39 ms 3180 KB Output is correct
6 Correct 40 ms 3188 KB Output is correct
7 Correct 38 ms 3180 KB Output is correct
8 Correct 38 ms 3188 KB Output is correct
9 Execution timed out 1099 ms 2300 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 38 ms 3180 KB Output is correct
32 Correct 38 ms 3196 KB Output is correct
33 Correct 37 ms 3340 KB Output is correct
34 Correct 37 ms 3188 KB Output is correct
35 Correct 39 ms 3180 KB Output is correct
36 Correct 40 ms 3188 KB Output is correct
37 Correct 38 ms 3180 KB Output is correct
38 Correct 38 ms 3188 KB Output is correct
39 Execution timed out 1099 ms 2300 KB Time limit exceeded
40 Halted 0 ms 0 KB -