oj.uz

답안 #741577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741577 2023-05-14T11:29:14 Z maomao90 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 77 ms 11292 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n;
int a[MAXN];
int occ[MAXN];
vii dis;
int inv[MAXN];

int p[MAXN], rnk[MAXN], rt[MAXN], col[MAXN];
void init() {
    REP (i, 1, n + 1) {
        p[i] = i;
        rnk[i] = 1;
        rt[i] = i;
    }
}
int findp(int i) {
    if (p[i] == i) {
        return i;
    }
    return p[i] = findp(p[i]);
}
bool join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    int nc = col[pa];
    if (pa == pb) {
        return 0;
    }
    if (rnk[pa] < rnk[pb]) {
        swap(pa, pb);
    }
    if (rnk[pa] == rnk[pb]) {
        rnk[pa]++;
    }
    p[pb] = pa;
    col[pa] = nc;
    mnto(rt[pa], rt[pb]);
    return 1;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> a[i];
        dis.pb({a[i], i});
    }
    sort(ALL(dis));
    int ptr = 0, prv = -1;
    for (auto [x, i] : dis) {
        if (x != prv) {
            prv = x;
            ptr++;
        }
        a[i] = ptr;
        inv[ptr] = x;
    }
    init();
    REP (i, 1, n + 1) {
        col[findp(i)] = a[i];
        if (!occ[a[i]]++) {
            continue;
        }
        cerr << i << '\n';
        while (col[findp(rt[findp(i)] - 1)] != a[i]) {
            cerr << ' ' << rt[findp(i)] << '\n';
            occ[col[findp(rt[findp(i)] - 1)]]--;
            join(i, rt[findp(i)] - 1);
        }
    }
    REP (i, 1, n + 1) {
        cout << inv[col[findp(i)]] << '\n';
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 332 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 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 344 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

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 336 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 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 37 ms 6384 KB Output is correct
18 Correct 37 ms 6468 KB Output is correct
19 Correct 47 ms 6596 KB Output is correct
20 Correct 53 ms 6516 KB Output is correct
21 Correct 46 ms 6468 KB Output is correct
22 Correct 48 ms 6380 KB Output is correct
23 Correct 51 ms 6264 KB Output is correct
24 Correct 44 ms 6412 KB Output is correct
25 Correct 48 ms 6324 KB Output is correct
26 Correct 48 ms 6400 KB Output is correct
27 Correct 46 ms 6468 KB Output is correct
28 Correct 44 ms 6416 KB Output is correct
29 Correct 37 ms 6268 KB Output is correct
30 Correct 34 ms 6236 KB Output is correct
31 Correct 32 ms 6728 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 332 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 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 344 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 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 336 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 336 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 37 ms 6384 KB Output is correct
48 Correct 37 ms 6468 KB Output is correct
49 Correct 47 ms 6596 KB Output is correct
50 Correct 53 ms 6516 KB Output is correct
51 Correct 46 ms 6468 KB Output is correct
52 Correct 48 ms 6380 KB Output is correct
53 Correct 51 ms 6264 KB Output is correct
54 Correct 44 ms 6412 KB Output is correct
55 Correct 48 ms 6324 KB Output is correct
56 Correct 48 ms 6400 KB Output is correct
57 Correct 46 ms 6468 KB Output is correct
58 Correct 44 ms 6416 KB Output is correct
59 Correct 37 ms 6268 KB Output is correct
60 Correct 34 ms 6236 KB Output is correct
61 Correct 32 ms 6728 KB Output is correct
62 Correct 48 ms 8592 KB Output is correct
63 Correct 75 ms 10272 KB Output is correct
64 Correct 66 ms 10932 KB Output is correct
65 Correct 63 ms 8152 KB Output is correct
66 Correct 62 ms 8344 KB Output is correct
67 Correct 63 ms 9500 KB Output is correct
68 Correct 72 ms 8292 KB Output is correct
69 Correct 59 ms 8184 KB Output is correct
70 Correct 58 ms 9596 KB Output is correct
71 Correct 62 ms 9556 KB Output is correct
72 Correct 63 ms 8584 KB Output is correct
73 Correct 72 ms 10188 KB Output is correct
74 Correct 63 ms 10360 KB Output is correct
75 Correct 59 ms 10728 KB Output is correct
76 Correct 77 ms 11280 KB Output is correct
77 Correct 60 ms 11292 KB Output is correct
78 Correct 72 ms 9796 KB Output is correct