QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#276194#7854. 这不是一道数据结构题grass8cow0 109ms161348kbC++171.8kb2023-12-05 17:56:092023-12-05 17:56:10

Judging History

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

  • [2023-12-05 17:56:10]
  • 评测
  • 测评结果:0
  • 用时:109ms
  • 内存:161348kb
  • [2023-12-05 17:56:09]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,m,jc[1010000];
#define pb push_back
vector<int>g[1010000],G[1010000],E[1010000];
set<int>s[1010000];
int dfn[1010000],low[1010000],sta[1010000],top,ru[1010000],an,ff[1010000],N;
void dfs(int x){
	dfn[x]=low[x]=++dfn[0];
	sta[++top]=x;
	for(int v:g[x]){
		if(!dfn[v]){
			dfs(v),low[x]=min(low[x],low[v]);
			if(low[v]>=dfn[x]){
				ff[v]=++N,G[N].pb(v);
				if(sta[top]!=v)an=2*an%mod;
				while(sta[top]!=v)G[N].pb(sta[top]),ru[sta[top]]++,ff[sta[top]]=N,top--;
				G[N].pb(x);
				ff[N]=x,ru[v]++,ru[x]++,top--;
			}
		}
		low[x]=min(low[x],dfn[v]);
	}
}
int U[1010000],V[1010000],yt[1010000];
int main(){
	scanf("%d%d",&n,&m);
	N=n;
	jc[0]=1;
	for(int i=1;i<=n;i++)jc[i]=1ll*i*jc[i-1]%mod;
	for(int i=1;i<=m;i++)scanf("%d%d",&U[i],&V[i]),g[U[i]].pb(V[i]),g[V[i]].pb(U[i]);
	an=n;dfs(1);
	for(int i=1;i<=n;i++)an=1ll*an*jc[ru[i]]%mod;
	memset(ru,0,sizeof(ru));
	for(int i=1;i<=m;i++){
		int u=U[i],v=V[i];
		if(ff[u]==ff[v])E[ff[u]].pb(i);
		else if(ff[ff[u]]==v)E[ff[u]].pb(i);
		else E[ff[v]].pb(i);
	}
	for(int i=n+1;i<=N;i++)if((int)G[i].size()>2){
		for(int e:E[i])s[U[e]].insert(V[e]),s[V[e]].insert(U[e]);
		queue<int>q;for(int x:G[i]){
			if(s[x].size()==2)q.push(x);
		}
		int step=(int)G[i].size();step-=2;
		while(!q.empty()&&step){
			step--;
			int u=q.front();q.pop();
			auto i1=s[u].begin(),i2=--s[u].end();
			int l=*i1,r=*i2;
			yt[u]+=2,yt[l]++,yt[r]++;
			s[l].erase(u);
			s[r].erase(u);
			if(s[l].find(r)==s[l].end())s[l].insert(r),s[r].insert(l);
			if(s[l].size()==2)q.push(l);
			if(s[r].size()==2)q.push(r);
		}
		if(step){puts("0");return 0;}
		for(int x:G[i]){
			s[x].clear();
			if(yt[x]!=2){puts("0");return 0;}
			yt[x]=0;
		}
	}
	printf("%d",an);
	return 0;
}

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 11ms
memory: 135392kb

input:

7 9
1 2
2 3
3 4
1 5
2 5
2 6
5 6
5 7
6 7

output:

0

result:

wrong answer 1st lines differ - expected: '56', found: '0'

Subtask #2:

score: 0
Wrong Answer

Test #5:

score: 0
Wrong Answer
time: 109ms
memory: 161348kb

input:

200000 199999
76849 117660
190775 11517
36929 136177
161792 186900
165326 184615
74197 120051
7891 83240
121896 35204
83314 195652
104144 158348
71191 182187
122824 50031
108950 179173
165120 190230
156949 181392
171984 82834
96017 30143
58114 108979
38698 90371
185399 171751
139913 99465
71566 1324...

output:

933899730

result:

wrong answer 1st lines differ - expected: '437454115', found: '933899730'

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 16ms
memory: 136756kb

input:

300 305
289 290
34 35
111 140
90 93
233 240
110 271
116 117
12 21
141 142
53 57
21 85
99 102
34 42
183 184
240 264
252 253
223 224
159 160
126 131
112 113
28 33
50 52
204 208
185 188
46 50
262 264
197 199
111 136
259 261
290 294
49 50
263 264
210 212
291 294
203 208
184 185
120 121
111 131
210 240
2...

output:

0

result:

wrong answer 1st lines differ - expected: '482487615', found: '0'

Subtask #5:

score: 0
Wrong Answer

Test #18:

score: 0
Wrong Answer
time: 16ms
memory: 137052kb

input:

300 500
279 256
263 65
40 62
236 256
8 193
164 235
242 256
27 219
72 244
49 253
289 261
162 113
196 199
121 222
293 245
33 186
206 279
111 139
97 15
203 24
245 157
184 59
188 90
239 283
42 5
107 108
267 51
200 126
286 282
293 59
42 261
276 216
152 6
92 220
225 69
88 166
179 109
158 144
133 18
147 18...

output:

0

result:

wrong answer 1st lines differ - expected: '159215763', found: '0'

Subtask #6:

score: 0
Wrong Answer

Test #23:

score: 0
Wrong Answer
time: 18ms
memory: 135360kb

input:

300 597
181 11
16 186
144 42
80 274
72 186
238 172
7 268
225 118
198 84
274 214
170 27
181 44
171 74
270 266
20 6
296 108
45 25
32 198
99 86
129 110
281 273
67 47
259 107
277 265
264 145
215 218
264 164
156 281
100 23
284 125
109 280
92 203
108 74
227 171
213 81
262 239
206 111
5 23
90 121
77 274
23...

output:

0

result:

wrong answer 1st lines differ - expected: '600', found: '0'

Subtask #7:

score: 0
Skipped

Dependency #4:

0%

Subtask #8:

score: 0
Skipped

Dependency #1:

0%