oj.uz

Submission #774669

# Submission time Handle Problem Language Result Execution time Memory
774669 2023-07-06T01:37:43 Z adaawf Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 392 ms 16692 KB 
#include <iostream>
#include <map>
using namespace std;
int a[200005], t[1000005], lazy[1000005];
map<int, int> c;
void push(int v) {
    if (lazy[v] != 0) {
        t[v * 2] = t[v * 2 + 1] = lazy[v];
        lazy[v * 2] = lazy[v * 2 + 1] = lazy[v];
        lazy[v] = 0;
    }
}
void update(int v, int tl, int tr, int l, int r, int x) {
    if (l > r) return;
    if (tl == l && tr == r) {
        t[v] = x;
        lazy[v] = x;
        return;
    }
    push(v);
    int mid = (tl + tr) / 2;
    update(v * 2, tl, mid, l, min(r, mid), x);
    update(v * 2 + 1, mid + 1, tr, max(l, mid + 1), r, x);
}
int sum(int v, int tl, int tr, int x) {
    if (tl == tr) {
        return t[v];
    }
    push(v);
    int mid = (tl + tr) / 2;
    if (mid >= x) return sum(v * 2, tl, mid, x);
    return sum(v * 2 + 1, mid + 1, tr, x);
}
int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        int k;
        if (c[a[i]] != 0) k = sum(1, 1, n, c[a[i]]);
        if (c[a[i]] == 0 || (k != a[i] && k != 0)) c[a[i]] = i;
        else {
            int h = c[a[i]];
            c[a[i]] = i;
            update(1, 1, n, h, i, a[i]);
        }
    }
    for (int i = 1; i <= n; i++) {
        int k = sum(1, 1, n, i);
        if (k == 0) k = a[i];
        cout << k << endl;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:41:26: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |         if (c[a[i]] == 0 || (k != a[i] && k != 0)) c[a[i]] = i;

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 308 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 5 ms 308 KB Output is correct
13 Correct 3 ms 352 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 5 ms 308 KB Output is correct
16 Correct 4 ms 324 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 4 ms 456 KB Output is correct
19 Correct 4 ms 392 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 372 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 4 ms 396 KB Output is correct
26 Correct 4 ms 392 KB Output is correct
27 Correct 5 ms 352 KB Output is correct
28 Correct 3 ms 352 KB Output is correct
29 Correct 5 ms 352 KB Output is correct
30 Correct 4 ms 352 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 4 ms 352 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 3 ms 352 KB Output is correct
10 Correct 3 ms 352 KB Output is correct
11 Correct 4 ms 352 KB Output is correct
12 Correct 3 ms 352 KB Output is correct
13 Correct 3 ms 352 KB Output is correct
14 Correct 3 ms 324 KB Output is correct
15 Correct 4 ms 316 KB Output is correct
16 Correct 4 ms 352 KB Output is correct
17 Correct 334 ms 4852 KB Output is correct
18 Correct 316 ms 4944 KB Output is correct
19 Correct 284 ms 5708 KB Output is correct
20 Correct 279 ms 5716 KB Output is correct
21 Correct 264 ms 5700 KB Output is correct
22 Correct 303 ms 5796 KB Output is correct
23 Correct 282 ms 5668 KB Output is correct
24 Correct 276 ms 5784 KB Output is correct
25 Correct 261 ms 5688 KB Output is correct
26 Correct 310 ms 5720 KB Output is correct
27 Correct 267 ms 5696 KB Output is correct
28 Correct 258 ms 5788 KB Output is correct
29 Correct 263 ms 5460 KB Output is correct
30 Correct 263 ms 4836 KB Output is correct
31 Correct 258 ms 4920 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 308 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 5 ms 308 KB Output is correct
13 Correct 3 ms 352 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 5 ms 308 KB Output is correct
16 Correct 4 ms 324 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 4 ms 456 KB Output is correct
19 Correct 4 ms 392 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 372 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 4 ms 396 KB Output is correct
26 Correct 4 ms 392 KB Output is correct
27 Correct 5 ms 352 KB Output is correct
28 Correct 3 ms 352 KB Output is correct
29 Correct 5 ms 352 KB Output is correct
30 Correct 4 ms 352 KB Output is correct
31 Correct 1 ms 224 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 0 ms 224 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 4 ms 352 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 224 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 3 ms 352 KB Output is correct
40 Correct 3 ms 352 KB Output is correct
41 Correct 4 ms 352 KB Output is correct
42 Correct 3 ms 352 KB Output is correct
43 Correct 3 ms 352 KB Output is correct
44 Correct 3 ms 324 KB Output is correct
45 Correct 4 ms 316 KB Output is correct
46 Correct 4 ms 352 KB Output is correct
47 Correct 334 ms 4852 KB Output is correct
48 Correct 316 ms 4944 KB Output is correct
49 Correct 284 ms 5708 KB Output is correct
50 Correct 279 ms 5716 KB Output is correct
51 Correct 264 ms 5700 KB Output is correct
52 Correct 303 ms 5796 KB Output is correct
53 Correct 282 ms 5668 KB Output is correct
54 Correct 276 ms 5784 KB Output is correct
55 Correct 261 ms 5688 KB Output is correct
56 Correct 310 ms 5720 KB Output is correct
57 Correct 267 ms 5696 KB Output is correct
58 Correct 258 ms 5788 KB Output is correct
59 Correct 263 ms 5460 KB Output is correct
60 Correct 263 ms 4836 KB Output is correct
61 Correct 258 ms 4920 KB Output is correct
62 Correct 307 ms 6696 KB Output is correct
63 Correct 379 ms 16692 KB Output is correct
64 Correct 376 ms 16392 KB Output is correct
65 Correct 298 ms 6920 KB Output is correct
66 Correct 330 ms 6892 KB Output is correct
67 Correct 314 ms 7248 KB Output is correct
68 Correct 351 ms 7100 KB Output is correct
69 Correct 311 ms 7228 KB Output is correct
70 Correct 306 ms 7032 KB Output is correct
71 Correct 358 ms 7064 KB Output is correct
72 Correct 298 ms 6992 KB Output is correct
73 Correct 381 ms 9960 KB Output is correct
74 Correct 392 ms 11852 KB Output is correct
75 Correct 380 ms 12552 KB Output is correct
76 Correct 384 ms 16528 KB Output is correct
77 Correct 380 ms 12464 KB Output is correct
78 Correct 392 ms 12364 KB Output is correct