oj.uz

답안 #596923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596923 2022-07-15T09:24:35 Z 이동현(#8450) Reconstruction Project (JOI22_reconstruction) C++17
70 / 100
 5000 ms 16240 KB 
#include <bits/stdc++.h>
#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:2: warning: ignoring '#pragma GCC optimize9' [-Wunknown-pragmas]
    2 | #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 1 ms 3412 KB Output is correct
11 Correct 2 ms 3368 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 1 ms 3412 KB Output is correct
11 Correct 2 ms 3368 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 1689 ms 7460 KB Output is correct
21 Correct 805 ms 7348 KB Output is correct
22 Correct 790 ms 7348 KB Output is correct
23 Correct 902 ms 7352 KB Output is correct
24 Correct 1245 ms 7348 KB Output is correct
25 Correct 1617 ms 7376 KB Output is correct
26 Correct 1678 ms 7352 KB Output is correct
27 Correct 1707 ms 7348 KB Output is correct
28 Correct 1636 ms 7348 KB Output is correct
29 Correct 872 ms 7384 KB Output is correct
30 Correct 1659 ms 7372 KB Output is correct
31 Correct 1713 ms 7348 KB Output is correct
32 Correct 1679 ms 7344 KB Output is correct
33 Correct 1653 ms 7344 KB Output is correct
34 Correct 1119 ms 7344 KB Output is correct
35 Correct 1711 ms 7348 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Execution timed out 5061 ms 12980 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 1 ms 3412 KB Output is correct
11 Correct 2 ms 3368 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 3502 ms 15772 KB Output is correct
21 Correct 3750 ms 15868 KB Output is correct
22 Correct 3551 ms 15684 KB Output is correct
23 Correct 3461 ms 15728 KB Output is correct
24 Correct 3500 ms 15928 KB Output is correct
25 Correct 3472 ms 15816 KB Output is correct
26 Correct 3448 ms 15876 KB Output is correct
27 Correct 2571 ms 15736 KB Output is correct
28 Correct 3574 ms 15840 KB Output is correct
29 Correct 3569 ms 15748 KB Output is correct
30 Correct 3367 ms 15796 KB Output is correct
31 Correct 3580 ms 15780 KB Output is correct
32 Correct 2293 ms 16240 KB Output is correct
33 Correct 3875 ms 15552 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 1 ms 3412 KB Output is correct
11 Correct 2 ms 3368 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 1689 ms 7460 KB Output is correct
21 Correct 805 ms 7348 KB Output is correct
22 Correct 790 ms 7348 KB Output is correct
23 Correct 902 ms 7352 KB Output is correct
24 Correct 1245 ms 7348 KB Output is correct
25 Correct 1617 ms 7376 KB Output is correct
26 Correct 1678 ms 7352 KB Output is correct
27 Correct 1707 ms 7348 KB Output is correct
28 Correct 1636 ms 7348 KB Output is correct
29 Correct 872 ms 7384 KB Output is correct
30 Correct 1659 ms 7372 KB Output is correct
31 Correct 1713 ms 7348 KB Output is correct
32 Correct 1679 ms 7344 KB Output is correct
33 Correct 1653 ms 7344 KB Output is correct
34 Correct 1119 ms 7344 KB Output is correct
35 Correct 1711 ms 7348 KB Output is correct
36 Correct 1861 ms 7604 KB Output is correct
37 Correct 1010 ms 7568 KB Output is correct
38 Correct 1016 ms 7648 KB Output is correct
39 Correct 1162 ms 7656 KB Output is correct
40 Correct 1484 ms 7444 KB Output is correct
41 Correct 1827 ms 7472 KB Output is correct
42 Correct 1924 ms 7604 KB Output is correct
43 Correct 1881 ms 7548 KB Output is correct
44 Correct 1738 ms 7496 KB Output is correct
45 Correct 945 ms 7476 KB Output is correct
46 Correct 1896 ms 7476 KB Output is correct
47 Correct 1946 ms 7508 KB Output is correct
48 Correct 2009 ms 7492 KB Output is correct
49 Correct 1985 ms 7480 KB Output is correct
50 Correct 1155 ms 7608 KB Output is correct
51 Correct 1927 ms 7480 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 1 ms 3412 KB Output is correct
11 Correct 2 ms 3368 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 1689 ms 7460 KB Output is correct
21 Correct 805 ms 7348 KB Output is correct
22 Correct 790 ms 7348 KB Output is correct
23 Correct 902 ms 7352 KB Output is correct
24 Correct 1245 ms 7348 KB Output is correct
25 Correct 1617 ms 7376 KB Output is correct
26 Correct 1678 ms 7352 KB Output is correct
27 Correct 1707 ms 7348 KB Output is correct
28 Correct 1636 ms 7348 KB Output is correct
29 Correct 872 ms 7384 KB Output is correct
30 Correct 1659 ms 7372 KB Output is correct
31 Correct 1713 ms 7348 KB Output is correct
32 Correct 1679 ms 7344 KB Output is correct
33 Correct 1653 ms 7344 KB Output is correct
34 Correct 1119 ms 7344 KB Output is correct
35 Correct 1711 ms 7348 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct
37 Correct 3 ms 3412 KB Output is correct
38 Correct 2 ms 3412 KB Output is correct
39 Execution timed out 5061 ms 12980 KB Time limit exceeded
40 Halted 0 ms 0 KB -