QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#839834#8729. Tikvanikkkgjyismine421 1ms3844kbC++20838b2025-01-02 10:26:282025-01-02 10:26:30

Judging History

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

  • [2025-01-02 10:26:30]
  • 评测
  • 测评结果：21
  • 用时：1ms
  • 内存：3844kb
查看
  • [2025-01-02 10:26:28]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
bitset<404>f[404];
int n,m,ret;
const int mod=1e9+7;
int mul(int a,int b){return 1ll*a*b%mod;}
#define pb push_back
vector<int>rd[404];
int fa[404],vis[404],fl[404][404];
int find(int r){
	return r==fa[r]?r:(fa[r]=find(fa[r]));
}
int main(){
	ios::sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1,a,b;i<=m;++i){
		cin>>a>>b;
		rd[a].pb(b);
	}
	int ans=1;
	for(int i=n;i;--i){
		f[i][i]=1;
		for(int v:rd[i])f[i]|=f[v];
	}
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			if((f[i]&f[j]).count()>0)fl[i][j]=1;
	for(int i=n;i;--i){
		for(int j=i;j<=n;++j)fa[j]=j;
		for(int v:rd[i])
			for(int v1:rd[i])
				if(fl[v][v1])fa[find(v)]=find(v1);
		for(int v:rd[i])vis[find(v)]=1;
		for(int j=1;j<=n;++j)if(vis[j])vis[j]=0,ans=mul(ans,2);
	}
	cout<<ans;
	return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 21
Accepted

Test #1:

score: 21
Accepted
time: 1ms
memory: 3604kb

input:

6 5
3 5
2 5
1 6
4 6
2 6

output:

32

result:

ok 1 number(s): "32"

Test #2:

score: 21
Accepted
time: 0ms
memory: 3612kb

input:

6 6
2 5
1 2
3 4
5 6
3 6
1 5

output:

32

result:

ok 1 number(s): "32"

Test #3:

score: 21
Accepted
time: 0ms
memory: 3628kb

input:

6 7
3 6
1 3
3 5
2 3
1 6
2 6
2 5

output:

16

result:

ok 1 number(s): "16"

Test #4:

score: 21
Accepted
time: 0ms
memory: 3560kb

input:

6 8
1 4
2 3
5 6
3 6
4 5
2 6
4 6
1 5

output:

32

result:

ok 1 number(s): "32"

Test #5:

score: 21
Accepted
time: 0ms
memory: 3496kb

input:

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

output:

64

result:

ok 1 number(s): "64"

Test #6:

score: 21
Accepted
time: 0ms
memory: 3840kb

input:

6 8
2 3
2 4
2 5
3 6
1 6
1 2
1 4
1 5

output:

32

result:

ok 1 number(s): "32"

Test #7:

score: 21
Accepted
time: 0ms
memory: 3548kb

input:

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

output:

32

result:

ok 1 number(s): "32"

Test #8:

score: 21
Accepted
time: 0ms
memory: 3608kb

input:

6 8
2 3
1 4
2 4
3 6
1 5
5 6
1 6
2 6

output:

64

result:

ok 1 number(s): "64"

Test #9:

score: 21
Accepted
time: 0ms
memory: 3496kb

input:

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

output:

32

result:

ok 1 number(s): "32"

Test #10:

score: 21
Accepted
time: 1ms
memory: 3500kb

input:

6 8
2 3
3 4
1 5
2 4
1 4
1 3
3 5
5 6

output:

32

result:

ok 1 number(s): "32"

Test #11:

score: 21
Accepted
time: 0ms
memory: 3656kb

input:

6 7
2 6
4 5
1 2
5 6
2 4
1 5
2 5

output:

16

result:

ok 1 number(s): "16"

Test #12:

score: 21
Accepted
time: 0ms
memory: 3844kb

input:

6 8
1 6
4 5
1 3
1 2
3 6
4 6
1 4
3 4

output:

32

result:

ok 1 number(s): "32"

Test #13:

