oj.uz

Submission #759074

# Submission time Handle Problem Language Result Execution time Memory
759074 2023-06-15T18:10:29 Z fanwen Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 154 ms 15944 KB 
/**
 *      author : pham van sam 
 *      created : 16 June 2023 (Friday)
 **/

#include <bits/stdc++.h>

using namespace std;
using namespace chrono;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(it, s) for (__typeof(s.begin()) it = (s).begin(); it != (s).end(); ++it)

template <typename U, typename V> bool maximize(U &A, const V &B) { return (A < B) ? (A = B, true) : false; }
template <typename U, typename V> bool minimize(U &A, const V &B) { return (A > B) ? (A = B, true) : false; }

const int MAXN = 2e5 + 5;

int N, a[MAXN];

void process(void) {
    cin >> N;
    FOR(i, 1, N) cin >> a[i];
    map <int, int> cnt;
    vector <pair <int, int>> events;
    FOR(i, 1, N) {
        if(cnt[a[i]] == 0) events.emplace_back(a[i], 1), cnt[a[i]]++;
        else {
            int sum = 1;
            while(!events.empty() && events.back().first != a[i]) {
                cnt[events.back().first] -= events.back().second;
                sum += events.back().second;
                events.pop_back();
            }
            events.back().second += sum;
            cnt[a[i]] += sum;
        }
    }
    for (auto &[u, tmp] : events) {
        while(tmp--) cout << u << "\n";
    }
}

signed main() {

    #define TASK "TASK"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    auto start_time = steady_clock::now();
    int test = 1;
    // cin >> test;
    for (int i = 1; i <= test; ++i) {
        process();
        // cout << '\n';
    }

    auto end_time = steady_clock::now();

    cerr << "\nExecution time : " << duration_cast<milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:54:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 19 ms 1712 KB Output is correct
18 Correct 19 ms 1804 KB Output is correct
19 Correct 21 ms 1868 KB Output is correct
20 Correct 20 ms 1796 KB Output is correct
21 Correct 20 ms 1800 KB Output is correct
22 Correct 20 ms 1768 KB Output is correct
23 Correct 29 ms 1800 KB Output is correct
24 Correct 20 ms 1860 KB Output is correct
25 Correct 20 ms 1836 KB Output is correct
26 Correct 20 ms 1876 KB Output is correct
27 Correct 20 ms 1808 KB Output is correct
28 Correct 20 ms 1880 KB Output is correct
29 Correct 19 ms 1788 KB Output is correct
30 Correct 19 ms 1604 KB Output is correct
31 Correct 19 ms 1876 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 472 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 19 ms 1712 KB Output is correct
48 Correct 19 ms 1804 KB Output is correct
49 Correct 21 ms 1868 KB Output is correct
50 Correct 20 ms 1796 KB Output is correct
51 Correct 20 ms 1800 KB Output is correct
52 Correct 20 ms 1768 KB Output is correct
53 Correct 29 ms 1800 KB Output is correct
54 Correct 20 ms 1860 KB Output is correct
55 Correct 20 ms 1836 KB Output is correct
56 Correct 20 ms 1876 KB Output is correct
57 Correct 20 ms 1808 KB Output is correct
58 Correct 20 ms 1880 KB Output is correct
59 Correct 19 ms 1788 KB Output is correct
60 Correct 19 ms 1604 KB Output is correct
61 Correct 19 ms 1876 KB Output is correct
62 Correct 28 ms 5060 KB Output is correct
63 Correct 133 ms 15036 KB Output is correct
64 Correct 145 ms 14800 KB Output is correct
65 Correct 30 ms 4684 KB Output is correct
66 Correct 29 ms 4564 KB Output is correct
67 Correct 32 ms 4960 KB Output is correct
68 Correct 29 ms 4428 KB Output is correct
69 Correct 37 ms 3512 KB Output is correct
70 Correct 30 ms 4812 KB Output is correct
71 Correct 30 ms 4812 KB Output is correct
72 Correct 31 ms 3948 KB Output is correct
73 Correct 102 ms 10136 KB Output is correct
74 Correct 103 ms 10440 KB Output is correct
75 Correct 105 ms 15600 KB Output is correct
76 Correct 154 ms 15944 KB Output is correct
77 Correct 107 ms 15928 KB Output is correct
78 Correct 106 ms 14604 KB Output is correct