oj.uz

Submission #942384

# Submission time Handle Problem Language Result Execution time Memory
942384 2024-03-10T14:44:14 Z tnknguyen_ Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 441 ms 687740 KB 
/**
 * @file main.cpp
 * @author tnknguyen_ ([email protected])
 * @date 07-03-2024
 * 
 * @copyright Copyright (c) 2024
 * https://oj.uz/problem/view/JOI23_ho_t1
 */
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' 

const int sz = 1e6 + 5;
vector<int> b;
stack<int> pos[sz];
int a[sz], ans[sz];

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

    //freopen("main.inp","r",stdin);
    //freopen("main.out","w",stdout);

    int n;
    cin>>n;
    
    for(int i=1;i<=n;++i){
        cin>>a[i];
        b.push_back(a[i]);
    }

    sort(b.begin(), b.end());
    b.erase(unique(b.begin(), b.end()), b.end());
    for(int i=1;i<=n;++i){
        a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin() + 1;
    }

    stack<int> st;
    for(int i=1;i<=n;++i){
        while(pos[a[i]].size() && st.size() && st.top() > pos[a[i]].top()){
            pos[a[st.top()]].pop();
            st.pop();
        }
        st.push(i);
        pos[a[i]].push(i);
    }

    while(st.size()){
        ans[st.top()] = a[st.top()];
        st.pop();
    }

    int val = a[1];
    for(int i=1;i<=n;++i){
        if(ans[i]){
            val = b[ans[i] - 1];
        }
        cout<<val<<endl;
    }

    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 676948 KB Output is correct
