Submission #121773

# Submission time Handle Problem Language Result Execution time Memory
121773 2019-06-27T04:37:10 Z LittleFlowers__ Bridges (APIO19_bridges) C++14
100 / 100
2371 ms 17128 KB
#include <bits/stdc++.h>
using namespace std;
const int sz=1<<10;
int pt=sz;
char buff[sz];
inline char readchar(){
    if(pt==sz){
        fread(buff,1,sz,stdin);
        pt=0;
    }
    return buff[pt++];
}
#define getchar readchar
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
inline void out(int x){
    if(x>9) out(x/10);
    putchar(x%10+'0');
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(false),cin.tie(nullptr);
#define task "B"
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))

const int N=100010;

struct ed{
    int u,v,c,i;
}e[N];
struct qr{
    int o,u,x,i;
}q[N];
struct dt{
    int x,y,X,Y;
};
stack<dt> st;

int n,m,t;


int T=1000,mode;
int id[N],b[N],ans[N];
vector<int> mm[N];

inline int root(int x){
    return id[x]<0?x:root(id[x]);
}
inline void join(int x,int y){
    if((x=root(x))==(y=root(y))) return;
    if(mode){
        st.push({x,y,id[x],id[y]});
    }
    if(id[x]>id[y]) swap(x,y);
    id[x]+=id[y];
    id[y]=x;
}

int nxt[N*2],cur[N];

main(){
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);
    n=in;
    forinc(i,1,m=in) e[i]={in,in,in,i};
    forinc(i,1,t=in) q[i]={in,in,in,i};
    forinc(i,1,t){
        if(q[i].o==1) mm[q[i].u].pb(i);
        b[i]=(i-1)/T+1;
    }

    forinc(i,1,m) cur[i]=t+1;
    fordec(i,t,1) if(q[i].o==1){
        nxt[i]=cur[q[i].u];
        cur[q[i].u]=i;
    }
    forinc(i,1,m){
        nxt[i+t+1]=cur[i];
        cur[i]=i+t+1;
    }

    forinc(i,1,t){
        if(b[i]==b[i-1]) continue;
        vector<ed> E;
        vector<qr> Q;
        reset(id,-1);
        int j=i,l=i,r=b[i]*T > t ? t : b[i]*T;
        while(j<=t && b[j]==b[i]){
            if(q[j].o==2) Q.pb(q[j]);
            j++;
        }
        sort(all(Q),[](qr i,qr j){
            return i.x>j.x;
        });
        forinc(j,1,m){
            if(nxt[cur[j]]>r) E.pb(e[j]);
        }
        sort(all(E),[](ed i,ed j){
            return i.c>j.c;
        });
        int k=0;
        forinc(j,0,Q.size()-1){
            while(k<E.size() && E[k].c>=Q[j].x){
                join(E[k].u,E[k].v);
                k++;
            }
            mode=1;
            forinc(k,l,r) if(q[k].o==1){
                if(nxt[cur[q[k].u]]>r) continue;
                if(k<Q[j].i && nxt[k]>Q[j].i && q[k].x>=Q[j].x){
                    join(e[q[k].u].u,e[q[k].u].v);
                    continue;
                }
                if(nxt[cur[q[k].u]]>Q[j].i && e[q[k].u].c>=Q[j].x){
                    join(e[q[k].u].u,e[q[k].u].v);
                }
            }
            mode=0;
            ans[Q[j].i]=-id[root(Q[j].u)];
            while(st.size()){
                auto x=st.top(); st.pop();
                id[x.x]=x.X;
                id[x.y]=x.Y;
            }
        }
        forinc(j,l,r) if(q[j].o==1){
            e[q[j].u].c=q[j].x;
            cur[q[j].u]=j;
        }
    }
    forinc(i,1,t) if(q[i].o==2) out(ans[i]),putchar('\n');
}

Compilation message

