답안 #225258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
225258	2020-04-20T03:00:21 Z	SorahISA	Drvca (COCI19_drvca)	C++17	110 / 110	101 ms	7284 KB

drvca

// #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;
multiset<int> setB;

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 setB.insert(val[i]);
    }
    
    if (setB.empty()) {setB.insert(valA.back()), valA.pop_back(); return true;}
    if (setB.size() == 1) return true;
    
    int diffB = *next(setB.begin()) - *setB.begin();
    int lst = -1, cnt = 0;
    for (auto x : setB) {
        if (lst != -1 and x - lst != diffB) ++cnt;
        lst = x;
    }
    
    while (valA.size() >= 2 and cnt) {
        int ins = valA.back(); valA.pop_back();
        
        int diff1 = (setB.upper_bound(ins) == setB.end()) ?
                    diffB + 1 : *setB.upper_bound(ins) - ins;
        int diff2 = ins - *prev(setB.upper_bound(ins));
        
        if (min(diff1, diff2) < diffB) return false;
        if (diff1 == diffB and diff2 == diffB) --cnt;
        if (min(diff1, diff2) > diffB) ++cnt;
        
        setB.insert(ins);
    }
    
    return cnt == 0;
}

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(), setB.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 << setB.size() << "\n";
        for (auto x : setB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// A, A, B, ... ///
    valA.clear(), setB.clear();
    valA.eb(val[0]), valA.eb(val[1]), setB.insert(val[2]);
    if (solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << setB.size() << "\n";
        for (auto x : setB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// A, B, A, ... ///
    valA.clear(), setB.clear();
    valA.eb(val[0]), setB.insert(val[1]), valA.eb(val[2]);
    if (solve()) {
        cout << valA.size() << "\n";
        for (auto x : valA) cout << x << " ";
        cout << "\n";
        cout << setB.size() << "\n";
        for (auto x : setB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    /// B, A, A, ... ///
    valA.clear(), setB.clear();
    setB.insert(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 << setB.size() << "\n";
        for (auto x : setB) cout << x << " ";
        cout << "\n";
        return 0;
    }
    
    cout << -1 << "\n";
    
    return 0;
}

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 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	4 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 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	4 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	5 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	5 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	5 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	4 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	51 ms	4848 KB	Output is correct
2	Correct	49 ms	4828 KB	Output is correct
3	Correct	48 ms	4848 KB	Output is correct
4	Correct	49 ms	4856 KB	Output is correct
5	Correct	56 ms	4976 KB	Output is correct
6	Correct	49 ms	4852 KB	Output is correct
7	Correct	49 ms	4856 KB	Output is correct
8	Correct	48 ms	4852 KB	Output is correct
9	Correct	48 ms	4596 KB	Output is correct
10	Correct	50 ms	4904 KB	Output is correct
11	Correct	32 ms	3184 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 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	4 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	5 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	5 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	5 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	4 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	51 ms	4848 KB	Output is correct
32	Correct	49 ms	4828 KB	Output is correct
33	Correct	48 ms	4848 KB	Output is correct
34	Correct	49 ms	4856 KB	Output is correct
35	Correct	56 ms	4976 KB	Output is correct
36	Correct	49 ms	4852 KB	Output is correct
37	Correct	49 ms	4856 KB	Output is correct
38	Correct	48 ms	4852 KB	Output is correct
39	Correct	48 ms	4596 KB	Output is correct
40	Correct	50 ms	4904 KB	Output is correct
41	Correct	32 ms	3184 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	47 ms	5492 KB	Output is correct
44	Correct	69 ms	7284 KB	Output is correct
45	Correct	53 ms	6388 KB	Output is correct
46	Correct	49 ms	5492 KB	Output is correct
47	Correct	101 ms	7152 KB	Output is correct
48	Correct	55 ms	6268 KB	Output is correct
49	Correct	45 ms	5364 KB	Output is correct
50	Correct	97 ms	6904 KB	Output is correct
51	Correct	58 ms	6516 KB	Output is correct
52	Correct	39 ms	4084 KB	Output is correct
53	Correct	74 ms	7284 KB	Output is correct
54	Correct	54 ms	6264 KB	Output is correct
55	Correct	42 ms	4848 KB	Output is correct
56	Correct	41 ms	4592 KB	Output is correct
57	Correct	34 ms	4088 KB	Output is correct
58	Correct	5 ms	384 KB	Output is correct

답안 #225258

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 30.0 / 30.0

Subtask #3 30.0 / 30.0

Subtask #4 30.0 / 30.0

Subtask #1
20.0 / 20.0

Subtask #2
30.0 / 30.0

Subtask #3
30.0 / 30.0

Subtask #4
30.0 / 30.0