2 Correct 366 ms 676948 KB Output is correct
3 Correct 325 ms 677172 KB Output is correct
4 Correct 329 ms 677232 KB Output is correct
5 Correct 334 ms 677116 KB Output is correct
6 Correct 323 ms 677008 KB Output is correct
7 Correct 378 ms 676992 KB Output is correct
8 Correct 357 ms 677172 KB Output is correct
9 Correct 335 ms 676944 KB Output is correct
10 Correct 331 ms 677200 KB Output is correct
11 Correct 324 ms 677204 KB Output is correct
12 Correct 325 ms 677200 KB Output is correct
13 Correct 346 ms 677216 KB Output is correct
14 Correct 321 ms 677208 KB Output is correct
15 Correct 335 ms 677204 KB Output is correct
16 Correct 325 ms 677200 KB Output is correct
17 Correct 351 ms 677200 KB Output is correct
18 Correct 327 ms 677240 KB Output is correct
19 Correct 329 ms 677056 KB Output is correct
20 Correct 327 ms 677080 KB Output is correct
21 Correct 327 ms 677276 KB Output is correct
22 Correct 326 ms 677164 KB Output is correct
23 Correct 339 ms 677312 KB Output is correct
24 Correct 333 ms 677204 KB Output is correct
25 Correct 339 ms 677080 KB Output is correct
26 Correct 320 ms 677200 KB Output is correct
27 Correct 331 ms 677176 KB Output is correct
28 Correct 321 ms 677200 KB Output is correct
29 Correct 341 ms 677024 KB Output is correct
30 Correct 324 ms 677216 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 677176 KB Output is correct
2 Correct 329 ms 676944 KB Output is correct
3 Correct 330 ms 677392 KB Output is correct
4 Correct 323 ms 677316 KB Output is correct
5 Correct 340 ms 677204 KB Output is correct
6 Correct 394 ms 676948 KB Output is correct
7 Correct 334 ms 677356 KB Output is correct
8 Correct 328 ms 676944 KB Output is correct
9 Correct 334 ms 677380 KB Output is correct
10 Correct 325 ms 677200 KB Output is correct
11 Correct 324 ms 677208 KB Output is correct
12 Correct 322 ms 677200 KB Output is correct
13 Correct 326 ms 677212 KB Output is correct
14 Correct 349 ms 677148 KB Output is correct
15 Correct 329 ms 677200 KB Output is correct
16 Correct 327 ms 677220 KB Output is correct
17 Correct 394 ms 684492 KB Output is correct
18 Correct 392 ms 684880 KB Output is correct
19 Correct 386 ms 683636 KB Output is correct
20 Correct 395 ms 683640 KB Output is correct
21 Correct 406 ms 683720 KB Output is correct
22 Correct 388 ms 683968 KB Output is correct
23 Correct 420 ms 683880 KB Output is correct
24 Correct 391 ms 683728 KB Output is correct
25 Correct 407 ms 684200 KB Output is correct
26 Correct 386 ms 683668 KB Output is correct
27 Correct 404 ms 683616 KB Output is correct
28 Correct 406 ms 684140 KB Output is correct
29 Correct 439 ms 683680 KB Output is correct
30 Correct 398 ms 684760 KB Output is correct
31 Correct 384 ms 684496 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 676948 KB Output is correct
2 Correct 366 ms 676948 KB Output is correct
3 Correct 325 ms 677172 KB Output is correct
4 Correct 329 ms 677232 KB Output is correct
5 Correct 334 ms 677116 KB Output is correct
6 Correct 323 ms 677008 KB Output is correct
7 Correct 378 ms 676992 KB Output is correct
8 Correct 357 ms 677172 KB Output is correct
9 Correct 335 ms 676944 KB Output is correct
10 Correct 331 ms 677200 KB Output is correct
11 Correct 324 ms 677204 KB Output is correct
12 Correct 325 ms 677200 KB Output is correct
13 Correct 346 ms 677216 KB Output is correct
14 Correct 321 ms 677208 KB Output is correct
15 Correct 335 ms 677204 KB Output is correct
16 Correct 325 ms 677200 KB Output is correct
17 Correct 351 ms 677200 KB Output is correct
18 Correct 327 ms 677240 KB Output is correct
19 Correct 329 ms 677056 KB Output is correct
20 Correct 327 ms 677080 KB Output is correct
21 Correct 327 ms 677276 KB Output is correct
22 Correct 326 ms 677164 KB Output is correct
23 Correct 339 ms 677312 KB Output is correct
24 Correct 333 ms 677204 KB Output is correct
25 Correct 339 ms 677080 KB Output is correct
26 Correct 320 ms 677200 KB Output is correct
27 Correct 331 ms 677176 KB Output is correct
28 Correct 321 ms 677200 KB Output is correct
29 Correct 341 ms 677024 KB Output is correct
30 Correct 324 ms 677216 KB Output is correct
31 Correct 358 ms 677176 KB Output is correct
32 Correct 329 ms 676944 KB Output is correct
33 Correct 330 ms 677392 KB Output is correct
34 Correct 323 ms 677316 KB Output is correct
35 Correct 340 ms 677204 KB Output is correct
36 Correct 394 ms 676948 KB Output is correct
37 Correct 334 ms 677356 KB Output is correct
38 Correct 328 ms 676944 KB Output is correct
39 Correct 334 ms 677380 KB Output is correct
40 Correct 325 ms 677200 KB Output is correct
41 Correct 324 ms 677208 KB Output is correct
42 Correct 322 ms 677200 KB Output is correct
43 Correct 326 ms 677212 KB Output is correct
44 Correct 349 ms 677148 KB Output is correct
45 Correct 329 ms 677200 KB Output is correct
46 Correct 327 ms 677220 KB Output is correct
47 Correct 394 ms 684492 KB Output is correct
48 Correct 392 ms 684880 KB Output is correct
49 Correct 386 ms 683636 KB Output is correct
50 Correct 395 ms 683640 KB Output is correct
51 Correct 406 ms 683720 KB Output is correct
52 Correct 388 ms 683968 KB Output is correct
53 Correct 420 ms 683880 KB Output is correct
54 Correct 391 ms 683728 KB Output is correct
55 Correct 407 ms 684200 KB Output is correct
56 Correct 386 ms 683668 KB Output is correct
57 Correct 404 ms 683616 KB Output is correct
58 Correct 406 ms 684140 KB Output is correct
59 Correct 439 ms 683680 KB Output is correct
60 Correct 398 ms 684760 KB Output is correct
61 Correct 384 ms 684496 KB Output is correct
62 Correct 399 ms 687740 KB Output is correct
63 Correct 406 ms 686296 KB Output is correct
64 Correct 404 ms 686024 KB Output is correct
65 Correct 407 ms 686656 KB Output is correct
66 Correct 420 ms 686540 KB Output is correct
67 Correct 398 ms 686816 KB Output is correct
68 Correct 408 ms 687056 KB Output is correct
69 Correct 414 ms 686536 KB Output is correct
70 Correct 404 ms 686932 KB Output is correct
71 Correct 433 ms 686624 KB Output is correct
72 Correct 412 ms 686684 KB Output is correct
73 Correct 396 ms 686284 KB Output is correct
74 Correct 405 ms 686288 KB Output is correct
75 Correct 419 ms 686820 KB Output is correct
76 Correct 406 ms 686796 KB Output is correct
77 Correct 398 ms 686784 KB Output is correct
78 Correct 400 ms 686852 KB Output is correct