bridges.cpp:72:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
bridges.cpp: In function 'int main()':
bridges.cpp:114:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(k<E.size() && E[k].c>=Q[j].x){
                   ~^~~~~~~~~
bridges.cpp: In function 'char readchar()':
bridges.cpp:8:14: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         fread(buff,1,sz,stdin);
         ~~~~~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 3200 KB Output is correct
2 Correct 4 ms 3072 KB Output is correct
3 Correct 44 ms 3584 KB Output is correct
4 Correct 12 ms 3444 KB Output is correct
5 Correct 39 ms 3576 KB Output is correct
6 Correct 32 ms 3584 KB Output is correct
7 Correct 38 ms 3456 KB Output is correct
8 Correct 39 ms 3584 KB Output is correct
9 Correct 32 ms 3496 KB Output is correct
10 Correct 41 ms 3584 KB Output is correct
11 Correct 39 ms 3576 KB Output is correct
12 Correct 46 ms 3540 KB Output is correct
13 Correct 51 ms 3456 KB Output is correct
14 Correct 45 ms 3584 KB Output is correct
15 Correct 43 ms 3588 KB Output is correct
16 Correct 36 ms 3456 KB Output is correct
17 Correct 37 ms 3500 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1177 ms 10312 KB Output is correct
2 Correct 1238 ms 10228 KB Output is correct
3 Correct 1221 ms 10372 KB Output is correct
4 Correct 1316 ms 10404 KB Output is correct
5 Correct 1298 ms 10304 KB Output is correct
6 Correct 1976 ms 10440 KB Output is correct
7 Correct 2131 ms 10492 KB Output is correct
8 Correct 2071 ms 10524 KB Output is correct
9 Correct 82 ms 6140 KB Output is correct
10 Correct 1217 ms 10348 KB Output is correct
11 Correct 1050 ms 10332 KB Output is correct
12 Correct 920 ms 9608 KB Output is correct
13 Correct 1119 ms 10852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 955 ms 9084 KB Output is correct
2 Correct 723 ms 7264 KB Output is correct
3 Correct 1117 ms 9000 KB Output is correct
4 Correct 946 ms 9020 KB Output is correct
5 Correct 79 ms 5980 KB Output is correct
6 Correct 1092 ms 9088 KB Output is correct
7 Correct 865 ms 8992 KB Output is correct
8 Correct 771 ms 9000 KB Output is correct
9 Correct 611 ms 8376 KB Output is correct
10 Correct 567 ms 8560 KB Output is correct
11 Correct 610 ms 9336 KB Output is correct
12 Correct 538 ms 9276 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1366 ms 11984 KB Output is correct
2 Correct 82 ms 6168 KB Output is correct
3 Correct 150 ms 9724 KB Output is correct
4 Correct 86 ms 9740 KB Output is correct
5 Correct 921 ms 12068 KB Output is correct
6 Correct 1314 ms 12108 KB Output is correct
7 Correct 869 ms 12056 KB Output is correct
8 Correct 624 ms 9092 KB Output is correct
9 Correct 607 ms 8980 KB Output is correct
10 Correct 613 ms 9120 KB Output is correct
11 Correct 1014 ms 11252 KB Output is correct
12 Correct 1025 ms 10988 KB Output is correct
13 Correct 1028 ms 11016 KB Output is correct
14 Correct 810 ms 11940 KB Output is correct
15 Correct 869 ms 12016 KB Output is correct
16 Correct 1339 ms 11924 KB Output is correct
17 Correct 1370 ms 11884 KB Output is correct
18 Correct 1341 ms 12084 KB Output is correct
19 Correct 1319 ms 11988 KB Output is correct
20 Correct 1131 ms 11300 KB Output is correct
21 Correct 1209 ms 11348 KB Output is correct
22 Correct 1340 ms 11736 KB Output is correct
23 Correct 892 ms 11048 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1177 ms 10312 KB Output is correct
2 Correct 1238 ms 10228 KB Output is correct
3 Correct 1221 ms 10372 KB Output is correct
4 Correct 1316 ms 10404 KB Output is correct
5 Correct 1298 ms 10304 KB Output is correct
6 Correct 1976 ms 10440 KB Output is correct
7 Correct 2131 ms 10492 KB Output is correct
8 Correct 2071 ms 10524 KB Output is correct
9 Correct 82 ms 6140 KB Output is correct
10 Correct 1217 ms 10348 KB Output is correct
11 Correct 1050 ms 10332 KB Output is correct
12 Correct 920 ms 9608 KB Output is correct
13 Correct 1119 ms 10852 KB Output is correct
14 Correct 955 ms 9084 KB Output is correct
15 Correct 723 ms 7264 KB Output is correct
16 Correct 1117 ms 9000 KB Output is correct
17 Correct 946 ms 9020 KB Output is correct
18 Correct 79 ms 5980 KB Output is correct
19 Correct 1092 ms 9088 KB Output is correct
20 Correct 865 ms 8992 KB Output is correct
21 Correct 771 ms 9000 KB Output is correct
22 Correct 611 ms 8376 KB Output is correct
23 Correct 567 ms 8560 KB Output is correct
24 Correct 610 ms 9336 KB Output is correct
25 Correct 538 ms 9276 KB Output is correct
26 Correct 1291 ms 10380 KB Output is correct
27 Correct 1555 ms 10416 KB Output is correct
28 Correct 1295 ms 10344 KB Output is correct
29 Correct 943 ms 10400 KB Output is correct
30 Correct 1540 ms 10436 KB Output is correct
31 Correct 1536 ms 10464 KB Output is correct
32 Correct 1626 ms 10384 KB Output is correct
33 Correct 1350 ms 10384 KB Output is correct
34 Correct 1377 ms 10300 KB Output is correct
35 Correct 1366 ms 10128 KB Output is correct
36 Correct 990 ms 10124 KB Output is correct
37 Correct 973 ms 10232 KB Output is correct
38 Correct 974 ms 10088 KB Output is correct
39 Correct 742 ms 9444 KB Output is correct
40 Correct 733 ms 9460 KB Output is correct
41 Correct 724 ms 9436 KB Output is correct
42 Correct 701 ms 10484 KB Output is correct
43 Correct 717 ms 10448 KB Output is correct
44 Correct 721 ms 10548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 3200 KB Output is correct
2 Correct 4 ms 3072 KB Output is correct
3 Correct 44 ms 3584 KB Output is correct
4 Correct 12 ms 3444 KB Output is correct
5 Correct 39 ms 3576 KB Output is correct
6 Correct 32 ms 3584 KB Output is correct
7 Correct 38 ms 3456 KB Output is correct
8 Correct 39 ms 3584 KB Output is correct
9 Correct 32 ms 3496 KB Output is correct
10 Correct 41 ms 3584 KB Output is correct
11 Correct 39 ms 3576 KB Output is correct
12 Correct 46 ms 3540 KB Output is correct
13 Correct 51 ms 3456 KB Output is correct
14 Correct 45 ms 3584 KB Output is correct
15 Correct 43 ms 3588 KB Output is correct
16 Correct 36 ms 3456 KB Output is correct
17 Correct 37 ms 3500 KB Output is correct
18 Correct 1177 ms 10312 KB Output is correct
19 Correct 1238 ms 10228 KB Output is correct
20 Correct 1221 ms 10372 KB Output is correct
21 Correct 1316 ms 10404 KB Output is correct
22 Correct 1298 ms 10304 KB Output is correct
23 Correct 1976 ms 10440 KB Output is correct
24 Correct 2131 ms 10492 KB Output is correct
25 Correct 2071 ms 10524 KB Output is correct
26 Correct 82 ms 6140 KB Output is correct
27 Correct 1217 ms 10348 KB Output is correct
28 Correct 1050 ms 10332 KB Output is correct
29 Correct 920 ms 9608 KB Output is correct
30 Correct 1119 ms 10852 KB Output is correct
31 Correct 955 ms 9084 KB Output is correct
32 Correct 723 ms 7264 KB Output is correct
33 Correct 1117 ms 9000 KB Output is correct
34 Correct 946 ms 9020 KB Output is correct
35 Correct 79 ms 5980 KB Output is correct
36 Correct 1092 ms 9088 KB Output is correct
37 Correct 865 ms 8992 KB Output is correct
38 Correct 771 ms 9000 KB Output is correct
39 Correct 611 ms 8376 KB Output is correct
40 Correct 567 ms 8560 KB Output is correct
41 Correct 610 ms 9336 KB Output is correct
42 Correct 538 ms 9276 KB Output is correct
43 Correct 1366 ms 11984 KB Output is correct
44 Correct 82 ms 6168 KB Output is correct
45 Correct 150 ms 9724 KB Output is correct
46 Correct 86 ms 9740 KB Output is correct
47 Correct 921 ms 12068 KB Output is correct
48 Correct 1314 ms 12108 KB Output is correct
49 Correct 869 ms 12056 KB Output is correct
50 Correct 624 ms 9092 KB Output is correct
51 Correct 607 ms 8980 KB Output is correct
52 Correct 613 ms 9120 KB Output is correct
53 Correct 1014 ms 11252 KB Output is correct
54 Correct 1025 ms 10988 KB Output is correct
55 Correct 1028 ms 11016 KB Output is correct
56 Correct 810 ms 11940 KB Output is correct
57 Correct 869 ms 12016 KB Output is correct
58 Correct 1339 ms 11924 KB Output is correct
59 Correct 1370 ms 11884 KB Output is correct
60 Correct 1341 ms 12084 KB Output is correct
61 Correct 1319 ms 11988 KB Output is correct
62 Correct 1131 ms 11300 KB Output is correct
63 Correct 1209 ms 11348 KB Output is correct
64 Correct 1340 ms 11736 KB Output is correct
65 Correct 892 ms 11048 KB Output is correct
66 Correct 1291 ms 10380 KB Output is correct
67 Correct 1555 ms 10416 KB Output is correct
68 Correct 1295 ms 10344 KB Output is correct
69 Correct 943 ms 10400 KB Output is correct
70 Correct 1540 ms 10436 KB Output is correct
71 Correct 1536 ms 10464 KB Output is correct
72 Correct 1626 ms 10384 KB Output is correct
73 Correct 1350 ms 10384 KB Output is correct
74 Correct 1377 ms 10300 KB Output is correct
75 Correct 1366 ms 10128 KB Output is correct
76 Correct 990 ms 10124 KB Output is correct
77 Correct 973 ms 10232 KB Output is correct
78 Correct 974 ms 10088 KB Output is correct
79 Correct 742 ms 9444 KB Output is correct
80 Correct 733 ms 9460 KB Output is correct
81 Correct 724 ms 9436 KB Output is correct
82 Correct 701 ms 10484 KB Output is correct
83 Correct 717 ms 10448 KB Output is correct
84 Correct 721 ms 10548 KB Output is correct
85 Correct 1973 ms 13404 KB Output is correct
86 Correct 175 ms 11380 KB Output is correct
87 Correct 114 ms 11664 KB Output is correct
88 Correct 1483 ms 15460 KB Output is correct
89 Correct 1955 ms 17100 KB Output is correct
90 Correct 1436 ms 15144 KB Output is correct
91 Correct 1365 ms 12604 KB Output is correct
92 Correct 1346 ms 12876 KB Output is correct
93 Correct 2000 ms 12624 KB Output is correct
94 Correct 1765 ms 15344 KB Output is correct
95 Correct 1785 ms 15664 KB Output is correct
96 Correct 2169 ms 15304 KB Output is correct
97 Correct 1174 ms 14428 KB Output is correct
98 Correct 1150 ms 15732 KB Output is correct
99 Correct 2130 ms 17108 KB Output is correct
100 Correct 1995 ms 17004 KB Output is correct
101 Correct 2070 ms 17128 KB Output is correct
102 Correct 2113 ms 17044 KB Output is correct
103 Correct 2371 ms 15656 KB Output is correct
104 Correct 2330 ms 15620 KB Output is correct
105 Correct 1573 ms 16140 KB Output is correct
106 Correct 1242 ms 15612 KB Output is correct
107 Correct 1337 ms 15024 KB Output is correct
108 Correct 2044 ms 16428 KB Output is correct
109 Correct 1673 ms 14252 KB Output is correct