oj.uz

답안 #596921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596921 2022-07-15T09:21:22 Z 이동현(#8450) Reconstruction Project (JOI22_reconstruction) C++17
70 / 100
 5000 ms 16392 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize9("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

const int MS = (int)1e5 + 4;
int n, m, q;
vector<int> way[MS];
int l[MS], r[MS];
int rst[504], rstN, lev[MS], rev[MS];
int lst[504], lstN;

int pr[504];

inline int fd(int x){
    return (x == pr[x] ? x : pr[x] = fd(pr[x]));
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    memset(lev, -1, sizeof(lev)), memset(rev, -1, sizeof(rev));
    cin >> n >> m;
    //n = 500, m = 499;
    for(int i = 0; i < m; ++i){
        way[i].resize(3);
        cin >> way[i][1] >> way[i][2] >> way[i][0];
        //way[i][1] = i + 1, way[i][2] = i + 2, way[i][0] = i + 30;
        l[i] = -1, r[i] = m;
    }
    cin >> q; //q = 1000000;
    sort(way, way + m);
    for(int i = 0; i < m; ++i){
        for(int i = 1; i <= n; ++i){
            pr[i] = i;
        }
        pr[fd(way[i][1])] = fd(way[i][2]);
        int pos = lstN;
        while(pos){
            int x = fd(way[lst[pos]][1]), y = fd(way[lst[pos]][2]);
            if(x == y){
                break;
            }
            pr[x] = y;
            --pos;
        }
        if(pos){
            lev[i] = lst[pos];
            l[i] = lev[i] + 1;
            for(int k = pos; k < lstN; ++k){
                lst[k] = lst[k + 1];
            }
            lst[lstN] = i;
        }
        else{
            l[i] = -1;
            lst[++lstN] = i;
        }
    }
    lstN = 0;
    for(int i = m - 1; i >= 0; --i){
        if(rstN >= n - 1){
            r[i] = rst[1] - 1;
        }
        for(int i = 1; i <= n; ++i){
            pr[i] = i;
        }
        pr[fd(way[i][1])] = fd(way[i][2]);
        int pos = rstN;
        while(pos){
            int x = fd(way[rst[pos]][1]), y = fd(way[rst[pos]][2]);
            if(x == y){
                break;
            }
            pr[x] = y;
            --pos;
        }
        if(pos){
            rev[i] = rst[pos];
            r[i] = rev[i] - 1;
            for(int k = pos; k < rstN; ++k){
                rst[k] = rst[k + 1];
            }
            rst[rstN] = i;
        }
        else{
            r[i] = m;
            rst[++rstN] = i;
        }
    }
    int rp = 0;
    while(q--){
        int x; cin >> x;
        //x = q + 100;
        while(rp < m && way[rp][0] < x){
            if(rev[rp] == -1){
                --rstN;
            }
            else{
                for(int i = rstN; ; --i){
                    if(i > 1 && rst[i - 1] < rev[rp]){
                        rst[i] = rst[i - 1];
                    }
                    else{
                        rst[i] = rev[rp];
                        break;
                    }
                }
            }
            if(lev[rp] == -1){
                lst[++lstN] = rp;
            }
            else{
                int pos = lower_bound(lst + 1, lst + lstN + 1, lev[rp]) - lst;
                for(int i = pos; i < lstN; ++i){
                    lst[i] = lst[i + 1];
                }
                lst[lstN] = rp;
            }
            ++rp;
        }
        int lid = lstN, rid = rstN, cnt = 0;
        lst[lid + 1] = (int)2e9, rst[rid + 1] = -100;
        long long ans = 0;
        T:
            if(lid > 0 && r[lst[lid]] < rst[rid + 1]){
                --lid; goto T;
            }
        T2:
            if(rid > 0 && l[rst[rid]] > lst[lid + 1]){
                --rid; goto T2;
            }
            if(!rid || (lid && x - way[lst[lid]][0] < way[rst[rid]][0] - x)){
                ans += x - way[lst[lid]][0];
                --lid;
            }
            else{
                ans += way[rst[rid]][0] - x;
                --rid;
            }
            ++cnt;
        if(cnt < n - 1) goto T;
        cout << ans << '\n';
    }
    return 0;
}

Compilation message

reconstruction.cpp:3: warning: ignoring '#pragma GCC optimize9' [-Wunknown-pragmas]
    3 | #pragma GCC optimize9("Ofast")
      |

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 1668 ms 7356 KB Output is correct
21 Correct 784 ms 7348 KB Output is correct
22 Correct 800 ms 7348 KB Output is correct
23 Correct 878 ms 7356 KB Output is correct
24 Correct 1258 ms 7344 KB Output is correct
25 Correct 1611 ms 7356 KB Output is correct
26 Correct 1648 ms 7352 KB Output is correct
27 Correct 1568 ms 7348 KB Output is correct
28 Correct 1669 ms 7348 KB Output is correct
29 Correct 893 ms 7372 KB Output is correct
30 Correct 1685 ms 7352 KB Output is correct
31 Correct 1650 ms 7408 KB Output is correct
32 Correct 1633 ms 7348 KB Output is correct
33 Correct 1678 ms 7352 KB Output is correct
34 Correct 1095 ms 7352 KB Output is correct
35 Correct 1648 ms 7348 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Execution timed out 5082 ms 13560 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 3308 ms 15748 KB Output is correct
21 Correct 3185 ms 15860 KB Output is correct
22 Correct 3427 ms 15716 KB Output is correct
23 Correct 3542 ms 15724 KB Output is correct
24 Correct 3449 ms 15720 KB Output is correct
25 Correct 3477 ms 15736 KB Output is correct
26 Correct 3466 ms 15644 KB Output is correct
27 Correct 2663 ms 15696 KB Output is correct
28 Correct 3579 ms 15708 KB Output is correct
29 Correct 3473 ms 15764 KB Output is correct
30 Correct 3400 ms 15656 KB Output is correct
31 Correct 3625 ms 15844 KB Output is correct
32 Correct 2613 ms 16392 KB Output is correct
33 Correct 3736 ms 15508 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 1668 ms 7356 KB Output is correct
21 Correct 784 ms 7348 KB Output is correct
22 Correct 800 ms 7348 KB Output is correct
23 Correct 878 ms 7356 KB Output is correct
24 Correct 1258 ms 7344 KB Output is correct
25 Correct 1611 ms 7356 KB Output is correct
26 Correct 1648 ms 7352 KB Output is correct
27 Correct 1568 ms 7348 KB Output is correct
28 Correct 1669 ms 7348 KB Output is correct
29 Correct 893 ms 7372 KB Output is correct
30 Correct 1685 ms 7352 KB Output is correct
31 Correct 1650 ms 7408 KB Output is correct
32 Correct 1633 ms 7348 KB Output is correct
33 Correct 1678 ms 7352 KB Output is correct
34 Correct 1095 ms 7352 KB Output is correct
35 Correct 1648 ms 7348 KB Output is correct
36 Correct 1817 ms 7652 KB Output is correct
37 Correct 946 ms 7684 KB Output is correct
38 Correct 993 ms 7500 KB Output is correct
39 Correct 1145 ms 7500 KB Output is correct
40 Correct 1427 ms 7480 KB Output is correct
41 Correct 1816 ms 7500 KB Output is correct
42 Correct 1850 ms 7704 KB Output is correct
43 Correct 1828 ms 7476 KB Output is correct
44 Correct 1746 ms 7452 KB Output is correct
45 Correct 948 ms 7528 KB Output is correct
46 Correct 1888 ms 7480 KB Output is correct
47 Correct 1862 ms 7476 KB Output is correct
48 Correct 1864 ms 7496 KB Output is correct
49 Correct 1840 ms 7480 KB Output is correct
50 Correct 1153 ms 7600 KB Output is correct
51 Correct 1782 ms 7544 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 1668 ms 7356 KB Output is correct
21 Correct 784 ms 7348 KB Output is correct
22 Correct 800 ms 7348 KB Output is correct
23 Correct 878 ms 7356 KB Output is correct
24 Correct 1258 ms 7344 KB Output is correct
25 Correct 1611 ms 7356 KB Output is correct
26 Correct 1648 ms 7352 KB Output is correct
27 Correct 1568 ms 7348 KB Output is correct
28 Correct 1669 ms 7348 KB Output is correct
29 Correct 893 ms 7372 KB Output is correct
30 Correct 1685 ms 7352 KB Output is correct
31 Correct 1650 ms 7408 KB Output is correct
32 Correct 1633 ms 7348 KB Output is correct
33 Correct 1678 ms 7352 KB Output is correct
34 Correct 1095 ms 7352 KB Output is correct
35 Correct 1648 ms 7348 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct
37 Correct 2 ms 3412 KB Output is correct
38 Correct 2 ms 3412 KB Output is correct
39 Execution timed out 5082 ms 13560 KB Time limit exceeded
40 Halted 0 ms 0 KB -