oj.uz

답안 #723187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723187 2023-04-13T10:07:46 Z Son 다리 (APIO19_bridges) C++14
100 / 100
 2665 ms 46768 KB 
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back

int n,m,q;
int U[100005], V[100005], W[100005];
int T[100005], X[100005], Y[100005];
int ans[100005];

int dsu[100005], sz[100005];
const int D = 1000;
bool changed[100005];
vector < int > to_join[100005],stck;

int rt( int a ){
    if ( dsu[a] == a ) return a;
    return rt(dsu[a]);
}

bool cmp_ask( int a, int b ){
    return Y[a] > Y[b];
}

bool cmp_unchanged( int a, int b ){
    return W[a] > W[b];
}

void merge( int a, int b ){
    a = rt(a);
    b = rt(b);
    if ( a == b ) return;
    if ( sz[a] > sz[b] ) swap(a,b);
    stck.pb(a);
    sz[b] += sz[a];
    dsu[a] = dsu[b];
}

void rollback( int prev_stack_size ){
    while ( stck.size() > prev_stack_size ) {
        int a = stck.back();
        stck.pop_back();
        sz[dsu[a]] -= sz[a];
        dsu[a] = a;
    } 
}

int main(){

    scanf("%d%d",&n,&m);
    for ( int i = 1; i <= m; i++ ){
        scanf("%d%d%d",&U[i],&V[i],&W[i]);
    }
    scanf("%d",&q);
    for ( int i = 1; i <= q; i++ ){
        scanf("%d%d%d",&T[i],&X[i],&Y[i]);
    }

    for ( int l = 1; l <= q; l += D){
        int r = min(q + 1, l + D );
        memset(changed,false,sizeof(changed));
        vector < int > upd,ask,unchanged;
        for ( int i = l; i < r; i++ ){
            if ( T[i] == 1 ) {
                changed[X[i]] = true;
                upd.pb(i);
            } else {
                ask.pb(i);  
            }
        }

        for ( int i = l; i < r; i++ ){
            to_join[i-l].clear();
            if ( T[i] == 1 ){
                W[X[i]] = Y[i];
                continue;
            }
            if ( T[i] == 2 ){
                for ( int j : upd ){
                    if ( W[X[j]] >= Y[i] ) to_join[i-l].pb(j);
                }
            }
        }

        for ( int i = 1; i <= m; i++ ){
            if ( !changed[i] ){
                unchanged.pb(i);
            }
        }

        sort(unchanged.begin(),unchanged.end(),cmp_unchanged);
        sort(ask.begin(),ask.end(),cmp_ask);

        for ( int i = 1; i <= n; i++ ){
            dsu[i] = i;
            sz[i] = 1;
        }

        int ptr = 0;
        for ( int i : ask ){
            while ( ptr < unchanged.size() && W[unchanged[ptr]] >= Y[i] ){
                merge(U[unchanged[ptr]], V[unchanged[ptr]]);
                ptr++;
            }
            int stack_size = (int)stck.size();
            for ( int j : to_join[i-l] ) merge(U[X[j]], V[X[j]]);
            ans[i] = sz[rt(X[i])];
            rollback(stack_size);
        }
    }


    for ( int i = 1; i <= q; i++ ) if ( T[i] == 2 ) printf("%d\n",ans[i]);
    return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:40:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |     while ( stck.size() > prev_stack_size ) {
      |             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:101:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |             while ( ptr < unchanged.size() && W[unchanged[ptr]] >= Y[i] ){
      |                     ~~~~^~~~~~~~~~~~~~~~~~
bridges.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
bridges.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf("%d%d%d",&U[i],&V[i],&W[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
bridges.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         scanf("%d%d%d",&T[i],&X[i],&Y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2796 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 44 ms 5168 KB Output is correct
4 Correct 7 ms 2900 KB Output is correct
5 Correct 43 ms 5308 KB Output is correct
6 Correct 38 ms 5008 KB Output is correct
7 Correct 43 ms 5936 KB Output is correct
8 Correct 49 ms 5032 KB Output is correct
9 Correct 60 ms 6652 KB Output is correct
10 Correct 44 ms 5148 KB Output is correct
11 Correct 44 ms 5024 KB Output is correct
12 Correct 53 ms 5292 KB Output is correct
13 Correct 53 ms 5152 KB Output is correct
14 Correct 51 ms 5076 KB Output is correct
15 Correct 54 ms 5168 KB Output is correct
16 Correct 53 ms 6348 KB Output is correct
17 Correct 55 ms 5864 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1629 ms 41236 KB Output is correct
2 Correct 1621 ms 41416 KB Output is correct
3 Correct 1606 ms 41232 KB Output is correct
4 Correct 1608 ms 41172 KB Output is correct
5 Correct 1599 ms 41476 KB Output is correct
6 Correct 2021 ms 42760 KB Output is correct
7 Correct 2133 ms 42644 KB Output is correct
8 Correct 2175 ms 42680 KB Output is correct
9 Correct 39 ms 4456 KB Output is correct
10 Correct 1277 ms 42920 KB Output is correct
11 Correct 1191 ms 42908 KB Output is correct
12 Correct 1399 ms 39144 KB Output is correct
13 Correct 1334 ms 42600 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1148 ms 24156 KB Output is correct
2 Correct 849 ms 12788 KB Output is correct
3 Correct 1431 ms 25944 KB Output is correct
4 Correct 1149 ms 24368 KB Output is correct
5 Correct 39 ms 4556 KB Output is correct
6 Correct 1315 ms 24224 KB Output is correct
7 Correct 1185 ms 23896 KB Output is correct
8 Correct 1069 ms 23820 KB Output is correct
9 Correct 904 ms 22164 KB Output is correct
10 Correct 791 ms 22120 KB Output is correct
11 Correct 899 ms 25720 KB Output is correct
12 Correct 818 ms 25652 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2084 ms 39632 KB Output is correct
2 Correct 49 ms 5816 KB Output is correct
3 Correct 229 ms 6856 KB Output is correct
4 Correct 118 ms 6944 KB Output is correct
5 Correct 1141 ms 41976 KB Output is correct
6 Correct 1853 ms 43388 KB Output is correct
7 Correct 971 ms 41780 KB Output is correct
8 Correct 950 ms 41108 KB Output is correct
9 Correct 878 ms 41292 KB Output is correct
10 Correct 900 ms 41020 KB Output is correct
11 Correct 1396 ms 42328 KB Output is correct
12 Correct 1452 ms 42544 KB Output is correct
13 Correct 1493 ms 42152 KB Output is correct
14 Correct 975 ms 41880 KB Output is correct
15 Correct 1014 ms 41868 KB Output is correct
16 Correct 1893 ms 43316 KB Output is correct
17 Correct 1884 ms 43196 KB Output is correct
18 Correct 1901 ms 43300 KB Output is correct
19 Correct 1892 ms 43452 KB Output is correct
20 Correct 1619 ms 42396 KB Output is correct
21 Correct 1595 ms 42444 KB Output is correct
22 Correct 1824 ms 43016 KB Output is correct
23 Correct 1050 ms 41384 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1629 ms 41236 KB Output is correct
2 Correct 1621 ms 41416 KB Output is correct
3 Correct 1606 ms 41232 KB Output is correct
4 Correct 1608 ms 41172 KB Output is correct
5 Correct 1599 ms 41476 KB Output is correct
6 Correct 2021 ms 42760 KB Output is correct
7 Correct 2133 ms 42644 KB Output is correct
8 Correct 2175 ms 42680 KB Output is correct
9 Correct 39 ms 4456 KB Output is correct
10 Correct 1277 ms 42920 KB Output is correct
11 Correct 1191 ms 42908 KB Output is correct
12 Correct 1399 ms 39144 KB Output is correct
13 Correct 1334 ms 42600 KB Output is correct
14 Correct 1148 ms 24156 KB Output is correct
15 Correct 849 ms 12788 KB Output is correct
16 Correct 1431 ms 25944 KB Output is correct
17 Correct 1149 ms 24368 KB Output is correct
18 Correct 39 ms 4556 KB Output is correct
19 Correct 1315 ms 24224 KB Output is correct
20 Correct 1185 ms 23896 KB Output is correct
21 Correct 1069 ms 23820 KB Output is correct
22 Correct 904 ms 22164 KB Output is correct
23 Correct 791 ms 22120 KB Output is correct
24 Correct 899 ms 25720 KB Output is correct
25 Correct 818 ms 25652 KB Output is correct
26 Correct 1604 ms 41384 KB Output is correct
27 Correct 1889 ms 42952 KB Output is correct
28 Correct 1687 ms 41192 KB Output is correct
29 Correct 1239 ms 40948 KB Output is correct
30 Correct 1802 ms 42764 KB Output is correct
31 Correct 1855 ms 42804 KB Output is correct
32 Correct 1871 ms 42904 KB Output is correct
33 Correct 1517 ms 41268 KB Output is correct
34 Correct 1511 ms 41104 KB Output is correct
35 Correct 1510 ms 41524 KB Output is correct
36 Correct 1171 ms 40920 KB Output is correct
37 Correct 1183 ms 41084 KB Output is correct
38 Correct 1216 ms 40976 KB Output is correct
39 Correct 973 ms 39380 KB Output is correct
40 Correct 962 ms 39240 KB Output is correct
41 Correct 989 ms 39320 KB Output is correct
42 Correct 963 ms 42292 KB Output is correct
43 Correct 957 ms 42176 KB Output is correct
44 Correct 971 ms 42032 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2796 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 44 ms 5168 KB Output is correct
4 Correct 7 ms 2900 KB Output is correct
5 Correct 43 ms 5308 KB Output is correct
6 Correct 38 ms 5008 KB Output is correct
7 Correct 43 ms 5936 KB Output is correct
8 Correct 49 ms 5032 KB Output is correct
9 Correct 60 ms 6652 KB Output is correct
10 Correct 44 ms 5148 KB Output is correct
11 Correct 44 ms 5024 KB Output is correct
12 Correct 53 ms 5292 KB Output is correct
13 Correct 53 ms 5152 KB Output is correct
14 Correct 51 ms 5076 KB Output is correct
15 Correct 54 ms 5168 KB Output is correct
16 Correct 53 ms 6348 KB Output is correct
17 Correct 55 ms 5864 KB Output is correct
18 Correct 1629 ms 41236 KB Output is correct
19 Correct 1621 ms 41416 KB Output is correct
20 Correct 1606 ms 41232 KB Output is correct
21 Correct 1608 ms 41172 KB Output is correct
22 Correct 1599 ms 41476 KB Output is correct
23 Correct 2021 ms 42760 KB Output is correct
24 Correct 2133 ms 42644 KB Output is correct
25 Correct 2175 ms 42680 KB Output is correct
26 Correct 39 ms 4456 KB Output is correct
27 Correct 1277 ms 42920 KB Output is correct
28 Correct 1191 ms 42908 KB Output is correct
29 Correct 1399 ms 39144 KB Output is correct
30 Correct 1334 ms 42600 KB Output is correct
31 Correct 1148 ms 24156 KB Output is correct
32 Correct 849 ms 12788 KB Output is correct
33 Correct 1431 ms 25944 KB Output is correct
34 Correct 1149 ms 24368 KB Output is correct
35 Correct 39 ms 4556 KB Output is correct
36 Correct 1315 ms 24224 KB Output is correct
37 Correct 1185 ms 23896 KB Output is correct
38 Correct 1069 ms 23820 KB Output is correct
39 Correct 904 ms 22164 KB Output is correct
40 Correct 791 ms 22120 KB Output is correct
41 Correct 899 ms 25720 KB Output is correct
42 Correct 818 ms 25652 KB Output is correct
43 Correct 2084 ms 39632 KB Output is correct
44 Correct 49 ms 5816 KB Output is correct
45 Correct 229 ms 6856 KB Output is correct
46 Correct 118 ms 6944 KB Output is correct
47 Correct 1141 ms 41976 KB Output is correct
48 Correct 1853 ms 43388 KB Output is correct
49 Correct 971 ms 41780 KB Output is correct
50 Correct 950 ms 41108 KB Output is correct
51 Correct 878 ms 41292 KB Output is correct
52 Correct 900 ms 41020 KB Output is correct
53 Correct 1396 ms 42328 KB Output is correct
54 Correct 1452 ms 42544 KB Output is correct
55 Correct 1493 ms 42152 KB Output is correct
56 Correct 975 ms 41880 KB Output is correct
57 Correct 1014 ms 41868 KB Output is correct
58 Correct 1893 ms 43316 KB Output is correct
59 Correct 1884 ms 43196 KB Output is correct
60 Correct 1901 ms 43300 KB Output is correct
61 Correct 1892 ms 43452 KB Output is correct
62 Correct 1619 ms 42396 KB Output is correct
63 Correct 1595 ms 42444 KB Output is correct
64 Correct 1824 ms 43016 KB Output is correct
65 Correct 1050 ms 41384 KB Output is correct
66 Correct 1604 ms 41384 KB Output is correct
67 Correct 1889 ms 42952 KB Output is correct
68 Correct 1687 ms 41192 KB Output is correct
69 Correct 1239 ms 40948 KB Output is correct
70 Correct 1802 ms 42764 KB Output is correct
71 Correct 1855 ms 42804 KB Output is correct
72 Correct 1871 ms 42904 KB Output is correct
73 Correct 1517 ms 41268 KB Output is correct
74 Correct 1511 ms 41104 KB Output is correct
75 Correct 1510 ms 41524 KB Output is correct
76 Correct 1171 ms 40920 KB Output is correct
77 Correct 1183 ms 41084 KB Output is correct
78 Correct 1216 ms 40976 KB Output is correct
79 Correct 973 ms 39380 KB Output is correct
80 Correct 962 ms 39240 KB Output is correct
81 Correct 989 ms 39320 KB Output is correct
82 Correct 963 ms 42292 KB Output is correct
83 Correct 957 ms 42176 KB Output is correct
84 Correct 971 ms 42032 KB Output is correct
85 Correct 2174 ms 45996 KB Output is correct
86 Correct 208 ms 9040 KB Output is correct
87 Correct 130 ms 10220 KB Output is correct
88 Correct 1425 ms 46128 KB Output is correct
89 Correct 2265 ms 46056 KB Output is correct
90 Correct 1458 ms 46136 KB Output is correct
91 Correct 1566 ms 43988 KB Output is correct
92 Correct 1548 ms 44020 KB Output is correct
93 Correct 2234 ms 45192 KB Output is correct
94 Correct 1848 ms 45464 KB Output is correct
95 Correct 1873 ms 45172 KB Output is correct
96 Correct 2120 ms 46484 KB Output is correct
97 Correct 1135 ms 42432 KB Output is correct
98 Correct 1144 ms 46128 KB Output is correct
99 Correct 2208 ms 46144 KB Output is correct
100 Correct 2217 ms 45728 KB Output is correct
101 Correct 2277 ms 46040 KB Output is correct
102 Correct 2345 ms 46096 KB Output is correct
103 Correct 2429 ms 46768 KB Output is correct
104 Correct 2665 ms 46716 KB Output is correct
105 Correct 2112 ms 46656 KB Output is correct
106 Correct 1675 ms 46352 KB Output is correct
107 Correct 2083 ms 42980 KB Output is correct
108 Correct 2542 ms 46176 KB Output is correct
109 Correct 1711 ms 45748 KB Output is correct