QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#545070#7860. Graph of Maximum Degree 3_gch_WA 40ms40808kbC++144.4kb2024-09-02 22:32:342024-09-02 22:32:37

Judging History

你现在查看的是最新测评结果

  • [2024-09-02 22:32:37]
  • 评测
  • 测评结果:WA
  • 用时:40ms
  • 内存:40808kb
  • [2024-09-02 22:32:34]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define N 150010
#define P 998244353
#define GC getchar()
#define PC putchar
using namespace std;
ll re(){
    ll s=0,b=1; char c=GC;
    while(c>'9'||c<'0'){if(c=='-')b=-b; c=GC;}
    while(c<='9'&&c>='0'){s=(s<<1)+(s<<3)+(c^48); c=GC;}
    return s*b;
}
void ks(ll s){
    if(s<0)PC('-'),s=-s;
    if(s>=10)ks(s/10); PC((s%10)|48);
}
int n,m,b[2][N][2],s[2],ds[2][N],vi[N],dl[N],h,t,ytt,yhe[N],x,y,op;
int bh[N],nn,he[N],tt,li[N],cd,zds[N];
bool V[N];
ll ans;
struct A{int ne,to,co;}yb[N<<3];
struct B{int ne,to;}B[N<<2];
map<int,int>bt[N];
void ad(int x,int y){
    B[++tt].to=y; B[tt].ne=he[x]; he[x]=tt;
    B[++tt].to=x; B[tt].ne=he[y]; he[y]=tt;
    zds[x]++; zds[y]++;
}
void dfs(int x,int f,int zz){
    li[++cd]=x; V[x]=1;
    for(int i=he[x]; i; i=B[i].ne){
        int v=B[i].to; if(v==f)continue;
        if(v==zz)op=1; else dfs(v,x,zz);
    }
}
void pd2(int x,int y){
    if(bt[x][y])ans++;
}
void pd3(int x,int y,int z){
    int s=bt[x][y]+bt[y][z]+bt[z][x];
    if(s>=2)ans++;
}
void pd4(int x,int y,int z,int a){
    int s=bt[x][y]+bt[y][z]+bt[x][z]+bt[x][a]+bt[y][a]+bt[z][a];
    //cout<<s<<endl;
    if(s>3){ans++;}
    if(s==3){
        if(bt[x][y]||bt[x][z]||bt[x][a])
         if(bt[y][x]||bt[y][z]||bt[y][a])
          if(bt[z][x]||bt[z][y]||bt[z][a])
           if(bt[a][x]||bt[a][y]||bt[a][z])ans++;
    }
}
int main(){
    //freopen("a.in","r",stdin);
    n=re(),m=re(); ans=n;
    for(int i=1; i<=m; ++i){
        x=re(),y=re(),op=re();
        s[op]++;
        b[op][s[op]][0]=x;
        b[op][s[op]][1]=y;
        ds[op][x]++; ds[op][y]++;
        yb[++ytt].to=y; yb[ytt].ne=yhe[x]; yhe[x]=ytt; yb[ytt].co=op;
        yb[++ytt].to=x; yb[ytt].ne=yhe[y]; yhe[y]=ytt; yb[ytt].co=op;
    } h=1;
    for(int i=1; i<=n; ++i)
     if(ds[0][i]==0||ds[1][i]==0)dl[++t]=i,vi[i]=1;
    while(h<=t){
        x=dl[h++];
        for(int i=yhe[x]; i; i=yb[i].ne){
            int v=yb[i].to,co=yb[i].co; ds[co][v]--;
            if(ds[co][v]==0&&!vi[v]){dl[++t]=v; vi[v]=1;}
        }
    }
    for(int i=1; i<=n; ++i) if(!vi[i])bh[i]=++nn; //cout<<nn<<endl;
    for(int i=1; i<=s[0]; ++i){
        if(bh[b[0][i][0]]&&bh[b[0][i][1]])
         ad(bh[b[0][i][0]],bh[b[0][i][1]]);
    }
    for(int i=1; i<=s[1]; ++i){
        if(bh[b[1][i][0]]&&bh[b[1][i][1]])
         bt[bh[b[1][i][0]]][bh[b[1][i][1]]]=bt[bh[b[1][i][1]]][bh[b[1][i][0]]]=1;
    }
    for(int i=1; i<=nn; ++i){
        if(V[i]==0&&zds[i]==1){
            op=cd=0; dfs(i,-1,i);// cout<<cd<<' ';
            if(cd==1)continue;
            if(cd==2){pd2(li[1],li[2]); continue;}
            else for(int j=1; j<=cd; ++j){
                if(j<cd){
                    pd2(li[j],li[j+1]);
                } else{
                    if(op)pd2(li[j],li[1]);
                }
            }
            if(cd==3){pd3(li[1],li[2],li[3]); continue;}
            else{
                for(int j=1; j<=cd; ++j){
                    if(j<cd-1)pd3(li[j],li[j+1],li[j+2]);
                     else if(op)pd3(li[j],li[j%cd+1],li[(j+1)%cd+1]);
                }
            }
            if(cd==4){pd4(li[1],li[2],li[3],li[4]); continue;}
            else{
                for(int j=1; j<=cd; ++j){
                    if(j<cd-2)pd4(li[j],li[j+1],li[j+2],li[j+3]);
                     else if(op)pd4(li[j],li[j%cd+1],li[(j+1)%cd+1],li[(j+2)%cd+1]);
                }
            }
        }
    } 
	for(int i=1; i<=nn; ++i){
        if(V[i]==0){
            op=cd=0; dfs(i,-1,i);// cout<<cd<<' ';
            if(cd==1)continue;
            if(cd==2){pd2(li[1],li[2]); continue;}
            else for(int j=1; j<=cd; ++j){
                if(j<cd){
                    pd2(li[j],li[j+1]);
                } else{
                    if(op)pd2(li[j],li[1]);
                }
            }
            if(cd==3){pd3(li[1],li[2],li[3]); continue;}
            else{
                for(int j=1; j<=cd; ++j){
                    if(j<cd-1)pd3(li[j],li[j+1],li[j+2]);
                     else if(op)pd3(li[j],li[j%cd+1],li[(j+1)%cd+1]);
                }
            }
            if(cd==4){pd4(li[1],li[2],li[3],li[4]); continue;}
            else{
                for(int j=1; j<=cd; ++j){
                    if(j<cd-2)pd4(li[j],li[j+1],li[j+2],li[j+3]);
                     else if(op)pd4(li[j],li[j%cd+1],li[(j+1)%cd+1],li[(j+2)%cd+1]);
                }
            }
        }
    }
	ks(ans);
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 20544kb

input:

3 4
1 2 0
1 3 1
2 3 0
2 3 1

output:

5

result:

ok 1 number(s): "5"

Test #2:

score: 0
Accepted
time: 0ms
memory: 17240kb

input:

4 6
1 2 0
2 3 0
3 4 0
1 4 1
2 4 1
1 3 1

output:

5

result:

ok 1 number(s): "5"

Test #3:

score: 0
Accepted
time: 3ms
memory: 17636kb

input:

20 28
9 6 1
9 6 0
3 8 0
8 4 0
3 8 1
3 4 1
2 13 0
13 1 0
19 1 0
2 1 1
2 19 1
13 19 1
14 15 1
14 15 0
7 12 0
12 17 0
20 17 0
7 17 1
7 20 1
12 20 1
16 18 0
18 10 0
5 10 0
16 10 1
16 5 1
18 5 1
4 6 0
9 11 0

output:

27

result:

ok 1 number(s): "27"

Test #4:

score: 0
Accepted
time: 0ms
memory: 17488kb

input:

100 150
93 23 0
23 81 0
76 81 0
93 81 1
93 76 1
23 76 1
100 65 0
65 56 0
19 56 0
100 56 1
100 19 1
65 19 1
2 98 0
2 98 1
26 63 0
63 90 0
26 63 1
26 90 1
6 11 0
11 67 0
6 11 1
6 67 1
37 89 0
89 64 0
25 64 0
37 64 1
37 25 1
89 25 1
84 10 0
10 29 0
75 29 0
84 29 1
84 75 1
10 75 1
7 70 1
7 70 0
28 92 0
...

output:

141

result:

ok 1 number(s): "141"

Test #5:

score: 0
Accepted
time: 27ms
memory: 32756kb

input:

100000 133680
36843 86625 0
86625 63051 0
35524 63051 0
36843 63051 1
36843 35524 1
86625 35524 1
55797 82715 0
55797 82715 1
70147 35104 0
35104 91732 0
70147 35104 1
70147 91732 1
94917 70395 0
70395 68250 0
24100 68250 0
94917 68250 1
94917 24100 1
70395 24100 1
83033 18450 1
83033 18450 0
34462 ...

output:

144604

result:

ok 1 number(s): "144604"

Test #6:

score: 0
Accepted
time: 24ms
memory: 31604kb

input:

100000 133388
86620 74346 0
74346 19047 0
54911 19047 0
86620 19047 1
86620 54911 1
74346 54911 1
23715 93094 0
93094 91208 0
63189 91208 0
23715 91208 1
23715 63189 1
93094 63189 1
99337 41426 1
99337 41426 0
83742 45546 0
45546 73862 0
83742 45546 1
83742 73862 1
85256 2812 0
2812 59368 0
85918 59...

output:

144348

result:

ok 1 number(s): "144348"

Test #7:

score: 0
Accepted
time: 36ms
memory: 37692kb

input:

100000 150000
86541 24385 0
24385 75745 0
52353 75745 0
86541 75745 1
86541 52353 1
24385 52353 1
89075 78015 0
89075 78015 1
52519 74846 0
74846 12045 0
73265 12045 0
52519 12045 1
52519 73265 1
74846 73265 1
17884 63159 0
63159 47308 0
56073 47308 0
17884 47308 1
17884 56073 1
63159 56073 1
72134 ...

output:

144639

result:

ok 1 number(s): "144639"

Test #8:

score: 0
Accepted
time: 24ms
memory: 38932kb

input:

100000 150000
91951 68612 1
91951 68612 0
18361 92673 0
92673 52678 0
86520 52678 0
18361 52678 1
18361 86520 1
92673 86520 1
58779 2421 0
58779 2421 1
66622 6461 0
6461 96943 0
66622 6461 1
66622 96943 1
27201 480 1
27201 480 0
19082 3895 0
3895 17796 0
3117 17796 0
19082 17796 1
19082 3117 1
3895 ...

output:

144471

result:

ok 1 number(s): "144471"

Test #9:

score: 0
Accepted
time: 28ms
memory: 38844kb

input:

100000 150000
43756 3552 0
3552 90269 0
43756 3552 1
43756 90269 1
11104 36935 1
11104 36935 0
11648 5480 0
5480 45320 0
11648 5480 1
11648 45320 1
19216 85746 0
19216 85746 1
68825 11173 0
11173 43155 0
68825 11173 1
68825 43155 1
27349 75259 0
27349 75259 1
1704 24478 0
24478 5980 0
1704 24478 1
1...

output:

144217

result:

ok 1 number(s): "144217"

Test #10:

score: 0
Accepted
time: 38ms
memory: 39568kb

input:

99999 149998
51151 43399 0
51151 43399 1
45978 28343 0
28343 9008 0
85724 9008 0
45978 9008 1
45978 85724 1
28343 85724 1
79446 12915 0
12915 65925 0
28869 65925 0
79446 65925 1
79446 28869 1
12915 28869 1
82642 95556 0
95556 68817 0
68334 68817 0
82642 68817 1
82642 68334 1
95556 68334 1
61212 7638...

output:

144219

result:

ok 1 number(s): "144219"

Test #11:

score: 0
Accepted
time: 40ms
memory: 40152kb

input:

100000 149999
26736 28785 0
28785 37945 0
26736 28785 1
26736 37945 1
1240 74368 0
74368 45022 0
1240 74368 1
1240 45022 1
40673 1276 0
1276 56395 0
40673 1276 1
40673 56395 1
35181 63341 0
63341 35131 0
60120 35131 0
35181 35131 1
35181 60120 1
63341 60120 1
99363 36973 0
99363 36973 1
85717 77683 ...

output:

144380

result:

ok 1 number(s): "144380"

Test #12:

score: 0
Accepted
time: 31ms
memory: 40808kb

input:

100000 150000
63695 11044 0
11044 34978 0
56531 34978 0
63695 34978 1
63695 56531 1
11044 56531 1
72139 3715 0
3715 21024 0
96696 21024 0
72139 21024 1
72139 96696 1
3715 96696 1
54670 49014 0
54670 49014 1
7670 61055 0
61055 38409 0
7670 61055 1
7670 38409 1
83399 50676 0
50676 98893 0
60069 98893 ...

output:

144559

result:

ok 1 number(s): "144559"

Test #13:

score: 0
Accepted
time: 0ms
memory: 13308kb

input:

1 0

output:

1

result:

ok 1 number(s): "1"

Test #14:

score: 0
Accepted
time: 4ms
memory: 15256kb

input:

100000 0

output:

100000

result:

ok 1 number(s): "100000"

Test #15:

score: 0
Accepted
time: 25ms
memory: 37388kb

input:

100000 150000
95066 31960 0
31960 89758 0
10935 89758 0
95066 89758 1
95066 10935 1
31960 10935 1
48016 97823 0
97823 10871 0
23454 10871 0
48016 10871 1
48016 23454 1
97823 23454 1
73749 35525 0
35525 54232 0
42182 54232 0
73749 54232 1
73749 42182 1
35525 42182 1
75405 71341 0
71341 70032 0
3284 7...

output:

125000

result:

ok 1 number(s): "125000"

Test #16:

score: 0
Accepted
time: 0ms
memory: 20220kb

input:

4 6
1 2 0
1 2 1
1 3 0
2 4 1
3 4 0
3 4 1

output:

7

result:

ok 1 number(s): "7"

Test #17:

score: -100
Wrong Answer
time: 16ms
memory: 24588kb

input:

99998 115940
40840 40839 0
28249 28248 0
24785 24783 0
36536 36534 1
71904 71901 1
62023 62021 0
34737 34740 1
18430 18434 0
27506 27505 1
4665 4664 1
36578 36577 1
99311 99314 1
43484 43482 0
26457 26459 1
99698 99695 0
10170 10172 1
98176 98179 1
47786 47785 1
56529 56531 1
86896 86895 1
78204 782...

output:

104984

result:

wrong answer 1st numbers differ - expected: '104913', found: '104984'