oj.uz

Submission #173650

# Submission time Handle Problem Language Result Execution time Memory
173650 2020-01-04T19:12:57 Z errorgorn Bridges (APIO19_bridges) C++14
100 / 100
 2114 ms 25444 KB 
#include <cstdio>
#include <iostream>
#include <vector>
#include <utility>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef pair<ii,ii> iiii;

const int bucket_size=500; ///play with bucket size lmao

struct UFDS{
    int p[50005];
    int r[50005];
    int s[50005];
    
    UFDS(){}
    
    void init(){
        for (int x=0;x<50005;x++){
            p[x]=x;
            r[x]=0;
            s[x]=1;
        }
    }
    
    int parent(int i){return (p[i]==i)?i:p[i]=parent(p[i]);}
    
    void unions(int i,int j){
        i=parent(i),j=parent(j);
        if (i==j) return;
        if (r[i]<r[j]){
            p[i]=j;
            s[j]+=s[i];
        }
        else{
            p[j]=i;
            s[i]+=s[j];
            if (r[i]==r[j]) r[i]++;
        }
    }
};

inline void read(int& x) {
    x = 0;
    char ch = getchar();
    while (ch&16){ //this will break when ‘\n’ or ‘ ‘ is encountered
		x = (x << 3) + (x << 1) + (ch&15);
		ch = getchar();
	}
}


int n,m,q;
iii edges[100005];
vector<iiii> unchanged,temp,temp2; ///sorted version of edges
vector<iii> __q;
vector<int> changed;
vector<int> queries;
iii edges2[100005];
bool ischanged[100005];
int ans[1000];
UFDS *dsu=new UFDS();

///for dfs
vector<int> al[500005];
int visited[500005];
int dfs_time=0; ///so we know if we visited node before
int stk[500005]; ///wtf how is this question so cancer

int dfs(int i){
    visited[i]=dfs_time;
    int res=0;
    int node;
    stk[++*stk]=i;
    while (*stk){
        node=stk[*stk];
        --*stk;
        res+=dsu->s[node];
        for (auto &it:al[node]){
            if (visited[it]!=dfs_time){
                visited[it]=dfs_time;
                stk[++*stk]=it;
            }
        }
    }
    return res;
}

