oj.uz

Submission #203085

# Submission time Handle Problem Language Result Execution time Memory
203085 2020-02-19T10:13:39 Z Mercenary Bridges (APIO19_bridges) C++14
100 / 100
 2543 ms 42016 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;

struct Dsurollback{
    pair<int*,int> data[(int)2e6];
    int lab[maxn] , sz;
    int FindLab(int u){
        return lab[u] < 0 ? u : FindLab(lab[u]);
    }
    void Change(int & u , int v){
        data[sz++] = mp(&u,u);
        u = v;
    }
    void rollback(int sz1){
        while(sz > sz1){
            (*data[sz-1].first) = data[sz-1].second;
            --sz;
        }
    }
    int cnt = 0;
    int cnt1 = 0;
    void Merge(int u , int v){
        u = FindLab(u);v = FindLab(v);
        if(u == v)return;
        if(lab[u] > lab[v])swap(u,v);
        Change(lab[u],lab[u]+lab[v]);
        Change(lab[v],u);
    }
    int cur(){return sz;};
    void reset(int n){
        fill_n(lab,n+2,-1);
        sz = 0;
    }
}Dsu;

int n , m , q;
int u[maxn] , v[maxn] , d[maxn];
int out[maxn] , fakeid[maxn];
int type[maxn];
int res[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> m;
    for(int i = 1 ;  i <= m ; ++i){
        cin >> u[i] >> v[i] >> d[i];
        fakeid[i] = i;
    }
    cin >> q;
    for(int i = m + 1 ; i <= q + m ; ++i){
        cin >> type[i];
        if(type[i] == 1){
            int x;cin >> x;
            u[i] = u[x];v[i] = v[x];cin >> d[i];
            out[fakeid[x]] = i;
            fakeid[x] = i;
        }else{
            cin >> u[i] >> d[i];
        }
    }
    for(int i = 1 ; i <= m + q ; ++i)if(out[i] == 0)out[i] = q + m + 1;
    const int MAGIC = 300;
    vector<int> prepare;
    for(int i = 1 ; i <= m + q ; ++i)if(type[i] != 2)prepare.pb(i);
    sort(prepare.begin(),prepare.end() , [&](const int x , const int y){return d[x] > d[y];});
    for(int l = m + 1 ; l <= m + q ; l += MAGIC){
        int r = min(m + q ,l+MAGIC-1);
        vector<int> qval;
        Dsu.reset(n);
        vector<int> sp , norm;
        for(int i = l ; i <= r ; ++i){
            if(type[i] == 2 && i >= l)qval.pb(i);
        }
        for(auto & i : prepare){
            if(i > r || out[i] < l)continue;
            if(i < l && out[i] > r)norm.pb(i);
            else sp.pb(i);
        }
        sort(qval.begin(),qval.end(),[&](const int x , const int y){return d[x] > d[y];});
        int it = 0;
        for(auto & id : qval){
            while(it < norm.size() && d[id] <= d[norm[it]]){
                Dsu.Merge(u[norm[it]],v[norm[it]]);
                ++it;
            }
            int tmp = Dsu.cur();
            for(auto & c : sp){
                if(d[id] > d[c])break;
                if(d[id] <= d[c] && c < id && out[c] > id){
                    Dsu.Merge(u[c],v[c]);
                }
            }
            res[id] = -Dsu.lab[Dsu.FindLab(u[id])];
            Dsu.rollback(tmp);
        }
    }
    for(int i = m + 1 ; i <= m + q ; ++i)if(type[i] == 2)cout << res[i] << '\n';
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:104:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(it < norm.size() && d[id] <= d[norm[it]]){
                   ~~~^~~~~~~~~~~~~
bridges.cpp:63:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:64:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 31736 KB Output is correct
2 Correct 22 ms 31736 KB Output is correct
3 Correct 37 ms 32248 KB Output is correct
4 Correct 27 ms 31992 KB Output is correct
5 Correct 36 ms 32124 KB Output is correct
6 Correct 31 ms 32120 KB Output is correct
7 Correct 36 ms 32120 KB Output is correct
8 Correct 36 ms 32252 KB Output is correct
9 Correct 40 ms 32248 KB Output is correct
10 Correct 35 ms 32120 KB Output is correct
11 Correct 36 ms 32180 KB Output is correct
12 Correct 37 ms 32120 KB Output is correct
13 Correct 39 ms 32120 KB Output is correct
14 Correct 37 ms 32248 KB Output is correct
15 Correct 37 ms 32120 KB Output is correct
16 Correct 38 ms 32120 KB Output is correct
17 Correct 39 ms 32120 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1316 ms 36976 KB Output is correct
2 Correct 1311 ms 37028 KB Output is correct
3 Correct 1346 ms 36936 KB Output is correct
4 Correct 1311 ms 36804 KB Output is correct
5 Correct 1338 ms 36848 KB Output is correct
6 Correct 1599 ms 37092 KB Output is correct
7 Correct 1611 ms 37012 KB Output is correct
8 Correct 1596 ms 36776 KB Output is correct
9 Correct 62 ms 34424 KB Output is correct
10 Correct 1008 ms 37076 KB Output is correct
11 Correct 1022 ms 37040 KB Output is correct
12 Correct 1002 ms 36872 KB Output is correct
13 Correct 1386 ms 37100 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 36340 KB Output is correct
2 Correct 543 ms 35448 KB Output is correct
3 Correct 1022 ms 36340 KB Output is correct
4 Correct 911 ms 36212 KB Output is correct
5 Correct 61 ms 34424 KB Output is correct
6 Correct 986 ms 36476 KB Output is correct
7 Correct 917 ms 36252 KB Output is correct
8 Correct 866 ms 36288 KB Output is correct
9 Correct 628 ms 36236 KB Output is correct
10 Correct 596 ms 36332 KB Output is correct
11 Correct 953 ms 36504 KB Output is correct
12 Correct 890 ms 36212 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1931 ms 38176 KB Output is correct
2 Correct 62 ms 35192 KB Output is correct
3 Correct 198 ms 37036 KB Output is correct
4 Correct 170 ms 37196 KB Output is correct
5 Correct 1563 ms 39560 KB Output is correct
6 Correct 1879 ms 41252 KB Output is correct
7 Correct 1554 ms 39624 KB Output is correct
8 Correct 837 ms 38424 KB Output is correct
9 Correct 808 ms 38552 KB Output is correct
10 Correct 825 ms 38228 KB Output is correct
11 Correct 1447 ms 39760 KB Output is correct
12 Correct 1380 ms 40000 KB Output is correct
13 Correct 1425 ms 39796 KB Output is correct
14 Correct 1574 ms 39824 KB Output is correct
15 Correct 1606 ms 39748 KB Output is correct
16 Correct 1936 ms 40996 KB Output is correct
17 Correct 1988 ms 41072 KB Output is correct
18 Correct 1974 ms 41316 KB Output is correct
19 Correct 1932 ms 41488 KB Output is correct
20 Correct 1629 ms 40200 KB Output is correct
21 Correct 1667 ms 40152 KB Output is correct
22 Correct 1915 ms 40904 KB Output is correct
23 Correct 1537 ms 38820 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1316 ms 36976 KB Output is correct
2 Correct 1311 ms 37028 KB Output is correct
3 Correct 1346 ms 36936 KB Output is correct
4 Correct 1311 ms 36804 KB Output is correct
5 Correct 1338 ms 36848 KB Output is correct
6 Correct 1599 ms 37092 KB Output is correct
7 Correct 1611 ms 37012 KB Output is correct
8 Correct 1596 ms 36776 KB Output is correct
9 Correct 62 ms 34424 KB Output is correct
10 Correct 1008 ms 37076 KB Output is correct
11 Correct 1022 ms 37040 KB Output is correct
12 Correct 1002 ms 36872 KB Output is correct
13 Correct 1386 ms 37100 KB Output is correct
14 Correct 926 ms 36340 KB Output is correct
15 Correct 543 ms 35448 KB Output is correct
16 Correct 1022 ms 36340 KB Output is correct
17 Correct 911 ms 36212 KB Output is correct
18 Correct 61 ms 34424 KB Output is correct
19 Correct 986 ms 36476 KB Output is correct
20 Correct 917 ms 36252 KB Output is correct
21 Correct 866 ms 36288 KB Output is correct
22 Correct 628 ms 36236 KB Output is correct
23 Correct 596 ms 36332 KB Output is correct
24 Correct 953 ms 36504 KB Output is correct
25 Correct 890 ms 36212 KB Output is correct
26 Correct 1277 ms 37088 KB Output is correct
27 Correct 1524 ms 37020 KB Output is correct
28 Correct 1436 ms 36940 KB Output is correct
29 Correct 1254 ms 37100 KB Output is correct
30 Correct 1450 ms 36804 KB Output is correct
31 Correct 1469 ms 37120 KB Output is correct
32 Correct 1488 ms 37092 KB Output is correct
33 Correct 1350 ms 36880 KB Output is correct
34 Correct 1352 ms 36948 KB Output is correct
35 Correct 1362 ms 37140 KB Output is correct
36 Correct 1236 ms 37016 KB Output is correct
37 Correct 1240 ms 37068 KB Output is correct
38 Correct 1211 ms 37000 KB Output is correct
39 Correct 944 ms 36844 KB Output is correct
40 Correct 931 ms 36740 KB Output is correct
41 Correct 959 ms 36696 KB Output is correct
42 Correct 1165 ms 36972 KB Output is correct
43 Correct 1167 ms 37100 KB Output is correct
44 Correct 1194 ms 36892 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 31736 KB Output is correct
2 Correct 22 ms 31736 KB Output is correct
3 Correct 37 ms 32248 KB Output is correct
4 Correct 27 ms 31992 KB Output is correct
5 Correct 36 ms 32124 KB Output is correct
6 Correct 31 ms 32120 KB Output is correct
7 Correct 36 ms 32120 KB Output is correct
8 Correct 36 ms 32252 KB Output is correct
9 Correct 40 ms 32248 KB Output is correct
10 Correct 35 ms 32120 KB Output is correct
11 Correct 36 ms 32180 KB Output is correct
12 Correct 37 ms 32120 KB Output is correct
13 Correct 39 ms 32120 KB Output is correct
14 Correct 37 ms 32248 KB Output is correct
15 Correct 37 ms 32120 KB Output is correct
16 Correct 38 ms 32120 KB Output is correct
17 Correct 39 ms 32120 KB Output is correct
18 Correct 1316 ms 36976 KB Output is correct
19 Correct 1311 ms 37028 KB Output is correct
20 Correct 1346 ms 36936 KB Output is correct
21 Correct 1311 ms 36804 KB Output is correct
22 Correct 1338 ms 36848 KB Output is correct
23 Correct 1599 ms 37092 KB Output is correct
24 Correct 1611 ms 37012 KB Output is correct
25 Correct 1596 ms 36776 KB Output is correct
26 Correct 62 ms 34424 KB Output is correct
27 Correct 1008 ms 37076 KB Output is correct
28 Correct 1022 ms 37040 KB Output is correct
29 Correct 1002 ms 36872 KB Output is correct
30 Correct 1386 ms 37100 KB Output is correct
31 Correct 926 ms 36340 KB Output is correct
32 Correct 543 ms 35448 KB Output is correct
33 Correct 1022 ms 36340 KB Output is correct
34 Correct 911 ms 36212 KB Output is correct
35 Correct 61 ms 34424 KB Output is correct
36 Correct 986 ms 36476 KB Output is correct
37 Correct 917 ms 36252 KB Output is correct
38 Correct 866 ms 36288 KB Output is correct
39 Correct 628 ms 36236 KB Output is correct
40 Correct 596 ms 36332 KB Output is correct
41 Correct 953 ms 36504 KB Output is correct
42 Correct 890 ms 36212 KB Output is correct
43 Correct 1931 ms 38176 KB Output is correct
44 Correct 62 ms 35192 KB Output is correct
45 Correct 198 ms 37036 KB Output is correct
46 Correct 170 ms 37196 KB Output is correct
47 Correct 1563 ms 39560 KB Output is correct
48 Correct 1879 ms 41252 KB Output is correct
49 Correct 1554 ms 39624 KB Output is correct
50 Correct 837 ms 38424 KB Output is correct
51 Correct 808 ms 38552 KB Output is correct
52 Correct 825 ms 38228 KB Output is correct
53 Correct 1447 ms 39760 KB Output is correct
54 Correct 1380 ms 40000 KB Output is correct
55 Correct 1425 ms 39796 KB Output is correct
56 Correct 1574 ms 39824 KB Output is correct
57 Correct 1606 ms 39748 KB Output is correct
58 Correct 1936 ms 40996 KB Output is correct
59 Correct 1988 ms 41072 KB Output is correct
60 Correct 1974 ms 41316 KB Output is correct
61 Correct 1932 ms 41488 KB Output is correct
62 Correct 1629 ms 40200 KB Output is correct
63 Correct 1667 ms 40152 KB Output is correct
64 Correct 1915 ms 40904 KB Output is correct
65 Correct 1537 ms 38820 KB Output is correct
66 Correct 1277 ms 37088 KB Output is correct
67 Correct 1524 ms 37020 KB Output is correct
68 Correct 1436 ms 36940 KB Output is correct
69 Correct 1254 ms 37100 KB Output is correct
70 Correct 1450 ms 36804 KB Output is correct
71 Correct 1469 ms 37120 KB Output is correct
72 Correct 1488 ms 37092 KB Output is correct
73 Correct 1350 ms 36880 KB Output is correct
74 Correct 1352 ms 36948 KB Output is correct
75 Correct 1362 ms 37140 KB Output is correct
76 Correct 1236 ms 37016 KB Output is correct
77 Correct 1240 ms 37068 KB Output is correct
78 Correct 1211 ms 37000 KB Output is correct
79 Correct 944 ms 36844 KB Output is correct
80 Correct 931 ms 36740 KB Output is correct
81 Correct 959 ms 36696 KB Output is correct
82 Correct 1165 ms 36972 KB Output is correct
83 Correct 1167 ms 37100 KB Output is correct
84 Correct 1194 ms 36892 KB Output is correct
85 Correct 2461 ms 41784 KB Output is correct
86 Correct 220 ms 37304 KB Output is correct
87 Correct 185 ms 37244 KB Output is correct
88 Correct 1979 ms 40272 KB Output is correct
89 Correct 2387 ms 42000 KB Output is correct
90 Correct 1986 ms 40244 KB Output is correct
91 Correct 1363 ms 39028 KB Output is correct
92 Correct 1338 ms 39232 KB Output is correct
93 Correct 1624 ms 39048 KB Output is correct
94 Correct 1990 ms 40436 KB Output is correct
95 Correct 1915 ms 40624 KB Output is correct
96 Correct 2081 ms 40620 KB Output is correct
97 Correct 1745 ms 40268 KB Output is correct
98 Correct 2054 ms 40624 KB Output is correct
99 Correct 2527 ms 41796 KB Output is correct
100 Correct 2543 ms 41668 KB Output is correct
101 Correct 2511 ms 41868 KB Output is correct
102 Correct 2496 ms 42016 KB Output is correct
103 Correct 2315 ms 40724 KB Output is correct
104 Correct 2333 ms 40820 KB Output is correct
105 Correct 2397 ms 41092 KB Output is correct
106 Correct 2063 ms 40660 KB Output is correct
107 Correct 1880 ms 40776 KB Output is correct
108 Correct 2511 ms 41452 KB Output is correct
109 Correct 2071 ms 39536 KB Output is correct