QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#768527#5089. 环覆盖NineSuns5 319ms3808kbC++14754b2024-11-21 11:52:412024-11-21 11:52:42

Judging History

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

  • [2024-11-21 11:52:42]
  • 评测
  • 测评结果：5
  • 用时：319ms
  • 内存：3808kb
查看
  • [2024-11-21 11:52:41]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 25; 
int n, m, d[N], f[N];  
pii e[N]; 

void solve () {
	cin >> n >> m; 
	for (int i = 0;i < m;i++) {
		cin >> e[i].fi >> e[i].se; 
	}
	for (int i = 0;i < (1<<m);i++) {
		memset(d, 0, sizeof d); 
		for (int j = 0;j < m;j++) if (i>>j&1) d[e[j].fi]++, d[e[j].se]++; 
		int fl = 1; 
		for (int j = 0;j < n;j++) if (d[j]&1) fl = 0; 
		f[__builtin_popcount(i)] += fl; 
	}
	for (int i = 0;i <= m;i++) cout << f[i] << " "; 
}

signed main () {
	int T = 1; 
	while (T--) solve();
	return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 5
Accepted

Test #1:

score: 5
Accepted
time: 0ms
memory: 3804kb

input:

10 9
3 5
3 10
4 7
4 8
5 6
5 9
6 9
7 9
9 10

output:

1 0 0 1 1 1 0 0 0 0

result:

ok 10 numbers

Test #2:

score: 5
Accepted
time: 3ms
memory: 3672kb

input:

8 15
1 4
1 5
1 8
2 4
2 6
3 6
4 5
4 6
4 7
5 6
5 7
5 8
6 7
6 8
7 8

output:

1 0 0 10 18 26 46 54 43 30 18 8 2 0 0 0

result:

ok 16 numbers

Test #3:

score: 5
Accepted
time: 42ms
memory: 3808kb

input:

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

output:

1 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0

result:

ok 20 numbers

Test #4:

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

input:

7 14
1 3
1 4
1 7
2 3
2 5
2 6
2 7
3 4
3 5
3 7
4 7
5 6
5 7
6 7

output:

1 0 0 11 16 18 46 64 47 30 18 5 0 0 0

result:

ok 15 numbers

Test #5:

score: 5
Accepted
time: 0ms
memory: 3604kb

input:

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

output:

1 0 0 0 0 1 0 0 0 0

result:

ok 10 numbers

Test #6:

score: 5
Accepted
time: 2ms
memory: 3556kb

input:

15 14
2 9
2 10
3 5
3 10
3 12
3 14
4 6
5 10
5 15
6 9
6 15
7 11
7 13
9 15

output:

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

result:

ok 15 numbers

Test #7:

score: 5
Accepted
time: 0ms
memory: 3672kb

input:

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

output:

1 0 0 0 0 0 0 0 0

result:

ok 9 numbers

Test #8:

score: 5
Accepted
time: 17ms
memory: 3556kb

input:

19 18
1 5
1 9
1 15
2 4
2 11
2 15
3 6
3 8
3 17
4 19
5 12
6 13
6 15
8 10
8 15
9 19
12 17
13 16

output:

1 0 0 0 1 0 1 2 0 0 1 2 0 0 0 0 0 0 0

result:

ok 19 numbers

Test #9:

score: 5
Accepted
time: 19ms
memory: 3672kb

input:

7 18
1 2
1 3
1 4
1 6
1 7
2 3
2 5
2 6
2 7
3 4
3 5
3 7
4 5
4 6
4 7
5 6
5 7
6 7

output:

1 0 0 20 51 108 278 528 711 760 660 468 293 156 54 8 0 0 0

result:

ok 19 numbers

Test #10:

score: 5
Accepted
time: 3ms
memory: 3544kb

input:

10 15
1 6
2 4
2 6
2 9
2 10
3 5
3 8
3 9
3 10
4 5
4 8
5 8
5 10
7 9
8 9

output:

1 0 0 4 6 12 16 12 9 4 0 0 0 0 0 0

result:

ok 16 numbers

Subtask #2:

score: 0
Wrong Answer

Dependency #1:

100%
Accepted

Test #11:

score: 15
Accepted
time: 319ms
memory: 3668kb

input:

10 22
1 2
1 3
1 4
1 6
1 8
1 9
2 3
2 4
2 5
2 7
2 8
2 10
3 8
3 10
4 7
4 8
5 7
5 10
6 10
7 9
8 10
9 10

output:

1 0 0 13 33 64 162 367 621 906 1216 1343 1215 988 682 353 146 58 20 4 0 0 0

result:

ok 23 numbers

Test #12:

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

input:

11 38
1 2
1 3
1 4
1 6
1 7
1 8
1 10
2 5
2 8
2 9
2 10
2 11
3 5
3 6
3 7
3 9
3 10
3 11
4 5
4 7
4 11
5 6
5 7
5 9
5 10
5 11
6 7
6 8
6 9
6 10
6 11
7 8
7 9
7 10
8 9
8 11
9 11
10 11

output:

7 9 6 10 6 11 7 8 7 9 7 10 8 9 8 11 9 11 10 11 0 0 0 0 0 0 0 0 0 0 0 0 0 6 1 1 1 0 1

result:

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

Subtask #3:

score: 0
Runtime Error

Test #31:

score: 0
Runtime Error

input:

25 45
1 6
1 12
1 17
2 3
2 4
2 6
3 6
3 8
4 5
4 12
4 16
5 17
6 21
7 14
7 22
7 23
8 15
8 19
8 24
9 11
9 19
9 23
9 25
10 17
10 18
11 16
11 19
11 22
12 19
13 18
14 19
15 19
16 24
17 19
17 22
17 25
18 19
18 21
18 24
19 23
20 22
21 25
22 23
23 25
24 25

output:

13 19 13 18 14 19 15 19 16 24 17 19 17 22 17 25 18 19 18 21 18 24 19 23 20 22 21 25 22 23 23 25 1 3 3 4 4 2 4 0 1 0 0 0 2 0 0 0 2 5 3 3 1 3 3 3 2 12333 25 0 0 0 0 0 1518134017 0 -1111453951 0 378930993 0 291573592 0 1474897340 0 945358998 0 1691527476 0 -2145575184 0 296400770 0 823982163 0 -1349033...

result:

Subtask #4:

score: 0
Skipped

Dependency #2:

0%

Subtask #5:

score: 0
Skipped

Dependency #4:

0%
English 繁體中文 简体中文

Server Time: 2024-12-04 18:59:33 | OpenSource Project