oj.uz

Submission #1001635

# Submission time Handle Problem Language Result Execution time Memory
1001635 2024-06-19T06:39:33 Z Br3ad Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 504 ms 161620 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define PF push_front
#define PB push_back
#define MP make_pair
#define max(a, b) ((a > b)? a : b)
#define min(a, b) ((a < b)? a : b)
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)

const int N = 2e5 + 5;
const int M = 1e9 + 7; 
const int inf = 0x3f3f3f3f;
const ll int INF = 1e18;

struct DSU {
    vector<int> parent;

    DSU(int n){
        parent = vector<int>(n);
        iota(parent.begin(), parent.end(), 0);
    }

    int find_parent(int p){
        return (parent[p] == p)? p : parent[p] = find_parent(parent[p]);
    }

    int merge(int a, int b){
        a = find_parent(a);
        b = find_parent(b);
        if(a > b) swap(a, b);
        return parent[a] = b;
    }
};

int main(){
    
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    // ifstream cin();
    // ofstream cout();
    
    int n;
    cin >> n;

    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    // Coordinate compression
    map<int, int> idx;
    set<int> temp;
    for(int i = 0; i < n; i++) temp.insert(a[i]);

    int ind = 0;
    for(int i : temp){
        idx[i] = ind++;
    }

    // Solve
    DSU dsu(n);
    vector<stack<int>> v(N, stack<int>());
    for(int i = 0; i < n; i++){
        int cur = idx[a[i]];
        while(!v[cur].empty()){
            int prev = v[cur].top();
            v[cur].pop();

            if(dsu.find_parent(prev) == prev){
                int temp = prev;
                while(temp != i){
                    temp = dsu.merge(temp, temp+1);
                }
                break;
            }
        }

        v[cur].push(i);
    }

    // Output
    for(int i = 0; i < n; i++){
        cout << a[dsu.find_parent(i)] << endl;
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 134992 KB Output is correct
2 Correct 55 ms 134992 KB Output is correct
3 Correct 52 ms 134996 KB Output is correct
4 Correct 54 ms 134992 KB Output is correct
5 Correct 60 ms 134996 KB Output is correct
6 Correct 60 ms 135020 KB Output is correct
7 Correct 53 ms 135036 KB Output is correct
8 Correct 53 ms 135056 KB Output is correct
9 Correct 50 ms 135068 KB Output is correct
10 Correct 70 ms 135052 KB Output is correct
11 Correct 67 ms 134996 KB Output is correct
12 Correct 68 ms 135056 KB Output is correct
13 Correct 66 ms 135092 KB Output is correct
14 Correct 65 ms 135096 KB Output is correct
15 Correct 61 ms 135068 KB Output is correct
16 Correct 67 ms 135072 KB Output is correct
17 Correct 68 ms 135224 KB Output is correct
18 Correct 62 ms 135232 KB Output is correct
19 Correct 64 ms 135024 KB Output is correct
20 Correct 69 ms 134992 KB Output is correct
21 Correct 61 ms 135040 KB Output is correct
22 Correct 67 ms 135016 KB Output is correct
23 Correct 60 ms 134996 KB Output is correct
24 Correct 64 ms 134996 KB Output is correct
25 Correct 77 ms 135024 KB Output is correct
26 Correct 79 ms 135132 KB Output is correct
27 Correct 64 ms 134992 KB Output is correct
28 Correct 63 ms 134996 KB Output is correct
29 Correct 60 ms 135068 KB Output is correct
30 Correct 63 ms 135004 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 135084 KB Output is correct
2 Correct 60 ms 134912 KB Output is correct
3 Correct 54 ms 135004 KB Output is correct
4 Correct 63 ms 134996 KB Output is correct
5 Correct 63 ms 134996 KB Output is correct
6 Correct 52 ms 134984 KB Output is correct
7 Correct 73 ms 134856 KB Output is correct
8 Correct 61 ms 134996 KB Output is correct
9 Correct 65 ms 134996 KB Output is correct
10 Correct 84 ms 134996 KB Output is correct
11 Correct 66 ms 135004 KB Output is correct
12 Correct 59 ms 134992 KB Output is correct
13 Correct 89 ms 134952 KB Output is correct
14 Correct 89 ms 135108 KB Output is correct
15 Correct 65 ms 135088 KB Output is correct
16 Correct 64 ms 134992 KB Output is correct
17 Correct 295 ms 139552 KB Output is correct
18 Correct 297 ms 139768 KB Output is correct
19 Correct 309 ms 138580 KB Output is correct
20 Correct 293 ms 138456 KB Output is correct
21 Correct 307 ms 138508 KB Output is correct
22 Correct 278 ms 138592 KB Output is correct
23 Correct 321 ms 138580 KB Output is correct
24 Correct 251 ms 138440 KB Output is correct
25 Correct 266 ms 138640 KB Output is correct
26 Correct 294 ms 138576 KB Output is correct
27 Correct 272 ms 138580 KB Output is correct
28 Correct 265 ms 138576 KB Output is correct
29 Correct 258 ms 139628 KB Output is correct
30 Correct 264 ms 139600 KB Output is correct
31 Correct 341 ms 139600 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 134992 KB Output is correct
2 Correct 55 ms 134992 KB Output is correct
3 Correct 52 ms 134996 KB Output is correct
4 Correct 54 ms 134992 KB Output is correct
5 Correct 60 ms 134996 KB Output is correct
6 Correct 60 ms 135020 KB Output is correct
7 Correct 53 ms 135036 KB Output is correct
8 Correct 53 ms 135056 KB Output is correct
9 Correct 50 ms 135068 KB Output is correct
10 Correct 70 ms 135052 KB Output is correct
11 Correct 67 ms 134996 KB Output is correct
12 Correct 68 ms 135056 KB Output is correct
13 Correct 66 ms 135092 KB Output is correct
14 Correct 65 ms 135096 KB Output is correct
15 Correct 61 ms 135068 KB Output is correct
16 Correct 67 ms 135072 KB Output is correct
17 Correct 68 ms 135224 KB Output is correct
18 Correct 62 ms 135232 KB Output is correct
19 Correct 64 ms 135024 KB Output is correct
20 Correct 69 ms 134992 KB Output is correct
21 Correct 61 ms 135040 KB Output is correct
22 Correct 67 ms 135016 KB Output is correct
23 Correct 60 ms 134996 KB Output is correct
24 Correct 64 ms 134996 KB Output is correct
25 Correct 77 ms 135024 KB Output is correct
26 Correct 79 ms 135132 KB Output is correct
27 Correct 64 ms 134992 KB Output is correct
28 Correct 63 ms 134996 KB Output is correct
29 Correct 60 ms 135068 KB Output is correct
30 Correct 63 ms 135004 KB Output is correct
31 Correct 68 ms 135084 KB Output is correct
32 Correct 60 ms 134912 KB Output is correct
33 Correct 54 ms 135004 KB Output is correct
34 Correct 63 ms 134996 KB Output is correct
35 Correct 63 ms 134996 KB Output is correct
36 Correct 52 ms 134984 KB Output is correct
37 Correct 73 ms 134856 KB Output is correct
38 Correct 61 ms 134996 KB Output is correct
39 Correct 65 ms 134996 KB Output is correct
40 Correct 84 ms 134996 KB Output is correct
41 Correct 66 ms 135004 KB Output is correct
42 Correct 59 ms 134992 KB Output is correct
43 Correct 89 ms 134952 KB Output is correct
44 Correct 89 ms 135108 KB Output is correct
45 Correct 65 ms 135088 KB Output is correct
46 Correct 64 ms 134992 KB Output is correct
47 Correct 295 ms 139552 KB Output is correct
48 Correct 297 ms 139768 KB Output is correct
49 Correct 309 ms 138580 KB Output is correct
50 Correct 293 ms 138456 KB Output is correct
51 Correct 307 ms 138508 KB Output is correct
52 Correct 278 ms 138592 KB Output is correct
53 Correct 321 ms 138580 KB Output is correct
54 Correct 251 ms 138440 KB Output is correct
55 Correct 266 ms 138640 KB Output is correct
56 Correct 294 ms 138576 KB Output is correct
57 Correct 272 ms 138580 KB Output is correct
58 Correct 265 ms 138576 KB Output is correct
59 Correct 258 ms 139628 KB Output is correct
60 Correct 264 ms 139600 KB Output is correct
61 Correct 341 ms 139600 KB Output is correct
62 Correct 289 ms 142936 KB Output is correct
63 Correct 417 ms 160112 KB Output is correct
64 Correct 462 ms 159676 KB Output is correct
65 Correct 273 ms 141452 KB Output is correct
66 Correct 275 ms 141396 KB Output is correct
67 Correct 266 ms 141652 KB Output is correct
68 Correct 249 ms 141652 KB Output is correct
69 Correct 257 ms 141136 KB Output is correct
70 Correct 284 ms 141244 KB Output is correct
71 Correct 269 ms 141212 KB Output is correct
72 Correct 271 ms 141128 KB Output is correct
73 Correct 380 ms 150868 KB Output is correct
74 Correct 416 ms 149936 KB Output is correct
75 Correct 504 ms 159292 KB Output is correct
76 Correct 437 ms 161620 KB Output is correct
77 Correct 447 ms 159156 KB Output is correct
78 Correct 411 ms 159316 KB Output is correct