QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#140167#5413. 同构判定鸡Lynkcat#5 1ms3708kbC++17956b2023-08-15 11:02:452024-07-04 01:43:13

Judging History

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

  • [2024-07-04 01:43:13]
  • 评测
  • 测评结果：5
  • 用时：1ms
  • 内存：3708kb
查看
  • [2023-08-15 11:02:45]
  • 提交

answer

#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
//#define int ll
//#define N
using namespace std;
int id;
int n,m;
void BellaKira()
{
	cin>>n>>m;
	for (int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
	}
	if (id==1)
	{
		cin>>n>>m;
		cout<<n<<" "<<n/2*(n-n/2)<<'\n';
		for (int i=1;i<=n/2;i++)
			for (int j=n/2+1;j<=n;j++)
				cout<<i<<" "<<j<<'\n';
		return;
	}
	if (id==2)
	{
		int o,p;
		cin>>o>>p;
		cout<<n<<" "<<n*(n-1)/2-1<<'\n';
		for (int i=1;i<=n;i++)
			for (int j=i+1;j<=n;j++)
			{
				if (i==n-1&&j==n) return;
				cout<<i<<" "<<j<<'\n';
			}
		return;
	}
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;cin>>T>>id;
	while (T--)
	{
		BellaKira();
	}
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 5
Accepted
time: 1ms
memory: 3708kb

input:

10 1
3 3
1 2
1 3
2 3
33 272
3 3
1 2
1 3
2 3
28 196
3 3
1 2
1 3
2 3
92 2116
3 3
1 2
1 3
2 3
29 210
3 3
1 2
1 3
2 3
62 961
3 3
1 2
1 3
2 3
97 2352
3 3
1 2
1 3
2 3
60 900
3 3
1 2
1 3
2 3
70 1225
3 3
1 2
1 3
2 3
67 1122
3 3
1 2
1 3
2 3
67 1122

output:

33 272
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
2 17
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
2 27
2 28
2 29
2 30
2 31
2 32
2 33
3 17
3 18
3 19
3 20
3 21
3 22
3 23
3 24
3 25
3 26
3 27
3 28
3 29
3 30
3 31
3 32
3 33
4 17
4 18
4 19
4 20
4 21
4 22
4 23
4 2...

result:

ok correct! (10 test cases)

Test #2:

score: 0
Wrong Answer
time: 0ms
memory: 3556kb

input:

10 2
5 10
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
4 5
28 293
8 28
1 2
1 3
1 4
1 5
1 6
1 7
1 8
2 3
2 4
2 5
2 6
2 7
2 8
3 4
3 5
3 6
3 7
3 8
4 5
4 6
4 7
4 8
5 6
5 7
5 8
6 7
6 8
7 8
8 26
4 6
1 2
1 3
1 4
2 3
2 4
3 4
82 2240
3 3
1 2
1 3
2 3
46 528
4 6
1 2
1 3
1 4
2 3
2 4
3 4
42 587
9 36
1 2
1 3
1 4
1 5
1 6
1 ...

output:

5 9
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
8 27
1 2
1 3
1 4
1 5
1 6
1 7
1 8
2 3
2 4
2 5
2 6
2 7
2 8
3 4
3 5
3 6
3 7
3 8
4 5
4 6
4 7
4 8
5 6
5 7
5 8
6 7
6 8
4 5
1 2
1 3
1 4
2 3
2 4
3 2
1 2
1 3
4 5
1 2
1 3
1 4
2 3
2 4
9 35
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
2 3
2 4
2 5
2 6
2 7
2 8
2 9
3 4
3 5
3 6
3 7
3 8
3 ...

result:

wrong answer Integer parameter [name=m] equals to 9, violates the range [293, 10] (test case 1)

Test #3:

score: 0
Wrong Answer
time: 0ms
memory: 3508kb

input:

10 3
4 4
1 2
2 3
3 4
4 1
387 774
4 4
1 2
2 3
3 4
4 1
668 1336
4 4
1 2
2 3
3 4
4 1
1403 2806
4 4
1 2
2 3
3 4
4 1
1516 3032
4 4
1 2
2 3
3 4
4 1
1601 3202
4 4
1 2
2 3
3 4
4 1
1649 3298
4 4
1 2
2 3
3 4
4 1
1722 3444
4 4
1 2
2 3
3 4
4 1
1854 3708
4 4
1 2
2 3
3 4
4 1
1926 3852
4 4
1 2
2 3
3 4
4 1
1989 3978

output:

result:

wrong output format Unexpected end of file - int32 expected (test case 1)

Test #4:

score: 0
Wrong Answer
time: 0ms
memory: 3552kb

input:

10 4
4 4
1 2
2 3
3 4
4 1
169 1014
4 4
1 2
2 3
3 4
4 1
529 5819
4 4
1 2
2 3
3 4
4 1
841 11774
4 4
1 2
2 3
3 4
4 1
961 14415
4 4
1 2
2 3
3 4
4 1
1369 24642
4 4
1 2
2 3
3 4
4 1
1681 33620
4 4
1 2
2 3
3 4
4 1
1849 38829
4 4
1 2
2 3
3 4
4 1
361 3249
4 4
1 2
2 3
3 4
4 1
289 2312
4 4
1 2
2 3
3 4
4 1
9 9

output:

result:

wrong output format Unexpected end of file - int32 expected (test case 1)

Test #5:

score: 0
Wrong Answer
time: 0ms
memory: 3548kb

input:

1 5
4 4
1 2
2 3
3 4
4 1
2850 24300

output:

result:

wrong output format Unexpected end of file - int32 expected

Test #6:

score: 0
Wrong Answer
time: 0ms
memory: 3664kb

input:

1 6
6 9
1 4
1 5
1 6
2 4
2 5
2 6
3 4
3 5
3 6
343 2350

output:

result:

wrong output format Unexpected end of file - int32 expected
English 繁體中文 简体中文

Server Time: 2024-11-30 12:43:33 | OpenSource Project