oj.uz

답안 #377099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377099 2021-03-13T02:43:59 Z couplefire 다리 (APIO19_bridges) C++17
100 / 100
 2111 ms 17192 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]
   72 | main(){
      |      ^
bridges.cpp: In function 'int main()':
bridges.cpp:114:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<ed>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             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]
    8 |         fread(buff,1,sz,stdin);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3052 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 38 ms 3840 KB Output is correct
4 Correct 11 ms 3584 KB Output is correct
5 Correct 35 ms 3564 KB Output is correct
6 Correct 29 ms 3564 KB Output is correct
7 Correct 35 ms 3564 KB Output is correct
8 Correct 38 ms 3564 KB Output is correct
9 Correct 39 ms 3564 KB Output is correct
10 Correct 37 ms 3564 KB Output is correct
11 Correct 36 ms 3692 KB Output is correct
12 Correct 38 ms 3564 KB Output is correct
13 Correct 46 ms 3564 KB Output is correct
14 Correct 43 ms 3564 KB Output is correct
15 Correct 42 ms 3584 KB Output is correct
16 Correct 35 ms 3692 KB Output is correct
17 Correct 36 ms 3564 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1269 ms 10368 KB Output is correct
2 Correct 1333 ms 10320 KB Output is correct
3 Correct 1345 ms 10284 KB Output is correct
4 Correct 1390 ms 10496 KB Output is correct
5 Correct 1379 ms 10216 KB Output is correct
6 Correct 2029 ms 10400 KB Output is correct
7 Correct 2008 ms 10428 KB Output is correct
8 Correct 1995 ms 10452 KB Output is correct
9 Correct 82 ms 6124 KB Output is correct
10 Correct 1209 ms 10380 KB Output is correct
11 Correct 1142 ms 10420 KB Output is correct
12 Correct 1185 ms 9700 KB Output is correct
13 Correct 1182 ms 10472 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1111 ms 8940 KB Output is correct
2 Correct 849 ms 6964 KB Output is correct
3 Correct 1244 ms 8984 KB Output is correct
4 Correct 1014 ms 8876 KB Output is correct
5 Correct 82 ms 5868 KB Output is correct
6 Correct 1140 ms 8864 KB Output is correct
7 Correct 1002 ms 9048 KB Output is correct
8 Correct 848 ms 8664 KB Output is correct
9 Correct 719 ms 8312 KB Output is correct
10 Correct 666 ms 8236 KB Output is correct
11 Correct 670 ms 8860 KB Output is correct
12 Correct 619 ms 9216 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1504 ms 11720 KB Output is correct
2 Correct 81 ms 5868 KB Output is correct
3 Correct 145 ms 9516 KB Output is correct
4 Correct 80 ms 9532 KB Output is correct
5 Correct 945 ms 11868 KB Output is correct
6 Correct 1433 ms 11764 KB Output is correct
7 Correct 933 ms 11696 KB Output is correct
8 Correct 685 ms 8896 KB Output is correct
9 Correct 709 ms 8716 KB Output is correct
10 Correct 690 ms 8816 KB Output is correct
11 Correct 1116 ms 11148 KB Output is correct
12 Correct 1085 ms 11064 KB Output is correct
13 Correct 1118 ms 10972 KB Output is correct
14 Correct 881 ms 11780 KB Output is correct
15 Correct 896 ms 12000 KB Output is correct
16 Correct 1451 ms 11816 KB Output is correct
17 Correct 1462 ms 11688 KB Output is correct
18 Correct 1441 ms 11736 KB Output is correct
19 Correct 1447 ms 11844 KB Output is correct
20 Correct 1248 ms 11188 KB Output is correct
21 Correct 1237 ms 11544 KB Output is correct
22 Correct 1401 ms 11552 KB Output is correct
23 Correct 909 ms 10904 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1269 ms 10368 KB Output is correct
2 Correct 1333 ms 10320 KB Output is correct
3 Correct 1345 ms 10284 KB Output is correct
4 Correct 1390 ms 10496 KB Output is correct
5 Correct 1379 ms 10216 KB Output is correct
6 Correct 2029 ms 10400 KB Output is correct
7 Correct 2008 ms 10428 KB Output is correct
8 Correct 1995 ms 10452 KB Output is correct
9 Correct 82 ms 6124 KB Output is correct
10 Correct 1209 ms 10380 KB Output is correct
11 Correct 1142 ms 10420 KB Output is correct
12 Correct 1185 ms 9700 KB Output is correct
13 Correct 1182 ms 10472 KB Output is correct
14 Correct 1111 ms 8940 KB Output is correct
15 Correct 849 ms 6964 KB Output is correct
16 Correct 1244 ms 8984 KB Output is correct
17 Correct 1014 ms 8876 KB Output is correct
18 Correct 82 ms 5868 KB Output is correct
19 Correct 1140 ms 8864 KB Output is correct
20 Correct 1002 ms 9048 KB Output is correct
21 Correct 848 ms 8664 KB Output is correct
22 Correct 719 ms 8312 KB Output is correct
23 Correct 666 ms 8236 KB Output is correct
24 Correct 670 ms 8860 KB Output is correct
25 Correct 619 ms 9216 KB Output is correct
26 Correct 1264 ms 10068 KB Output is correct
27 Correct 1637 ms 10264 KB Output is correct
28 Correct 1367 ms 10064 KB Output is correct
29 Correct 994 ms 10272 KB Output is correct
30 Correct 1573 ms 10212 KB Output is correct
31 Correct 1596 ms 10300 KB Output is correct
32 Correct 1598 ms 10244 KB Output is correct
33 Correct 1331 ms 10220 KB Output is correct
34 Correct 1353 ms 10032 KB Output is correct
35 Correct 1342 ms 10052 KB Output is correct
36 Correct 1041 ms 10252 KB Output is correct
37 Correct 1031 ms 10140 KB Output is correct
38 Correct 1018 ms 10100 KB Output is correct
39 Correct 872 ms 9384 KB Output is correct
40 Correct 864 ms 9316 KB Output is correct
41 Correct 864 ms 9316 KB Output is correct
42 Correct 761 ms 10352 KB Output is correct
43 Correct 771 ms 10328 KB Output is correct
44 Correct 768 ms 10472 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3052 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 38 ms 3840 KB Output is correct
4 Correct 11 ms 3584 KB Output is correct
5 Correct 35 ms 3564 KB Output is correct
6 Correct 29 ms 3564 KB Output is correct
7 Correct 35 ms 3564 KB Output is correct
8 Correct 38 ms 3564 KB Output is correct
9 Correct 39 ms 3564 KB Output is correct
10 Correct 37 ms 3564 KB Output is correct
11 Correct 36 ms 3692 KB Output is correct
12 Correct 38 ms 3564 KB Output is correct
13 Correct 46 ms 3564 KB Output is correct
14 Correct 43 ms 3564 KB Output is correct
15 Correct 42 ms 3584 KB Output is correct
16 Correct 35 ms 3692 KB Output is correct
17 Correct 36 ms 3564 KB Output is correct
18 Correct 1269 ms 10368 KB Output is correct
19 Correct 1333 ms 10320 KB Output is correct
20 Correct 1345 ms 10284 KB Output is correct
21 Correct 1390 ms 10496 KB Output is correct
22 Correct 1379 ms 10216 KB Output is correct
23 Correct 2029 ms 10400 KB Output is correct
24 Correct 2008 ms 10428 KB Output is correct
25 Correct 1995 ms 10452 KB Output is correct
26 Correct 82 ms 6124 KB Output is correct
27 Correct 1209 ms 10380 KB Output is correct
28 Correct 1142 ms 10420 KB Output is correct
29 Correct 1185 ms 9700 KB Output is correct
30 Correct 1182 ms 10472 KB Output is correct
31 Correct 1111 ms 8940 KB Output is correct
32 Correct 849 ms 6964 KB Output is correct
33 Correct 1244 ms 8984 KB Output is correct
34 Correct 1014 ms 8876 KB Output is correct
35 Correct 82 ms 5868 KB Output is correct
36 Correct 1140 ms 8864 KB Output is correct
37 Correct 1002 ms 9048 KB Output is correct
38 Correct 848 ms 8664 KB Output is correct
39 Correct 719 ms 8312 KB Output is correct
40 Correct 666 ms 8236 KB Output is correct
41 Correct 670 ms 8860 KB Output is correct
42 Correct 619 ms 9216 KB Output is correct
43 Correct 1504 ms 11720 KB Output is correct
44 Correct 81 ms 5868 KB Output is correct
45 Correct 145 ms 9516 KB Output is correct
46 Correct 80 ms 9532 KB Output is correct
47 Correct 945 ms 11868 KB Output is correct
48 Correct 1433 ms 11764 KB Output is correct
49 Correct 933 ms 11696 KB Output is correct
50 Correct 685 ms 8896 KB Output is correct
51 Correct 709 ms 8716 KB Output is correct
52 Correct 690 ms 8816 KB Output is correct
53 Correct 1116 ms 11148 KB Output is correct
54 Correct 1085 ms 11064 KB Output is correct
55 Correct 1118 ms 10972 KB Output is correct
56 Correct 881 ms 11780 KB Output is correct
57 Correct 896 ms 12000 KB Output is correct
58 Correct 1451 ms 11816 KB Output is correct
59 Correct 1462 ms 11688 KB Output is correct
60 Correct 1441 ms 11736 KB Output is correct
61 Correct 1447 ms 11844 KB Output is correct
62 Correct 1248 ms 11188 KB Output is correct
63 Correct 1237 ms 11544 KB Output is correct
64 Correct 1401 ms 11552 KB Output is correct
65 Correct 909 ms 10904 KB Output is correct
66 Correct 1264 ms 10068 KB Output is correct
67 Correct 1637 ms 10264 KB Output is correct
68 Correct 1367 ms 10064 KB Output is correct
69 Correct 994 ms 10272 KB Output is correct
70 Correct 1573 ms 10212 KB Output is correct
71 Correct 1596 ms 10300 KB Output is correct
72 Correct 1598 ms 10244 KB Output is correct
73 Correct 1331 ms 10220 KB Output is correct
74 Correct 1353 ms 10032 KB Output is correct
75 Correct 1342 ms 10052 KB Output is correct
76 Correct 1041 ms 10252 KB Output is correct
77 Correct 1031 ms 10140 KB Output is correct
78 Correct 1018 ms 10100 KB Output is correct
79 Correct 872 ms 9384 KB Output is correct
80 Correct 864 ms 9316 KB Output is correct
81 Correct 864 ms 9316 KB Output is correct
82 Correct 761 ms 10352 KB Output is correct
83 Correct 771 ms 10328 KB Output is correct
84 Correct 768 ms 10472 KB Output is correct
85 Correct 1928 ms 13544 KB Output is correct
86 Correct 173 ms 11580 KB Output is correct
87 Correct 111 ms 11508 KB Output is correct
88 Correct 1346 ms 15344 KB Output is correct
89 Correct 1928 ms 16872 KB Output is correct
90 Correct 1349 ms 15120 KB Output is correct
91 Correct 1389 ms 12660 KB Output is correct
92 Correct 1386 ms 12656 KB Output is correct
93 Correct 2013 ms 12636 KB Output is correct
94 Correct 1711 ms 15464 KB Output is correct
95 Correct 1680 ms 15596 KB Output is correct
96 Correct 1936 ms 15308 KB Output is correct
97 Correct 1133 ms 14524 KB Output is correct
98 Correct 1099 ms 15572 KB Output is correct
99 Correct 1980 ms 17112 KB Output is correct
100 Correct 1963 ms 17192 KB Output is correct
101 Correct 2009 ms 17024 KB Output is correct
102 Correct 1997 ms 17172 KB Output is correct
103 Correct 2111 ms 16008 KB Output is correct
104 Correct 2101 ms 15576 KB Output is correct
105 Correct 1547 ms 15972 KB Output is correct
106 Correct 1259 ms 15580 KB Output is correct
107 Correct 1578 ms 14924 KB Output is correct
108 Correct 1964 ms 16612 KB Output is correct
109 Correct 1475 ms 14364 KB Output is correct