score: 21
Accepted
time: 1ms
memory: 3628kb

input:

6 15
1 5
2 5
3 4
4 5
2 4
2 6
1 4
1 3
4 6
5 6
1 2
1 6
3 5
2 3
3 6

output:

32

result:

ok 1 number(s): "32"

Subtask #2:

score: 0
Wrong Answer

Dependency #1:

100%
Accepted

Test #14:

score: 20
Accepted
time: 0ms
memory: 3780kb

input:

13 12
4 10
1 11
6 10
1 7
3 6
3 8
4 12
5 9
1 5
6 11
10 11
6 12

output:

2048

result:

ok 1 number(s): "2048"

Test #15:

score: 20
Accepted
time: 0ms
memory: 3560kb

input:

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

output:

4096

result:

ok 1 number(s): "4096"

Test #16:

score: 20
Accepted
time: 0ms
memory: 3816kb

input:

13 14
1 10
2 8
4 12
5 6
5 13
10 11
10 12
2 11
3 6
4 7
1 8
3 12
3 5
3 11

output:

8192

result:

ok 1 number(s): "8192"

Test #17:

score: 20
Accepted
time: 0ms
memory: 3568kb

input:

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

output:

8192

result:

ok 1 number(s): "8192"

Test #18:

score: 20
Accepted
time: 0ms
memory: 3812kb

input:

13 16
2 10
9 11
6 13
5 11
11 12
5 6
4 5
3 7
5 10
8 11
9 10
1 3
5 8
1 10
3 12
3 10

output:

16384

result:

ok 1 number(s): "16384"

Test #19:

score: 20
Accepted
time: 0ms
memory: 3844kb

input:

13 17
10 13
9 12
1 9
2 3
8 11
9 10
3 10
2 7
3 6
5 12
1 6
2 4
1 7
2 5
3 9
5 8
2 9

output:

16384

result:

ok 1 number(s): "16384"

Test #20:

score: 20
Accepted
time: 0ms
memory: 3772kb

input:

13 18
7 10
6 10
3 8
4 8
5 6
4 13
1 5
5 9
1 6
3 9
2 12
4 9
3 4
1 12
10 11
5 11
3 7
6 8

output:

16384

result:

ok 1 number(s): "16384"

Test #21:

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

input:

13 20
5 13
2 13
4 6
1 12
10 12
1 8
2 8
7 13
1 5
1 6
6 12
8 10
7 11
3 5
3 10
5 10
1 13
4 11
6 10
8 13

output:

8192

result:

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

Subtask #3:

score: 0
Wrong Answer

Test #25:

score: 37
Accepted
time: 0ms
memory: 3620kb

input:

50 50
29 32
3 12
36 41
10 30
6 18
20 27
14 36
4 33
6 7
17 31
33 40
2 49
19 42
3 30
2 18
11 42
21 29
11 23
1 35
32 50
22 46
6 22
42 48
15 23
7 43
11 13
5 9
40 50
25 42
5 31
27 30
1 17
14 48
5 44
35 41
1 23
10 21
40 48
12 36
13 37
23 37
23 43
19 26
6 15
13 45
19 27
17 29
20 38
29 42
26 49

output:

974740338

result:

ok 1 number(s): "974740338"

Test #26:

score: 0
Wrong Answer
time: 1ms
memory: 3680kb

input:

49 50
23 42
22 30
8 18
28 42
14 37
34 40
11 34
2 5
9 14
24 34
11 32
41 45
8 28
6 23
9 17
22 31
20 38
4 47
2 39
13 22
14 26
8 45
37 45
17 23
34 37
13 37
33 48
5 12
17 37
27 30
17 21
18 22
28 43
10 23
33 43
31 49
10 43
8 26
12 19
14 28
6 14
2 20
12 49
26 39
35 45
14 48
3 6
14 36
6 48
1 17

output:

487370169

result:

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

Subtask #4:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

0%
English 繁體中文 简体中文

Server Time: 2025-02-01 14:03:51 | OpenSource Project