Submission #951704

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
951704	2024-03-22T11:07:07 Z	vjudge1	Amusement Park (CEOI19_amusementpark)	C++17	19 / 100	3000 ms	600 KB

amusementpark

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back

int mod = 996244353;

int q[100][100], pos[100], n, m;

bool dfs(int v, int p){
	pos[v] = 1;
	int ok = 0;
	for(int i=1; i<=n; i++){
		if(i == v) continue;
		if(i == p) continue;
		if(!q[v][i]) continue;
		if(pos[i] == 1){
			return 1;
		}
		if(pos[i] == 2){
			continue;
		}
		ok |= dfs(i, v);
		if(ok){
			return 1;
		}
	}
	pos[v] = 2;
	return ok;
}


void solve(){
	cin>>n>>m;
	vector<pii> d;
	for(int i=1; i<=m; i++){
		int l, r;
		cin>>l>>r;
		d.pb({l, r});
		q[l][r] = 1;
	}
	int ans = 0;
	for(int k=0; k<(1 << m); k++){
		for(int i=0; i<m; i++){
			if((k & (1 << i))){
				q[d[i].ff][d[i].ss] = 0;
				q[d[i].ss][d[i].ff] = 1;
			}
			else{
				q[d[i].ff][d[i].ss] = 1;
				q[d[i].ss][d[i].ff] = 0;
			}               
		}             
		for(int i=1; i<=n; i++) pos[i] = 0;
		int ok = 0;
		for(int i=1; i<=n; i++){
			if(!pos[i]){
				ok |= dfs(i, 0);
				if(ok){
					break;
				}
			}
		}  
		if(!ok){
			for(int i=0; i<m; i++){
				if((k & (1 << i))) ans = (ans + 1) % mod;
			}
		}
	}
	cout<<ans;

	
}


int main(){
	solve();
}

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	440 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	4 ms	348 KB	Output is correct

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	440 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	4 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	4 ms	344 KB	Output is correct
30	Correct	29 ms	444 KB	Output is correct
31	Correct	213 ms	420 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	10 ms	440 KB	Output is correct
36	Correct	110 ms	424 KB	Output is correct
37	Correct	1920 ms	592 KB	Output is correct
38	Execution timed out	3042 ms	348 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	440 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	4 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	4 ms	344 KB	Output is correct
30	Correct	29 ms	444 KB	Output is correct
31	Correct	213 ms	420 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	10 ms	440 KB	Output is correct
36	Correct	110 ms	424 KB	Output is correct
37	Correct	1920 ms	592 KB	Output is correct
38	Execution timed out	3042 ms	348 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #5
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	440 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	4 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	4 ms	344 KB	Output is correct
30	Correct	29 ms	444 KB	Output is correct
31	Correct	213 ms	420 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	10 ms	440 KB	Output is correct
36	Correct	110 ms	424 KB	Output is correct
37	Correct	1920 ms	592 KB	Output is correct
38	Execution timed out	3042 ms	348 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Submission #951704

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 21.0

Subtask #5 0 / 37.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 21.0

Subtask #5
0 / 37.0