oj.uz

Submission #930068

# Submission time Handle Problem Language Result Execution time Memory
930068 2024-02-18T11:51:42 Z EJIC_B_KEDAX Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 156 ms 17092 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#ifndef LOCAL
    // #pragma GCC optimize("O3")
    // #pragma GCC optimize("Ofast")
    // #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937_64 mt(time(0));

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n), b;
    vector<pair<int, int>> seg;
    map<int, int> mp;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        if (mp[a[i]] == 0) {
            mp[a[i]]++;
            seg.emplace_back(i, i);
            b.push_back(a[i]);
        } else {
            while (b.back() != a[i]) {
                mp[b.back()]--;
                seg.pop_back();
                b.pop_back();
            }
            seg.back().y = i;
        }
    }
    for (int i = 0; i < b.size(); i++) {
        for (int j = seg[i].x; j <= seg[i].y; j++) {
            cout << b[i] << '\n';
        }
    }
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < b.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 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 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 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 0 ms 344 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 372 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 18 ms 1884 KB Output is correct
18 Correct 18 ms 1884 KB Output is correct
19 Correct 20 ms 1884 KB Output is correct
20 Correct 23 ms 1880 KB Output is correct
21 Correct 24 ms 1880 KB Output is correct
22 Correct 20 ms 2008 KB Output is correct
23 Correct 19 ms 1884 KB Output is correct
24 Correct 20 ms 1884 KB Output is correct
25 Correct 19 ms 1872 KB Output is correct
26 Correct 19 ms 1884 KB Output is correct
27 Correct 22 ms 1872 KB Output is correct
28 Correct 21 ms 1992 KB Output is correct
29 Correct 18 ms 1880 KB Output is correct
30 Correct 18 ms 1884 KB Output is correct
31 Correct 18 ms 1876 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 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 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 372 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 18 ms 1884 KB Output is correct
48 Correct 18 ms 1884 KB Output is correct
49 Correct 20 ms 1884 KB Output is correct
50 Correct 23 ms 1880 KB Output is correct
51 Correct 24 ms 1880 KB Output is correct
52 Correct 20 ms 2008 KB Output is correct
53 Correct 19 ms 1884 KB Output is correct
54 Correct 20 ms 1884 KB Output is correct
55 Correct 19 ms 1872 KB Output is correct
56 Correct 19 ms 1884 KB Output is correct
57 Correct 22 ms 1872 KB Output is correct
58 Correct 21 ms 1992 KB Output is correct
59 Correct 18 ms 1880 KB Output is correct
60 Correct 18 ms 1884 KB Output is correct
61 Correct 18 ms 1876 KB Output is correct
62 Correct 29 ms 5080 KB Output is correct
63 Correct 144 ms 15300 KB Output is correct
64 Correct 143 ms 15044 KB Output is correct
65 Correct 29 ms 4684 KB Output is correct
66 Correct 28 ms 4688 KB Output is correct
67 Correct 29 ms 5204 KB Output is correct
68 Correct 34 ms 5196 KB Output is correct
69 Correct 33 ms 5072 KB Output is correct
70 Correct 30 ms 5200 KB Output is correct
71 Correct 35 ms 5208 KB Output is correct
72 Correct 30 ms 4948 KB Output is correct
73 Correct 105 ms 10692 KB Output is correct
74 Correct 88 ms 10840 KB Output is correct
75 Correct 156 ms 16832 KB Output is correct
76 Correct 151 ms 16752 KB Output is correct
77 Correct 111 ms 16860 KB Output is correct
78 Correct 124 ms 17092 KB Output is correct