Submission #951700

#	Time	Username	Problem	Language	Result	Execution time	Memory
951700		vjudge1	Amusement Park (CEOI19_amusementpark)	C++17	0 / 100	1 ms	348 KiB

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);
	}
	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<n; 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;
			}
			pos[i + 1] = 0;
		}             
		int ok = 0;
		for(int i=1; i<=n; i++){
			if(!pos[i]){
				ok |= dfs(i, 0);
			}
		}  
		if(!ok){
			for(int i=0; i<n; i++){
				if((k & (1 << i))) ans = (ans + 1) % mod;
			}
		}
	}
	cout<<ans;

	
}


int main(){
	solve();
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37