oj.uz

Submission #187318

# Submission time Handle Problem Language Result Execution time Memory
187318 2020-01-12T16:57:26 Z Anai Bridges (APIO19_bridges) C++14
100 / 100
 2395 ms 25452 KB 
    // bag pula, solutia mea ruleaza in 0.9s la mine pe laptop, muie oj.uz
    #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:177:32: 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 14 ms 12668 KB Output is correct
2 Correct 14 ms 12664 KB Output is correct
3 Correct 72 ms 12920 KB Output is correct
4 Correct 23 ms 12792 KB Output is correct
5 Correct 40 ms 12792 KB Output is correct
6 Correct 39 ms 12920 KB Output is correct
7 Correct 42 ms 12792 KB Output is correct
8 Correct 43 ms 12856 KB Output is correct
9 Correct 46 ms 12792 KB Output is correct
10 Correct 40 ms 12792 KB Output is correct
11 Correct 35 ms 12920 KB Output is correct
12 Correct 43 ms 12792 KB Output is correct
13 Correct 47 ms 12792 KB Output is correct
14 Correct 46 ms 12792 KB Output is correct
15 Correct 42 ms 12920 KB Output is correct
16 Correct 47 ms 12792 KB Output is correct
17 Correct 47 ms 12968 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1513 ms 17996 KB Output is correct
2 Correct 1529 ms 17988 KB Output is correct
3 Correct 1485 ms 18136 KB Output is correct
4 Correct 1427 ms 18152 KB Output is correct
5 Correct 1442 ms 18112 KB Output is correct
6 Correct 1955 ms 17380 KB Output is correct
7 Correct 1859 ms 19740 KB Output is correct
8 Correct 1822 ms 19932 KB Output is correct
9 Correct 105 ms 14328 KB Output is correct
10 Correct 1594 ms 19784 KB Output is correct
11 Correct 1537 ms 19756 KB Output is correct
12 Correct 999 ms 19780 KB Output is correct
13 Correct 1053 ms 20088 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1278 ms 16464 KB Output is correct
2 Correct 1022 ms 14172 KB Output is correct
3 Correct 1387 ms 16472 KB Output is correct
4 Correct 1263 ms 16388 KB Output is correct
5 Correct 104 ms 13048 KB Output is correct
6 Correct 1323 ms 16504 KB Output is correct
7 Correct 1182 ms 16348 KB Output is correct
8 Correct 1087 ms 16368 KB Output is correct
9 Correct 673 ms 16108 KB Output is correct
10 Correct 644 ms 15932 KB Output is correct
11 Correct 762 ms 16436 KB Output is correct
12 Correct 719 ms 16120 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 991 ms 20324 KB Output is correct
2 Correct 105 ms 13048 KB Output is correct
3 Correct 99 ms 20168 KB Output is correct
4 Correct 97 ms 20324 KB Output is correct
5 Correct 992 ms 20324 KB Output is correct
6 Correct 994 ms 20424 KB Output is correct
7 Correct 941 ms 20324 KB Output is correct
8 Correct 708 ms 16616 KB Output is correct
9 Correct 721 ms 16748 KB Output is correct
10 Correct 685 ms 16616 KB Output is correct
11 Correct 1022 ms 19300 KB Output is correct
12 Correct 1004 ms 19232 KB Output is correct
13 Correct 1074 ms 19300 KB Output is correct
14 Correct 983 ms 20324 KB Output is correct
15 Correct 981 ms 20344 KB Output is correct
16 Correct 1129 ms 20324 KB Output is correct
17 Correct 1140 ms 20324 KB Output is correct
18 Correct 1118 ms 20336 KB Output is correct
19 Correct 1153 ms 20324 KB Output is correct
20 Correct 1084 ms 19580 KB Output is correct
21 Correct 1085 ms 19556 KB Output is correct
22 Correct 1133 ms 20068 KB Output is correct
23 Correct 929 ms 19452 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1513 ms 17996 KB Output is correct
2 Correct 1529 ms 17988 KB Output is correct
3 Correct 1485 ms 18136 KB Output is correct
4 Correct 1427 ms 18152 KB Output is correct
5 Correct 1442 ms 18112 KB Output is correct
6 Correct 1955 ms 17380 KB Output is correct
7 Correct 1859 ms 19740 KB Output is correct
8 Correct 1822 ms 19932 KB Output is correct
9 Correct 105 ms 14328 KB Output is correct
10 Correct 1594 ms 19784 KB Output is correct
11 Correct 1537 ms 19756 KB Output is correct
12 Correct 999 ms 19780 KB Output is correct
13 Correct 1053 ms 20088 KB Output is correct
14 Correct 1278 ms 16464 KB Output is correct
15 Correct 1022 ms 14172 KB Output is correct
16 Correct 1387 ms 16472 KB Output is correct
17 Correct 1263 ms 16388 KB Output is correct
18 Correct 104 ms 13048 KB Output is correct
19 Correct 1323 ms 16504 KB Output is correct
20 Correct 1182 ms 16348 KB Output is correct
21 Correct 1087 ms 16368 KB Output is correct
22 Correct 673 ms 16108 KB Output is correct
23 Correct 644 ms 15932 KB Output is correct
24 Correct 762 ms 16436 KB Output is correct
25 Correct 719 ms 16120 KB Output is correct
26 Correct 1595 ms 20900 KB Output is correct
27 Correct 1931 ms 20756 KB Output is correct
28 Correct 1751 ms 20988 KB Output is correct
29 Correct 1434 ms 20764 KB Output is correct
30 Correct 2023 ms 20660 KB Output is correct
31 Correct 2047 ms 20808 KB Output is correct
32 Correct 2016 ms 20712 KB Output is correct
33 Correct 1886 ms 20972 KB Output is correct
34 Correct 1842 ms 21016 KB Output is correct
35 Correct 1864 ms 21060 KB Output is correct
36 Correct 1522 ms 20912 KB Output is correct
37 Correct 1656 ms 20828 KB Output is correct
38 Correct 1560 ms 20736 KB Output is correct
39 Correct 980 ms 20172 KB Output is correct
40 Correct 982 ms 20076 KB Output is correct
41 Correct 946 ms 20000 KB Output is correct
42 Correct 1010 ms 20800 KB Output is correct
43 Correct 1012 ms 20720 KB Output is correct
44 Correct 999 ms 20788 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12668 KB Output is correct
2 Correct 14 ms 12664 KB Output is correct
3 Correct 72 ms 12920 KB Output is correct
4 Correct 23 ms 12792 KB Output is correct
5 Correct 40 ms 12792 KB Output is correct
6 Correct 39 ms 12920 KB Output is correct
7 Correct 42 ms 12792 KB Output is correct
8 Correct 43 ms 12856 KB Output is correct
9 Correct 46 ms 12792 KB Output is correct
10 Correct 40 ms 12792 KB Output is correct
11 Correct 35 ms 12920 KB Output is correct
12 Correct 43 ms 12792 KB Output is correct
13 Correct 47 ms 12792 KB Output is correct
14 Correct 46 ms 12792 KB Output is correct
15 Correct 42 ms 12920 KB Output is correct
16 Correct 47 ms 12792 KB Output is correct
17 Correct 47 ms 12968 KB Output is correct
18 Correct 1513 ms 17996 KB Output is correct
19 Correct 1529 ms 17988 KB Output is correct
20 Correct 1485 ms 18136 KB Output is correct
21 Correct 1427 ms 18152 KB Output is correct
22 Correct 1442 ms 18112 KB Output is correct
23 Correct 1955 ms 17380 KB Output is correct
24 Correct 1859 ms 19740 KB Output is correct
25 Correct 1822 ms 19932 KB Output is correct
26 Correct 105 ms 14328 KB Output is correct
27 Correct 1594 ms 19784 KB Output is correct
28 Correct 1537 ms 19756 KB Output is correct
29 Correct 999 ms 19780 KB Output is correct
30 Correct 1053 ms 20088 KB Output is correct
31 Correct 1278 ms 16464 KB Output is correct
32 Correct 1022 ms 14172 KB Output is correct
33 Correct 1387 ms 16472 KB Output is correct
34 Correct 1263 ms 16388 KB Output is correct
35 Correct 104 ms 13048 KB Output is correct
36 Correct 1323 ms 16504 KB Output is correct
37 Correct 1182 ms 16348 KB Output is correct
38 Correct 1087 ms 16368 KB Output is correct
39 Correct 673 ms 16108 KB Output is correct
40 Correct 644 ms 15932 KB Output is correct
41 Correct 762 ms 16436 KB Output is correct
42 Correct 719 ms 16120 KB Output is correct
43 Correct 991 ms 20324 KB Output is correct
44 Correct 105 ms 13048 KB Output is correct
45 Correct 99 ms 20168 KB Output is correct
46 Correct 97 ms 20324 KB Output is correct
47 Correct 992 ms 20324 KB Output is correct
48 Correct 994 ms 20424 KB Output is correct
49 Correct 941 ms 20324 KB Output is correct
50 Correct 708 ms 16616 KB Output is correct
51 Correct 721 ms 16748 KB Output is correct
52 Correct 685 ms 16616 KB Output is correct
53 Correct 1022 ms 19300 KB Output is correct
54 Correct 1004 ms 19232 KB Output is correct
55 Correct 1074 ms 19300 KB Output is correct
56 Correct 983 ms 20324 KB Output is correct
57 Correct 981 ms 20344 KB Output is correct
58 Correct 1129 ms 20324 KB Output is correct
59 Correct 1140 ms 20324 KB Output is correct
60 Correct 1118 ms 20336 KB Output is correct
61 Correct 1153 ms 20324 KB Output is correct
62 Correct 1084 ms 19580 KB Output is correct
63 Correct 1085 ms 19556 KB Output is correct
64 Correct 1133 ms 20068 KB Output is correct
65 Correct 929 ms 19452 KB Output is correct
66 Correct 1595 ms 20900 KB Output is correct
67 Correct 1931 ms 20756 KB Output is correct
68 Correct 1751 ms 20988 KB Output is correct
69 Correct 1434 ms 20764 KB Output is correct
70 Correct 2023 ms 20660 KB Output is correct
71 Correct 2047 ms 20808 KB Output is correct
72 Correct 2016 ms 20712 KB Output is correct
73 Correct 1886 ms 20972 KB Output is correct
74 Correct 1842 ms 21016 KB Output is correct
75 Correct 1864 ms 21060 KB Output is correct
76 Correct 1522 ms 20912 KB Output is correct
77 Correct 1656 ms 20828 KB Output is correct
78 Correct 1560 ms 20736 KB Output is correct
79 Correct 980 ms 20172 KB Output is correct
80 Correct 982 ms 20076 KB Output is correct
81 Correct 946 ms 20000 KB Output is correct
82 Correct 1010 ms 20800 KB Output is correct
83 Correct 1012 ms 20720 KB Output is correct
84 Correct 999 ms 20788 KB Output is correct
85 Correct 2031 ms 25448 KB Output is correct
86 Correct 168 ms 22760 KB Output is correct
87 Correct 184 ms 22860 KB Output is correct
88 Correct 1905 ms 23592 KB Output is correct
89 Correct 2065 ms 25384 KB Output is correct
90 Correct 1896 ms 22784 KB Output is correct
91 Correct 1905 ms 20856 KB Output is correct
92 Correct 1827 ms 20948 KB Output is correct
93 Correct 2182 ms 20040 KB Output is correct
94 Correct 2162 ms 23264 KB Output is correct
95 Correct 2092 ms 23424 KB Output is correct
96 Correct 2169 ms 22136 KB Output is correct
97 Correct 1301 ms 22460 KB Output is correct
98 Correct 1319 ms 22828 KB Output is correct
99 Correct 2144 ms 25272 KB Output is correct
100 Correct 2161 ms 25452 KB Output is correct
101 Correct 2257 ms 25416 KB Output is correct
102 Correct 2279 ms 25344 KB Output is correct
103 Correct 2166 ms 22480 KB Output is correct
104 Correct 2395 ms 22512 KB Output is correct
105 Correct 1567 ms 22676 KB Output is correct
106 Correct 1211 ms 22372 KB Output is correct
107 Correct 1419 ms 22516 KB Output is correct
108 Correct 2117 ms 23520 KB Output is correct
109 Correct 1967 ms 21092 KB Output is correct