oj.uz

답안 #596895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596895 2022-07-15T08:55:40 Z 이동현(#8450) Reconstruction Project (JOI22_reconstruction) C++17
70 / 100
 5000 ms 16272 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]));
}

inline bool unite(int x, int y){
    x = fd(x), y = fd(y);
    if(x == y) return false;
    pr[y] = x;
    return true;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    memset(lev, -1, sizeof(lev)), memset(rev, -1, sizeof(rev));
    cin >> n >> m;
    for(int i = 0; i < m; ++i){
        way[i].resize(3);
        cin >> way[i][1] >> way[i][2] >> way[i][0];
        l[i] = -1, r[i] = m;
    }
    sort(way, way + m);
    for(int i = 0; i < m; ++i){
        for(int i = 1; i <= n; ++i){
            pr[i] = i;
        }
        unite(way[i][1], way[i][2]);
        int pos = lstN;
        while(pos){
            if(!unite(way[lst[pos]][1], way[lst[pos]][2])){
                break;
            }
            --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;
        }
        unite(way[i][1], way[i][2]);
        int pos = rstN;
        while(pos){
            if(!unite(way[rst[pos]][1], way[rst[pos]][2])){
                break;
            }
            --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;
        }
    }
    cin >> q;
    int rp = 0;
    while(q--){
        int x; cin >> x;
        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 3420 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 3 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 3420 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 3 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 1716 ms 7356 KB Output is correct
21 Correct 793 ms 7296 KB Output is correct
22 Correct 799 ms 7356 KB Output is correct
23 Correct 925 ms 7352 KB Output is correct
24 Correct 1265 ms 7356 KB Output is correct
25 Correct 1642 ms 7352 KB Output is correct
26 Correct 1690 ms 7352 KB Output is correct
27 Correct 1693 ms 7348 KB Output is correct
28 Correct 1699 ms 7348 KB Output is correct
29 Correct 621 ms 7344 KB Output is correct
30 Correct 1654 ms 7352 KB Output is correct
31 Correct 1729 ms 7368 KB Output is correct
32 Correct 1690 ms 7344 KB Output is correct
33 Correct 1692 ms 7364 KB Output is correct
34 Correct 817 ms 7388 KB Output is correct
35 Correct 1685 ms 7352 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 5089 ms 13720 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 3420 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 3 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 3280 ms 15672 KB Output is correct
21 Correct 3165 ms 16040 KB Output is correct
22 Correct 3312 ms 15844 KB Output is correct
23 Correct 3321 ms 16036 KB Output is correct
24 Correct 3324 ms 15800 KB Output is correct
25 Correct 3321 ms 15644 KB Output is correct
26 Correct 3319 ms 15740 KB Output is correct
27 Correct 2603 ms 15924 KB Output is correct
28 Correct 3419 ms 15684 KB Output is correct
29 Correct 3402 ms 15884 KB Output is correct
30 Correct 3198 ms 15848 KB Output is correct
31 Correct 3388 ms 15676 KB Output is correct
32 Correct 2564 ms 16272 KB Output is correct
33 Correct 3648 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 3420 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 3 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 1716 ms 7356 KB Output is correct
21 Correct 793 ms 7296 KB Output is correct
22 Correct 799 ms 7356 KB Output is correct
23 Correct 925 ms 7352 KB Output is correct
24 Correct 1265 ms 7356 KB Output is correct
25 Correct 1642 ms 7352 KB Output is correct
26 Correct 1690 ms 7352 KB Output is correct
27 Correct 1693 ms 7348 KB Output is correct
28 Correct 1699 ms 7348 KB Output is correct
29 Correct 621 ms 7344 KB Output is correct
30 Correct 1654 ms 7352 KB Output is correct
31 Correct 1729 ms 7368 KB Output is correct
32 Correct 1690 ms 7344 KB Output is correct
33 Correct 1692 ms 7364 KB Output is correct
34 Correct 817 ms 7388 KB Output is correct
35 Correct 1685 ms 7352 KB Output is correct
36 Correct 1905 ms 7536 KB Output is correct
37 Correct 975 ms 7500 KB Output is correct
38 Correct 1004 ms 7644 KB Output is correct
39 Correct 1182 ms 7484 KB Output is correct
40 Correct 1448 ms 7480 KB Output is correct
41 Correct 1791 ms 7548 KB Output is correct
42 Correct 1878 ms 7500 KB Output is correct
43 Correct 1873 ms 7480 KB Output is correct
44 Correct 1780 ms 7480 KB Output is correct
45 Correct 634 ms 7560 KB Output is correct
46 Correct 1827 ms 7632 KB Output is correct
47 Correct 1872 ms 7452 KB Output is correct
48 Correct 1844 ms 7476 KB Output is correct
49 Correct 1832 ms 7480 KB Output is correct
50 Correct 839 ms 7608 KB Output is correct
51 Correct 1816 ms 7476 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 3420 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 3 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 1716 ms 7356 KB Output is correct
21 Correct 793 ms 7296 KB Output is correct
22 Correct 799 ms 7356 KB Output is correct
23 Correct 925 ms 7352 KB Output is correct
24 Correct 1265 ms 7356 KB Output is correct
25 Correct 1642 ms 7352 KB Output is correct
26 Correct 1690 ms 7352 KB Output is correct
27 Correct 1693 ms 7348 KB Output is correct
28 Correct 1699 ms 7348 KB Output is correct
29 Correct 621 ms 7344 KB Output is correct
30 Correct 1654 ms 7352 KB Output is correct
31 Correct 1729 ms 7368 KB Output is correct
32 Correct 1690 ms 7344 KB Output is correct
33 Correct 1692 ms 7364 KB Output is correct
34 Correct 817 ms 7388 KB Output is correct
35 Correct 1685 ms 7352 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 5089 ms 13720 KB Time limit exceeded
40 Halted 0 ms 0 KB -