oj.uz

Submission #915644

# Submission time Handle Problem Language Result Execution time Memory
915644 2024-01-24T12:42:39 Z berr Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 158 ms 34220 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int mod = 1e9+7;

struct dsu{
    int n;
    vector<int> p;

    dsu(int _n){
        n = _n;
        p.resize(n);
        iota(p.begin(), p.end(), 0);
    }

    int find(int x){
        if(p[x]==x) return x;
        return p[x] = find(p[x]);
    }

    void merge(int x, int y){
        x= find(x); y = find(y);
        if(x==y) return;
        if(x>y) swap(x, y);
        p[y] = x;
    }
};

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
 
    int n; cin >> n;
    vector<int> a(n), t;

    map<int, int> mp;

    for(auto &i: a) cin >> i;

    for(int i=0; i<n; i++){
        if(!mp.count(a[i])){
            mp[a[i]] = t.size(); 
            t.push_back(a[i]);
        }
        a[i] = mp[a[i]];
    }

    dsu d(n);
    vector<vector<int>> g(t.size()+1);

    vector<int> s;

    for(int i=0; i<n; i++){

        if(g[a[i]].size()==0){
            s.push_back(i);

            g[a[i]].push_back(i);
        }
        else{
            while(s.size()&&s.back() > g[a[i]].back()){
                g[a[d.find(s.back())]].pop_back();

                d.merge(g[a[i]].back(), s.back());
                s.pop_back();
            }
            g[a[i]].push_back(i);
            s.push_back(i);
        }
    }

    for(int i=0; i<n; i++) cout<<t[a[d.find(i)]]<<"\n";


}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 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 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 488 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 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 22 ms 7604 KB Output is correct
18 Correct 22 ms 7468 KB Output is correct
19 Correct 29 ms 6180 KB Output is correct
20 Correct 24 ms 5848 KB Output is correct
21 Correct 25 ms 5964 KB Output is correct
22 Correct 25 ms 6088 KB Output is correct
23 Correct 26 ms 5896 KB Output is correct
24 Correct 25 ms 5980 KB Output is correct
25 Correct 30 ms 6332 KB Output is correct
26 Correct 24 ms 6032 KB Output is correct
27 Correct 25 ms 6000 KB Output is correct
28 Correct 26 ms 6088 KB Output is correct
29 Correct 23 ms 6076 KB Output is correct
30 Correct 25 ms 7612 KB Output is correct
31 Correct 22 ms 7612 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 1 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 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 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 488 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 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 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 1 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 22 ms 7604 KB Output is correct
48 Correct 22 ms 7468 KB Output is correct
49 Correct 29 ms 6180 KB Output is correct
50 Correct 24 ms 5848 KB Output is correct
51 Correct 25 ms 5964 KB Output is correct
52 Correct 25 ms 6088 KB Output is correct
53 Correct 26 ms 5896 KB Output is correct
54 Correct 25 ms 5980 KB Output is correct
55 Correct 30 ms 6332 KB Output is correct
56 Correct 24 ms 6032 KB Output is correct
57 Correct 25 ms 6000 KB Output is correct
58 Correct 26 ms 6088 KB Output is correct
59 Correct 23 ms 6076 KB Output is correct
60 Correct 25 ms 7612 KB Output is correct
61 Correct 22 ms 7612 KB Output is correct
62 Correct 32 ms 10676 KB Output is correct
63 Correct 155 ms 32964 KB Output is correct
64 Correct 158 ms 33216 KB Output is correct
65 Correct 38 ms 9012 KB Output is correct
66 Correct 34 ms 8716 KB Output is correct
67 Correct 35 ms 9056 KB Output is correct
68 Correct 35 ms 9068 KB Output is correct
69 Correct 37 ms 8552 KB Output is correct
70 Correct 36 ms 8636 KB Output is correct
71 Correct 36 ms 8584 KB Output is correct
72 Correct 35 ms 8632 KB Output is correct
73 Correct 116 ms 20588 KB Output is correct
74 Correct 109 ms 20772 KB Output is correct
75 Correct 151 ms 33928 KB Output is correct
76 Correct 148 ms 34048 KB Output is correct
77 Correct 142 ms 33988 KB Output is correct
78 Correct 158 ms 34220 KB Output is correct