oj.uz

답안 #198347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
198347 2020-01-25T16:38:07 Z alrad Drvca (COCI19_drvca) C++17
110 / 110
 139 ms 9048 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
   ios_base :: sync_with_stdio(0);
   cin.tie(0) , cout.tie(0);
   int n;
   cin >> n;
   vector<long long> a(n);
   for (int i = 0; i < n; i++) {
      cin >> a[i];
   }
   sort(a.begin() , a.end());
   if (n == 2) {
      cout << 1 << '\n' << a[0] << '\n';
      cout << 1 << '\n' << a[1] << '\n';
      return 0;
   }
   auto run = [&](int x , int y) {
      int d1 = a[y] - a[x] , p1 = a[y];
      vector<int> seq1 , seq2;
      seq1.push_back(a[x]);
      seq1.push_back(a[y]);
      for (int i = 0; i < n; i++) {
         if (i == x || i == y) {
            continue;
         }
         if (a[i] - p1 == d1) {
            seq1.push_back(a[i]);
            p1 = a[i];
         } else {
            seq2.push_back(a[i]);
         }
      }
      bool good = true;
      if ((int)seq2.size() >= 2) {
         for (int i = 1; i < (int)seq2.size() && good; i++) {
            if (seq2[1] - seq2[0] != seq2[i] - seq2[i - 1]) {
               good = false;
            }
         }
      }
      if (!good) {
         //try to make good
         multiset<int> q1 , q2;
         multiset<int> erased;
         for (int num : seq1) {
            q1.insert(num);
         }
         int d2 = seq2[1] - seq2[0];
         for (int num : seq2) {
            q2.insert(num);
         }
         good = true;
         for (int num : q2) {
            if (num == *prev(q2.end())) {
               continue;
            }
            if (q2.count(num + d2) == 0) {
               auto it = q1.find(num + d2);
               if (it == q1.end()) {
                  good = false;
                  break;
               }
               while (it != q1.end()) {
                  q2.insert(*it);
                  erased.insert(*it);
                  it++;
               }
               break;
            }
         }
         if (good) {
            cout << (int)q1.size() - (int)erased.size() << '\n';
            for (int num : q1) {
               auto w = erased.find(num);
               if (w == erased.end())
                  cout <<  num << " ";
               else
                  erased.erase(w);
            }
            cout << '\n';
            cout << (int)q2.size() << '\n';
            for (int num : q2) {
               cout << num << " ";
            }
            cout << '\n';
            exit(0);
         }
      }
      if (good) {
         if (seq2.empty()) {
            seq2.push_back(seq1.back());
            seq1.pop_back();
         }
         cout << (int)seq1.size() << '\n';
         for (int num : seq1) {
            cout << num << " ";
         }
         cout << '\n';
         cout << (int)seq2.size() << '\n';
         for (int num : seq2) {
            cout << num << " ";
         }
         cout << '\n';
         exit(0);
      }
   };
   run(0 , 1);
   run(0 , 2);
   run(1 , 2);
   cout << -1 << '\n';
   return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 252 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 252 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 1 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 380 KB Output is correct
30 Correct 3 ms 376 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 3676 KB Output is correct
2 Correct 37 ms 3572 KB Output is correct
3 Correct 37 ms 3776 KB Output is correct
4 Correct 38 ms 3700 KB Output is correct
5 Correct 31 ms 3700 KB Output is correct
6 Correct 37 ms 3672 KB Output is correct
7 Correct 37 ms 3700 KB Output is correct
8 Correct 37 ms 3584 KB Output is correct
9 Correct 65 ms 7808 KB Output is correct
10 Correct 61 ms 8308 KB Output is correct
11 Correct 30 ms 3700 KB Output is correct
12 Correct 3 ms 380 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 252 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 1 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 380 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 37 ms 3676 KB Output is correct
32 Correct 37 ms 3572 KB Output is correct
33 Correct 37 ms 3776 KB Output is correct
34 Correct 38 ms 3700 KB Output is correct
35 Correct 31 ms 3700 KB Output is correct
36 Correct 37 ms 3672 KB Output is correct
37 Correct 37 ms 3700 KB Output is correct
38 Correct 37 ms 3584 KB Output is correct
39 Correct 65 ms 7808 KB Output is correct
40 Correct 61 ms 8308 KB Output is correct
41 Correct 30 ms 3700 KB Output is correct
42 Correct 3 ms 380 KB Output is correct
43 Correct 42 ms 3720 KB Output is correct
44 Correct 108 ms 7080 KB Output is correct
45 Correct 55 ms 8692 KB Output is correct
46 Correct 32 ms 3672 KB Output is correct
47 Correct 116 ms 7340 KB Output is correct
48 Correct 67 ms 8176 KB Output is correct
49 Correct 28 ms 3700 KB Output is correct
50 Correct 139 ms 7452 KB Output is correct
51 Correct 71 ms 9048 KB Output is correct
52 Correct 38 ms 3704 KB Output is correct
53 Correct 113 ms 7336 KB Output is correct
54 Correct 67 ms 8560 KB Output is correct
55 Correct 63 ms 8180 KB Output is correct
56 Correct 31 ms 3688 KB Output is correct
57 Correct 30 ms 3700 KB Output is correct
58 Correct 2 ms 376 KB Output is correct