QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#33213#1861. Nondeterministic Finite AutomatonWu_RenWA 2ms3644kbC++17855b2022-05-30 11:02:542022-05-30 11:02:56

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-05-30 11:02:56]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3644kb
  • [2022-05-30 11:02:54]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int> >E[2];
vector<int>F;
int n;
void add(int u,int v,int w){
	if(w<2) E[w].push_back({u,v});
	else add(u,v,0),add(u,v,1);
}
mt19937 rng(time(0));
void sol1(){
	for(int i=0;i<n;i++) F.push_back(i);
	add(5,0,2),add(0,5,1);
	for(int i=2;i<5;i++) add(5,i,2),add(i,i,1);
	for(int i=0;i<5;i++) add(i,(i+1)%5,0);
}
void cir(int l,int r){
	for(int i=l;i<r;i++) F.push_back(i),add(i,i+1,2);
	add(r,l,2);
}
void sol2(){
	F.push_back(0);
	add(0,1,2),add(0,5,2),add(0,8,2),add(0,13,2);
	cir(1,4),cir(5,7),cir(8,12),cir(13,19);
}
int main(){
	scanf("%d",&n);
	if(n==6) sol1();
	else sol2();
	for(int k=0;k<2;k++){
		printf("%d\n",E[k].size());
		for(auto i:E[k]) printf("%d %d\n",i.first,i.second);
	}
	printf("%d\n",F.size());
	for(int i:F) printf("%d ",i);puts("");
} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 2ms
memory: 3644kb

input:

6

output:

9
5 0
5 2
5 3
5 4
0 1
1 2
2 3
3 4
4 0
8
5 0
0 5
5 2
2 2
5 3
3 3
5 4
4 4
6
0 1 2 3 4 5 

result:

wrong answer n = 6, l = 2 is to small