oj.uz

Submission #924131

# Submission time Handle Problem Language Result Execution time Memory
924131 2024-02-08T13:48:16 Z ErJ Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 579 ms 47096 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<pair<ll, ll>>
#define pp pair<ll, ll>
#define qi queue<ll>
#define qp queue<pp>
#define pqi priority_queue<ll>
#define pqp priority_queue<pp>
#define mi map<ll, ll>
#define mpi map<pp, ll>
#define mip map<ll, pp>
#define mpp map<pp, pp>
#define mb map<ll, bool>
#define si set<ll>
#define sp set<pp>
#define mod 1000000007
#define rep(a, b) for(int a = 0; a < (b); a++)
#define inf 100000000111111111


int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;

    cin >> n;
    vi A(n), input(n);
    mi color, decolor;
    int akt = 0;
    rep(i, n) {
        cin >> A[i];
        if (!color.count(A[i])) {
            color[A[i]] = akt;
            decolor[akt] = A[i];
            akt++;
        }
        input[i] = A[i];
    }
    vector<vp> B(akt);
    vector<pair<pp, int>> ted;
    rep(i, n) {
        int x = color[A[i]];
        if (B[x].empty()) {
            B[x].push_back({ i, i });
            ted.push_back({ {i, i}, x });
        }
        else {
            while (ted.back().second != x) {
                int y = ted.back().second;
                B[y].pop_back();
                ted.pop_back();
            }
            pair<pp, int> k = ted.back();
            ted.pop_back();
            B[k.second].pop_back();
            pair<pair<int, int>, int> k2 = { {k.first.first, i}, k.second};
            B[k.second].push_back(k2.first);
            ted.push_back(k2);
        }
    }
    rep(i, ted.size()) {
        pair<pp, int> ans = ted[i];
        for (int j = ans.first.first; j <= ans.first.second; j++) {
            cout << decolor[ans.second] << endl;
        }
    }

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:24:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 | #define rep(a, b) for(int a = 0; a < (b); a++)
      |                                    ^
Main.cpp:68:5: note: in expansion of macro 'rep'
   68 |     rep(i, ted.size()) {
      |     ^~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 3 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 3 ms 416 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 235 ms 4224 KB Output is correct
18 Correct 244 ms 3816 KB Output is correct
19 Correct 234 ms 3860 KB Output is correct
20 Correct 235 ms 3880 KB Output is correct
21 Correct 234 ms 3876 KB Output is correct
22 Correct 257 ms 3912 KB Output is correct
23 Correct 232 ms 3864 KB Output is correct
24 Correct 265 ms 3924 KB Output is correct
25 Correct 229 ms 4036 KB Output is correct
26 Correct 255 ms 3812 KB Output is correct
27 Correct 240 ms 4136 KB Output is correct
28 Correct 230 ms 3880 KB Output is correct
29 Correct 238 ms 3920 KB Output is correct
30 Correct 235 ms 3964 KB Output is correct
31 Correct 229 ms 3884 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 3 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 3 ms 416 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 544 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 3 ms 348 KB Output is correct
40 Correct 3 ms 344 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 3 ms 348 KB Output is correct
43 Correct 3 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 235 ms 4224 KB Output is correct
48 Correct 244 ms 3816 KB Output is correct
49 Correct 234 ms 3860 KB Output is correct
50 Correct 235 ms 3880 KB Output is correct
51 Correct 234 ms 3876 KB Output is correct
52 Correct 257 ms 3912 KB Output is correct
53 Correct 232 ms 3864 KB Output is correct
54 Correct 265 ms 3924 KB Output is correct
55 Correct 229 ms 4036 KB Output is correct
56 Correct 255 ms 3812 KB Output is correct
57 Correct 240 ms 4136 KB Output is correct
58 Correct 230 ms 3880 KB Output is correct
59 Correct 238 ms 3920 KB Output is correct
60 Correct 235 ms 3964 KB Output is correct
61 Correct 229 ms 3884 KB Output is correct
62 Correct 263 ms 5876 KB Output is correct
63 Correct 540 ms 43540 KB Output is correct
64 Correct 548 ms 42744 KB Output is correct
65 Correct 247 ms 5204 KB Output is correct
66 Correct 245 ms 5388 KB Output is correct
67 Correct 270 ms 5460 KB Output is correct
68 Correct 258 ms 5384 KB Output is correct
69 Correct 252 ms 5436 KB Output is correct
70 Correct 247 ms 5712 KB Output is correct
71 Correct 245 ms 5460 KB Output is correct
72 Correct 249 ms 5556 KB Output is correct
73 Correct 436 ms 25836 KB Output is correct
74 Correct 403 ms 25708 KB Output is correct
75 Correct 579 ms 46352 KB Output is correct
76 Correct 519 ms 46328 KB Output is correct
77 Correct 551 ms 46360 KB Output is correct
78 Correct 552 ms 47096 KB Output is correct