oj.uz

Submission #917092

# Submission time Handle Problem Language Result Execution time Memory
917092 2024-01-27T06:54:39 Z macneil Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 193 ms 20260 KB 
//cf meowcneil; t.me/macneilbot

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <random>
#include <cassert>

using namespace std;

#define int long long
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define f(a) for(int i = 0; i<a; ++i)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<str> vestr;
typedef vector<int> vei;
typedef vector<vector<int>> veve;


void solve() {
    int n;
    cin >> n;
    deque<pair<int, int>> au;
    map<int, int> ct;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        if (ct[x] > 0) {
            int C = 1;
            while (au.back().first != x) {
                ct[au.back().first] -= au.back().second;
                C += au.back().second;
                au.pop_back();
            }
            au.back().second += C;
            continue;
        }
        au.push_back({x, 1});
        ct[x]++;
    }
    for (auto e : au) {
        for (int i = 0; i < e.second; ++i) {
            cout << e.first << '\n';
        }
    }
}

signed main() {
    int tc = 1;
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    // cin >> tc;
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // cin >> tc;
#endif
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 500 KB Output is correct
29 Correct 1 ms 420 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 17 ms 1116 KB Output is correct
48 Correct 18 ms 1116 KB Output is correct
49 Correct 21 ms 1072 KB Output is correct
50 Correct 22 ms 1112 KB Output is correct
51 Correct 20 ms 1368 KB Output is correct
52 Correct 20 ms 1116 KB Output is correct
53 Correct 19 ms 1112 KB Output is correct
54 Correct 21 ms 1112 KB Output is correct
55 Correct 20 ms 1072 KB Output is correct
56 Correct 21 ms 1112 KB Output is correct
57 Correct 25 ms 1116 KB Output is correct
58 Correct 22 ms 1112 KB Output is correct
59 Correct 19 ms 1148 KB Output is correct
60 Correct 18 ms 1116 KB Output is correct
61 Correct 18 ms 1112 KB Output is correct
62 Correct 27 ms 4188 KB Output is correct
63 Correct 169 ms 17492 KB Output is correct
64 Correct 193 ms 17488 KB Output is correct
65 Correct 30 ms 4072 KB Output is correct
66 Correct 34 ms 3992 KB Output is correct
67 Correct 31 ms 4176 KB Output is correct
68 Correct 30 ms 4188 KB Output is correct
69 Correct 31 ms 4176 KB Output is correct
70 Correct 32 ms 4176 KB Output is correct
71 Correct 36 ms 4180 KB Output is correct
72 Correct 31 ms 4180 KB Output is correct
73 Correct 110 ms 12032 KB Output is correct
74 Correct 105 ms 12284 KB Output is correct
75 Correct 159 ms 20052 KB Output is correct
76 Correct 189 ms 20088 KB Output is correct
77 Correct 152 ms 20260 KB Output is correct
78 Correct 133 ms 20052 KB Output is correct