oj.uz

답안 #938217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938217 2024-03-05T02:53:12 Z VinhLuu 다리 (APIO19_bridges) C++17
100 / 100
 2537 ms 72532 KB 
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e5 + 5;
const ll oo = 1e18;
const int mod = 1e9 + 7;

int n, m, q, X[N], Y[N], W[N], pa[N], sz[N], T[N], a[N], b[N];
const int block = 500;

int fin(int x){
    return x == pa[x] ? x : fin(pa[x]);
}

stack<tuple<int,int,int,int>> st;

void dsu(int x,int y){
    x = fin(x);
    y = fin(y);
    if(x == y) return;
    if(sz[x] < sz[y]) swap(x, y);
    st.push({y, pa[y], x, sz[x]});
    pa[y] = x;
    sz[x] += sz[y];
}

void undo(){
    int x, y, z, t; tie(x, y, z, t) = st.top();
    st.pop();
    pa[x] = y;
    sz[z] = t;
}

int c[N], kq[N], d[N];
vector<int> change[N];

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n >> m;
    for(int i = 1; i <= m; i ++) cin >> X[i] >> Y[i] >> W[i];
    cin >> q;
    for(int i = 1; i <= q; i ++) cin >> T[i] >> a[i] >> b[i];

    for(int l = 1; l <= q; l += block){
        int r = min(q, l + block - 1);
        for(int i = 1; i <= max(n, m); i ++) pa[i] = i, sz[i] = 1, c[i] = 0, d[i] = 0;
        vector<int> get, update;
        while(!st.empty()) st.pop();
        for(int i = l; i <= r; i ++){
            if(T[i] == 1){
                c[a[i]] = 1;
                update.pb(i);
            }else get.pb(i);
        }

        for(int i = l; i <= r; i ++){
            if(T[i] == 1){
                W[a[i]] = b[i];
            }else{
                for(auto j : update){
                    if(W[a[j]] >= b[i]) change[i].pb(a[j]);
                }
            }
        }

        sort(get.begin(), get.end(), [] (int x,int y){return b[x] > b[y];});
        vector<int> re;
        for(int i = 1; i <= m; i ++) if(!c[i]) re.pb(i);

        sort(re.begin(), re.end(), [] (int x,int y){return W[x] > W[y];});
        int ptr = 0;
        for(auto i : get){
            while(ptr < re.size() && W[re[ptr]] >= b[i]){
                dsu(X[re[ptr]], Y[re[ptr]]);
                ptr++;
            }
            int tmp = st.size();
            for(auto j : change[i]) dsu(X[j], Y[j]);
            change[i].clear();
            kq[i] = sz[fin(a[i])];
            while(st.size() > tmp) undo();
        }
    }
    for(int i = 1; i <= q; i ++) if(T[i] == 2) cout << kq[i] << "\n";
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:90:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             while(ptr < re.size() && W[re[ptr]] >= b[i]){
      |                   ~~~~^~~~~~~~~~~
bridges.cpp:98:29: warning: comparison of integer expressions of different signedness: 'std::stack<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   98 |             while(st.size() > tmp) undo();
      |                   ~~~~~~~~~~^~~~~
bridges.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 17 ms 9960 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 16 ms 10672 KB Output is correct
6 Correct 12 ms 10588 KB Output is correct
7 Correct 14 ms 10844 KB Output is correct
8 Correct 18 ms 9760 KB Output is correct
9 Correct 17 ms 13144 KB Output is correct
10 Correct 18 ms 10072 KB Output is correct
11 Correct 19 ms 10000 KB Output is correct
12 Correct 20 ms 11248 KB Output is correct
13 Correct 20 ms 10580 KB Output is correct
14 Correct 25 ms 9852 KB Output is correct
15 Correct 21 ms 10584 KB Output is correct
16 Correct 16 ms 11868 KB Output is correct
17 Correct 17 ms 11356 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1234 ms 42224 KB Output is correct
2 Correct 1258 ms 41776 KB Output is correct
3 Correct 1242 ms 42188 KB Output is correct
4 Correct 1248 ms 41904 KB Output is correct
5 Correct 1231 ms 41968 KB Output is correct
6 Correct 1315 ms 71028 KB Output is correct
7 Correct 1311 ms 72320 KB Output is correct
8 Correct 1318 ms 72532 KB Output is correct
9 Correct 41 ms 6792 KB Output is correct
10 Correct 605 ms 57772 KB Output is correct
11 Correct 612 ms 54536 KB Output is correct
12 Correct 1151 ms 32572 KB Output is correct
13 Correct 1155 ms 28356 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 831 ms 41776 KB Output is correct
2 Correct 361 ms 56296 KB Output is correct
3 Correct 851 ms 56400 KB Output is correct
4 Correct 840 ms 41348 KB Output is correct
5 Correct 25 ms 6748 KB Output is correct
6 Correct 882 ms 51456 KB Output is correct
7 Correct 801 ms 37708 KB Output is correct
8 Correct 775 ms 29376 KB Output is correct
9 Correct 733 ms 25656 KB Output is correct
10 Correct 716 ms 19996 KB Output is correct
11 Correct 716 ms 23812 KB Output is correct
12 Correct 812 ms 18656 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2334 ms 8640 KB Output is correct
2 Correct 25 ms 6744 KB Output is correct
3 Correct 244 ms 8004 KB Output is correct
4 Correct 95 ms 8012 KB Output is correct
5 Correct 1138 ms 8644 KB Output is correct
6 Correct 2355 ms 8644 KB Output is correct
7 Correct 1141 ms 8636 KB Output is correct
8 Correct 1268 ms 8208 KB Output is correct
9 Correct 1100 ms 8076 KB Output is correct
10 Correct 1158 ms 8140 KB Output is correct
11 Correct 1660 ms 8476 KB Output is correct
12 Correct 1663 ms 8480 KB Output is correct
13 Correct 1666 ms 8636 KB Output is correct
14 Correct 1006 ms 8892 KB Output is correct
15 Correct 1059 ms 8892 KB Output is correct
16 Correct 2347 ms 8660 KB Output is correct
17 Correct 2295 ms 8656 KB Output is correct
18 Correct 2253 ms 8668 KB Output is correct
19 Correct 2327 ms 8668 KB Output is correct
20 Correct 1962 ms 8796 KB Output is correct
21 Correct 1886 ms 8796 KB Output is correct
22 Correct 2254 ms 9104 KB Output is correct
23 Correct 1270 ms 8612 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1234 ms 42224 KB Output is correct
2 Correct 1258 ms 41776 KB Output is correct
3 Correct 1242 ms 42188 KB Output is correct
4 Correct 1248 ms 41904 KB Output is correct
5 Correct 1231 ms 41968 KB Output is correct
6 Correct 1315 ms 71028 KB Output is correct
7 Correct 1311 ms 72320 KB Output is correct
8 Correct 1318 ms 72532 KB Output is correct
9 Correct 41 ms 6792 KB Output is correct
10 Correct 605 ms 57772 KB Output is correct
11 Correct 612 ms 54536 KB Output is correct
12 Correct 1151 ms 32572 KB Output is correct
13 Correct 1155 ms 28356 KB Output is correct
14 Correct 831 ms 41776 KB Output is correct
15 Correct 361 ms 56296 KB Output is correct
16 Correct 851 ms 56400 KB Output is correct
17 Correct 840 ms 41348 KB Output is correct
18 Correct 25 ms 6748 KB Output is correct
19 Correct 882 ms 51456 KB Output is correct
20 Correct 801 ms 37708 KB Output is correct
21 Correct 775 ms 29376 KB Output is correct
22 Correct 733 ms 25656 KB Output is correct
23 Correct 716 ms 19996 KB Output is correct
24 Correct 716 ms 23812 KB Output is correct
25 Correct 812 ms 18656 KB Output is correct
26 Correct 1216 ms 41840 KB Output is correct
27 Correct 1325 ms 57720 KB Output is correct
28 Correct 1330 ms 40968 KB Output is correct
29 Correct 1163 ms 19560 KB Output is correct
30 Correct 1326 ms 50400 KB Output is correct
31 Correct 1351 ms 51876 KB Output is correct
32 Correct 1340 ms 52028 KB Output is correct
33 Correct 1254 ms 41240 KB Output is correct
34 Correct 1290 ms 41448 KB Output is correct
35 Correct 1284 ms 41556 KB Output is correct
36 Correct 1149 ms 23372 KB Output is correct
37 Correct 1153 ms 22344 KB Output is correct
38 Correct 1155 ms 21472 KB Output is correct
39 Correct 1151 ms 14688 KB Output is correct
40 Correct 1108 ms 14412 KB Output is correct
41 Correct 1229 ms 14000 KB Output is correct
42 Correct 1077 ms 13400 KB Output is correct
43 Correct 1075 ms 13152 KB Output is correct
44 Correct 1044 ms 12980 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 17 ms 9960 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 16 ms 10672 KB Output is correct
6 Correct 12 ms 10588 KB Output is correct
7 Correct 14 ms 10844 KB Output is correct
8 Correct 18 ms 9760 KB Output is correct
9 Correct 17 ms 13144 KB Output is correct
10 Correct 18 ms 10072 KB Output is correct
11 Correct 19 ms 10000 KB Output is correct
12 Correct 20 ms 11248 KB Output is correct
13 Correct 20 ms 10580 KB Output is correct
14 Correct 25 ms 9852 KB Output is correct
15 Correct 21 ms 10584 KB Output is correct
16 Correct 16 ms 11868 KB Output is correct
17 Correct 17 ms 11356 KB Output is correct
18 Correct 1234 ms 42224 KB Output is correct
19 Correct 1258 ms 41776 KB Output is correct
20 Correct 1242 ms 42188 KB Output is correct
21 Correct 1248 ms 41904 KB Output is correct
22 Correct 1231 ms 41968 KB Output is correct
23 Correct 1315 ms 71028 KB Output is correct
24 Correct 1311 ms 72320 KB Output is correct
25 Correct 1318 ms 72532 KB Output is correct
26 Correct 41 ms 6792 KB Output is correct
27 Correct 605 ms 57772 KB Output is correct
28 Correct 612 ms 54536 KB Output is correct
29 Correct 1151 ms 32572 KB Output is correct
30 Correct 1155 ms 28356 KB Output is correct
31 Correct 831 ms 41776 KB Output is correct
32 Correct 361 ms 56296 KB Output is correct
33 Correct 851 ms 56400 KB Output is correct
34 Correct 840 ms 41348 KB Output is correct
35 Correct 25 ms 6748 KB Output is correct
36 Correct 882 ms 51456 KB Output is correct
37 Correct 801 ms 37708 KB Output is correct
38 Correct 775 ms 29376 KB Output is correct
39 Correct 733 ms 25656 KB Output is correct
40 Correct 716 ms 19996 KB Output is correct
41 Correct 716 ms 23812 KB Output is correct
42 Correct 812 ms 18656 KB Output is correct
43 Correct 2334 ms 8640 KB Output is correct
44 Correct 25 ms 6744 KB Output is correct
45 Correct 244 ms 8004 KB Output is correct
46 Correct 95 ms 8012 KB Output is correct
47 Correct 1138 ms 8644 KB Output is correct
48 Correct 2355 ms 8644 KB Output is correct
49 Correct 1141 ms 8636 KB Output is correct
50 Correct 1268 ms 8208 KB Output is correct
51 Correct 1100 ms 8076 KB Output is correct
52 Correct 1158 ms 8140 KB Output is correct
53 Correct 1660 ms 8476 KB Output is correct
54 Correct 1663 ms 8480 KB Output is correct
55 Correct 1666 ms 8636 KB Output is correct
56 Correct 1006 ms 8892 KB Output is correct
57 Correct 1059 ms 8892 KB Output is correct
58 Correct 2347 ms 8660 KB Output is correct
59 Correct 2295 ms 8656 KB Output is correct
60 Correct 2253 ms 8668 KB Output is correct
61 Correct 2327 ms 8668 KB Output is correct
62 Correct 1962 ms 8796 KB Output is correct
63 Correct 1886 ms 8796 KB Output is correct
64 Correct 2254 ms 9104 KB Output is correct
65 Correct 1270 ms 8612 KB Output is correct
66 Correct 1216 ms 41840 KB Output is correct
67 Correct 1325 ms 57720 KB Output is correct
68 Correct 1330 ms 40968 KB Output is correct
69 Correct 1163 ms 19560 KB Output is correct
70 Correct 1326 ms 50400 KB Output is correct
71 Correct 1351 ms 51876 KB Output is correct
72 Correct 1340 ms 52028 KB Output is correct
73 Correct 1254 ms 41240 KB Output is correct
74 Correct 1290 ms 41448 KB Output is correct
75 Correct 1284 ms 41556 KB Output is correct
76 Correct 1149 ms 23372 KB Output is correct
77 Correct 1153 ms 22344 KB Output is correct
78 Correct 1155 ms 21472 KB Output is correct
79 Correct 1151 ms 14688 KB Output is correct
80 Correct 1108 ms 14412 KB Output is correct
81 Correct 1229 ms 14000 KB Output is correct
82 Correct 1077 ms 13400 KB Output is correct
83 Correct 1075 ms 13152 KB Output is correct
84 Correct 1044 ms 12980 KB Output is correct
85 Correct 2529 ms 42592 KB Output is correct
86 Correct 253 ms 11424 KB Output is correct
87 Correct 105 ms 14036 KB Output is correct
88 Correct 1282 ms 49560 KB Output is correct
89 Correct 2494 ms 41796 KB Output is correct
90 Correct 1231 ms 53048 KB Output is correct
91 Correct 1391 ms 42128 KB Output is correct
92 Correct 1245 ms 41932 KB Output is correct
93 Correct 1413 ms 63836 KB Output is correct
94 Correct 1943 ms 42124 KB Output is correct
95 Correct 1835 ms 42060 KB Output is correct
96 Correct 1904 ms 64824 KB Output is correct
97 Correct 1181 ms 26204 KB Output is correct
98 Correct 1155 ms 23408 KB Output is correct
99 Correct 2523 ms 42968 KB Output is correct
100 Correct 2413 ms 42400 KB Output is correct
101 Correct 2537 ms 42612 KB Output is correct
102 Correct 2497 ms 42568 KB Output is correct
103 Correct 2069 ms 68140 KB Output is correct
104 Correct 2136 ms 68296 KB Output is correct
105 Correct 1953 ms 28852 KB Output is correct
106 Correct 1687 ms 18532 KB Output is correct
107 Correct 1946 ms 33564 KB Output is correct
108 Correct 2307 ms 60832 KB Output is correct
109 Correct 1371 ms 64156 KB Output is correct