int main(){
    read(n),read(m);
     
     for (int x=1;x<=m;x++){
         read(edges[x].second.first),read(edges[x].second.second),read(edges[x].first);
         unchanged.push_back(iiii(ii(edges[x].second.first,edges[x].second.second),ii(edges[x].first,x)));
     }
     
     sort(unchanged.begin(),unchanged.end(),[](iiii i, iiii j){
        return i.second.first>j.second.first;
     });
     
     read(q);
     int a,b,c;
     int currq;
     int weight;
     vector<iiii>::iterator pnt;
     while (q){
         __q.clear();
         memset(ischanged,false,sizeof(ischanged));
         changed.clear();
         dsu->init();
         for (int x=0;x<min(bucket_size,q);x++){
             read(a),read(b),read(c);
             __q.push_back(iii(a,ii(b,c)));
             if (__q.back().first==2) queries.push_back(x);
             else ischanged[__q.back().second.first]=true;
         }
         
         for (int x=1;x<=m;x++){
             if (ischanged[x]) changed.push_back(x);
         }
         
         swap(temp,unchanged);
         for (auto &it:temp){
             if (!ischanged[it.second.second]) unchanged.push_back(it);
         }
         temp.clear();
         
         sort(queries.begin(),queries.end(),[](int i,int j){
             return __q[i].second.second<__q[j].second.second;
         });
         /*
         for (auto &it:unchanged){
             printf("%d %d %d\n",it->s,it->e,it->w);
         }
         printf("\n");
         //*/
         pnt=unchanged.begin();
         while (!queries.empty()){
             currq=queries.back();
             weight=__q[currq].second.second;
             while (pnt!=unchanged.end() && (*pnt).second.first>=weight){
                 dsu->unions((*pnt).first.first,(*pnt).first.second);
                 pnt++;
             }
             
             for (auto &it:changed){
                 edges2[it]=edges[it];
             }
             
             for (int x=0;x<currq;x++){
                 if (__q[x].first==2) continue;
                 edges2[__q[x].second.first].first=__q[x].second.second;
             }
             
             for (auto &it:changed){
                 if (edges2[it].first>=weight){
                     al[dsu->parent(edges2[it].second.first)].push_back(dsu->parent(edges2[it].second.second));
                     al[dsu->parent(edges2[it].second.second)].push_back(dsu->parent(edges2[it].second.first));
                 }
             }
             
             dfs_time++;
             ans[currq]=dfs(dsu->parent(__q[currq].second.first));
             
             for (auto &it:changed){
                 al[dsu->parent(edges2[it].second.first)].clear();
                 al[dsu->parent(edges2[it].second.second)].clear();
             }
             queries.pop_back();
         }
         
         
         for (int x=0;x<__q.size();x++){
             if (__q[x].first==2) printf("%d\n",ans[x]);
             else{
                 edges[__q[x].second.first].first=__q[x].second.second;
             }
         }
         for (auto &it:changed){
             temp.push_back(iiii(ii(edges[it].second.first,edges[it].second.second),ii(edges[it].first,it)));
         }
         sort(temp.begin(),temp.end(),[](iiii i, iiii j){
             return i.second.first>j.second.first; 
         });
         
         swap(temp2,unchanged);
         pnt=temp.begin();
         ///merge temp and temp2 into unchanged
         
         for (auto &it:temp2){
             while (pnt!=temp.end() && (*pnt).second.first>it.second.first){
                 unchanged.push_back(*pnt);
                 pnt++;
             }
             unchanged.push_back(it);
         }
         while (pnt!=temp.end()){
             unchanged.push_back(*pnt);
             pnt++;
         }
         
         temp.clear();
         temp2.clear();
         q-=min(bucket_size,q);
     }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:176:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          for (int x=0;x<__q.size();x++){
                       ~^~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12792 KB Output is correct
2 Correct 13 ms 12792 KB Output is correct
3 Correct 75 ms 13200 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 40 ms 12920 KB Output is correct
6 Correct 39 ms 12920 KB Output is correct
7 Correct 40 ms 12832 KB Output is correct
8 Correct 39 ms 12920 KB Output is correct
9 Correct 45 ms 12920 KB Output is correct
10 Correct 40 ms 12920 KB Output is correct
11 Correct 39 ms 12920 KB Output is correct
12 Correct 40 ms 12920 KB Output is correct
13 Correct 47 ms 13048 KB Output is correct
14 Correct 46 ms 12920 KB Output is correct
15 Correct 42 ms 13048 KB Output is correct
16 Correct 41 ms 12920 KB Output is correct
17 Correct 41 ms 12920 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1452 ms 20956 KB Output is correct
2 Correct 1430 ms 20712 KB Output is correct
3 Correct 1426 ms 20708 KB Output is correct
4 Correct 1443 ms 20892 KB Output is correct
5 Correct 1390 ms 20848 KB Output is correct
6 Correct 1840 ms 19904 KB Output is correct
7 Correct 1763 ms 19828 KB Output is correct
8 Correct 1732 ms 19812 KB Output is correct
9 Correct 103 ms 14332 KB Output is correct
10 Correct 1538 ms 19444 KB Output is correct
11 Correct 1447 ms 19628 KB Output is correct
12 Correct 941 ms 19812 KB Output is correct
13 Correct 1008 ms 19992 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1246 ms 18700 KB Output is correct
2 Correct 1010 ms 15480 KB Output is correct
3 Correct 1381 ms 18544 KB Output is correct
4 Correct 1220 ms 18804 KB Output is correct
5 Correct 105 ms 14504 KB Output is correct
6 Correct 1269 ms 18700 KB Output is correct
7 Correct 1136 ms 18704 KB Output is correct
8 Correct 1049 ms 18684 KB Output is correct
9 Correct 658 ms 18416 KB Output is correct
10 Correct 620 ms 18416 KB Output is correct
11 Correct 739 ms 18872 KB Output is correct
12 Correct 681 ms 18672 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 950 ms 22664 KB Output is correct
2 Correct 104 ms 14328 KB Output is correct
3 Correct 94 ms 21988 KB Output is correct
4 Correct 89 ms 22116 KB Output is correct
5 Correct 924 ms 22012 KB Output is correct
6 Correct 946 ms 22856 KB Output is correct
7 Correct 943 ms 22004 KB Output is correct
8 Correct 708 ms 19064 KB Output is correct
9 Correct 687 ms 19052 KB Output is correct
10 Correct 694 ms 19180 KB Output is correct
11 Correct 990 ms 21224 KB Output is correct
12 Correct 947 ms 21256 KB Output is correct
13 Correct 971 ms 21344 KB Output is correct
14 Correct 911 ms 21984 KB Output is correct
15 Correct 916 ms 21984 KB Output is correct
16 Correct 1066 ms 22880 KB Output is correct
17 Correct 1085 ms 22780 KB Output is correct
18 Correct 1079 ms 22796 KB Output is correct
19 Correct 1101 ms 23012 KB Output is correct
20 Correct 1036 ms 21800 KB Output is correct
21 Correct 1076 ms 21864 KB Output is correct
22 Correct 1043 ms 22880 KB Output is correct
23 Correct 900 ms 20704 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1452 ms 20956 KB Output is correct
2 Correct 1430 ms 20712 KB Output is correct
3 Correct 1426 ms 20708 KB Output is correct
4 Correct 1443 ms 20892 KB Output is correct
5 Correct 1390 ms 20848 KB Output is correct
6 Correct 1840 ms 19904 KB Output is correct
7 Correct 1763 ms 19828 KB Output is correct
8 Correct 1732 ms 19812 KB Output is correct
9 Correct 103 ms 14332 KB Output is correct
10 Correct 1538 ms 19444 KB Output is correct
11 Correct 1447 ms 19628 KB Output is correct
12 Correct 941 ms 19812 KB Output is correct
13 Correct 1008 ms 19992 KB Output is correct
14 Correct 1246 ms 18700 KB Output is correct
15 Correct 1010 ms 15480 KB Output is correct
16 Correct 1381 ms 18544 KB Output is correct
17 Correct 1220 ms 18804 KB Output is correct
18 Correct 105 ms 14504 KB Output is correct
19 Correct 1269 ms 18700 KB Output is correct
20 Correct 1136 ms 18704 KB Output is correct
21 Correct 1049 ms 18684 KB Output is correct
22 Correct 658 ms 18416 KB Output is correct
23 Correct 620 ms 18416 KB Output is correct
24 Correct 739 ms 18872 KB Output is correct
25 Correct 681 ms 18672 KB Output is correct
26 Correct 1548 ms 20828 KB Output is correct
27 Correct 1897 ms 20660 KB Output is correct
28 Correct 1701 ms 20992 KB Output is correct
29 Correct 1364 ms 20836 KB Output is correct
30 Correct 1967 ms 20716 KB Output is correct
31 Correct 1973 ms 20604 KB Output is correct
32 Correct 1949 ms 20684 KB Output is correct
33 Correct 1800 ms 20960 KB Output is correct
34 Correct 1811 ms 20856 KB Output is correct
35 Correct 1787 ms 20948 KB Output is correct
36 Correct 1476 ms 20892 KB Output is correct
37 Correct 1460 ms 20744 KB Output is correct
38 Correct 1465 ms 20708 KB Output is correct
39 Correct 942 ms 20156 KB Output is correct
40 Correct 937 ms 20292 KB Output is correct
41 Correct 928 ms 20196 KB Output is correct
42 Correct 981 ms 20792 KB Output is correct
43 Correct 987 ms 20836 KB Output is correct
44 Correct 960 ms 20848 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12792 KB Output is correct
2 Correct 13 ms 12792 KB Output is correct
3 Correct 75 ms 13200 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 40 ms 12920 KB Output is correct
6 Correct 39 ms 12920 KB Output is correct
7 Correct 40 ms 12832 KB Output is correct
8 Correct 39 ms 12920 KB Output is correct
9 Correct 45 ms 12920 KB Output is correct
10 Correct 40 ms 12920 KB Output is correct
11 Correct 39 ms 12920 KB Output is correct
12 Correct 40 ms 12920 KB Output is correct
13 Correct 47 ms 13048 KB Output is correct
14 Correct 46 ms 12920 KB Output is correct
15 Correct 42 ms 13048 KB Output is correct
16 Correct 41 ms 12920 KB Output is correct
17 Correct 41 ms 12920 KB Output is correct
18 Correct 1452 ms 20956 KB Output is correct
19 Correct 1430 ms 20712 KB Output is correct
20 Correct 1426 ms 20708 KB Output is correct
21 Correct 1443 ms 20892 KB Output is correct
22 Correct 1390 ms 20848 KB Output is correct
23 Correct 1840 ms 19904 KB Output is correct
24 Correct 1763 ms 19828 KB Output is correct
25 Correct 1732 ms 19812 KB Output is correct
26 Correct 103 ms 14332 KB Output is correct
27 Correct 1538 ms 19444 KB Output is correct
28 Correct 1447 ms 19628 KB Output is correct
29 Correct 941 ms 19812 KB Output is correct
30 Correct 1008 ms 19992 KB Output is correct
31 Correct 1246 ms 18700 KB Output is correct
32 Correct 1010 ms 15480 KB Output is correct
33 Correct 1381 ms 18544 KB Output is correct
34 Correct 1220 ms 18804 KB Output is correct
35 Correct 105 ms 14504 KB Output is correct
36 Correct 1269 ms 18700 KB Output is correct
37 Correct 1136 ms 18704 KB Output is correct
38 Correct 1049 ms 18684 KB Output is correct
39 Correct 658 ms 18416 KB Output is correct
40 Correct 620 ms 18416 KB Output is correct
41 Correct 739 ms 18872 KB Output is correct
42 Correct 681 ms 18672 KB Output is correct
43 Correct 950 ms 22664 KB Output is correct
44 Correct 104 ms 14328 KB Output is correct
45 Correct 94 ms 21988 KB Output is correct
46 Correct 89 ms 22116 KB Output is correct
47 Correct 924 ms 22012 KB Output is correct
48 Correct 946 ms 22856 KB Output is correct
49 Correct 943 ms 22004 KB Output is correct
50 Correct 708 ms 19064 KB Output is correct
51 Correct 687 ms 19052 KB Output is correct
52 Correct 694 ms 19180 KB Output is correct
53 Correct 990 ms 21224 KB Output is correct
54 Correct 947 ms 21256 KB Output is correct
55 Correct 971 ms 21344 KB Output is correct
56 Correct 911 ms 21984 KB Output is correct
57 Correct 916 ms 21984 KB Output is correct
58 Correct 1066 ms 22880 KB Output is correct
59 Correct 1085 ms 22780 KB Output is correct
60 Correct 1079 ms 22796 KB Output is correct
61 Correct 1101 ms 23012 KB Output is correct
62 Correct 1036 ms 21800 KB Output is correct
63 Correct 1076 ms 21864 KB Output is correct
64 Correct 1043 ms 22880 KB Output is correct
65 Correct 900 ms 20704 KB Output is correct
66 Correct 1548 ms 20828 KB Output is correct
67 Correct 1897 ms 20660 KB Output is correct
68 Correct 1701 ms 20992 KB Output is correct
69 Correct 1364 ms 20836 KB Output is correct
70 Correct 1967 ms 20716 KB Output is correct
71 Correct 1973 ms 20604 KB Output is correct
72 Correct 1949 ms 20684 KB Output is correct
73 Correct 1800 ms 20960 KB Output is correct
74 Correct 1811 ms 20856 KB Output is correct
75 Correct 1787 ms 20948 KB Output is correct
76 Correct 1476 ms 20892 KB Output is correct
77 Correct 1460 ms 20744 KB Output is correct
78 Correct 1465 ms 20708 KB Output is correct
79 Correct 942 ms 20156 KB Output is correct
80 Correct 937 ms 20292 KB Output is correct
81 Correct 928 ms 20196 KB Output is correct
82 Correct 981 ms 20792 KB Output is correct
83 Correct 987 ms 20836 KB Output is correct
84 Correct 960 ms 20848 KB Output is correct
85 Correct 1989 ms 25392 KB Output is correct
86 Correct 158 ms 22764 KB Output is correct
87 Correct 173 ms 22896 KB Output is correct
88 Correct 1855 ms 23568 KB Output is correct
89 Correct 1931 ms 25444 KB Output is correct
90 Correct 1830 ms 22724 KB Output is correct
91 Correct 1792 ms 20652 KB Output is correct
92 Correct 1762 ms 20848 KB Output is correct
93 Correct 2085 ms 20068 KB Output is correct
94 Correct 2024 ms 23208 KB Output is correct
95 Correct 1990 ms 23404 KB Output is correct
96 Correct 2053 ms 21940 KB Output is correct
97 Correct 1183 ms 22496 KB Output is correct
98 Correct 1244 ms 22824 KB Output is correct
99 Correct 2055 ms 25180 KB Output is correct
100 Correct 2114 ms 25216 KB Output is correct
101 Correct 2090 ms 25400 KB Output is correct
102 Correct 2090 ms 25348 KB Output is correct
103 Correct 2058 ms 22612 KB Output is correct
104 Correct 2062 ms 22368 KB Output is correct
105 Correct 1426 ms 22500 KB Output is correct
106 Correct 1171 ms 22376 KB Output is correct
107 Correct 1388 ms 22424 KB Output is correct
108 Correct 2041 ms 23456 KB Output is correct
109 Correct 1893 ms 21092 KB Output is correct