oj.uz

Submission #787274

# Submission time Handle Problem Language Result Execution time Memory
787274 2023-07-19T03:10:39 Z ddeadeye Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 108 ms 13348 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define si second
#define ar array
#define pb push_back
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
typedef vector<int> vi;
template<typename T> bool chmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
const int N = 200010;
int n, a[N], ans[N], jmp[N];
map<int,int> l;
vector<pi> rr;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin.exceptions(ios::badbit|ios::failbit);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = n; i >= 1; --i) {
        if (l[a[i]]) jmp[i] = l[a[i]];
        l[a[i]] = i;
    }   
    int lim = -1;
    for (int i = 1; i <= n; ++i) {
        if (lim != -1 && i < lim) continue;
        if (jmp[i]) {
            lim = jmp[i];
            rr.pb({i, lim});
        }
    }
    for (auto [s,e]: rr) {
        for (int i = s; i <= e; ++i) ans[i] = a[s];
    }
    for (int i = 1; i <= n; ++i) {
        if (!ans[i]) ans[i] = a[i];
        cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:40:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |     for (auto [s,e]: rr) {
      |               ^

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 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 340 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 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 340 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 340 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 340 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 0 ms 212 KB Output is correct
2 Correct 0 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 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 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 340 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 22 ms 4660 KB Output is correct
18 Correct 22 ms 4684 KB Output is correct
19 Correct 22 ms 3900 KB Output is correct
20 Correct 23 ms 3992 KB Output is correct
21 Correct 22 ms 3856 KB Output is correct
22 Correct 23 ms 3976 KB Output is correct
23 Correct 22 ms 3896 KB Output is correct
24 Correct 22 ms 3920 KB Output is correct
25 Correct 22 ms 3980 KB Output is correct
26 Correct 22 ms 3880 KB Output is correct
27 Correct 22 ms 3896 KB Output is correct
28 Correct 22 ms 3948 KB Output is correct
29 Correct 21 ms 3884 KB Output is correct
30 Correct 21 ms 4684 KB Output is correct
31 Correct 21 ms 4668 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 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 340 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 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 340 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 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 340 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 340 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 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 22 ms 4660 KB Output is correct
48 Correct 22 ms 4684 KB Output is correct
49 Correct 22 ms 3900 KB Output is correct
50 Correct 23 ms 3992 KB Output is correct
51 Correct 22 ms 3856 KB Output is correct
52 Correct 23 ms 3976 KB Output is correct
53 Correct 22 ms 3896 KB Output is correct
54 Correct 22 ms 3920 KB Output is correct
55 Correct 22 ms 3980 KB Output is correct
56 Correct 22 ms 3880 KB Output is correct
57 Correct 22 ms 3896 KB Output is correct
58 Correct 22 ms 3948 KB Output is correct
59 Correct 21 ms 3884 KB Output is correct
60 Correct 21 ms 4684 KB Output is correct
61 Correct 21 ms 4668 KB Output is correct
62 Correct 31 ms 6352 KB Output is correct
63 Correct 101 ms 13348 KB Output is correct
64 Correct 108 ms 13280 KB Output is correct
65 Correct 32 ms 5364 KB Output is correct
66 Correct 31 ms 5308 KB Output is correct
67 Correct 31 ms 5532 KB Output is correct
68 Correct 32 ms 5576 KB Output is correct
69 Correct 32 ms 5276 KB Output is correct
70 Correct 32 ms 5292 KB Output is correct
71 Correct 32 ms 5260 KB Output is correct
72 Correct 32 ms 5332 KB Output is correct
73 Correct 91 ms 8780 KB Output is correct
74 Correct 91 ms 8904 KB Output is correct
75 Correct 102 ms 13168 KB Output is correct
76 Correct 101 ms 13208 KB Output is correct
77 Correct 102 ms 13132 KB Output is correct
78 Correct 102 ms 13272 KB Output is correct