oj.uz

Submission #908709

# Submission time Handle Problem Language Result Execution time Memory
908709 2024-01-16T17:25:14 Z amirhoseinfar1385 Amusement Park (CEOI19_amusementpark) C++17
7 / 100
 1 ms 600 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=15,maxm=14348907,mod=998244353;
int pd[maxm],t[maxn];
long long mypow(long long m,long long y){
    if(y==0){
        return 1;
    }
    long long p=mypow(m,(y>>1));
    p*=p;
    p%=mod;
    if(y&1){
        p*=m;
        p%=mod;
    }
    return p;
}

int ww(int a){
	if(a>=mod){
		a-=mod;
	}
	return a;
}

pair<int,int>tab2(int a){
	int now=0;
	pair<int,int>ret=make_pair(0,0);
	while(a!=0){
		if(a%3==1){
			ret.first+=(1<<now);
		}else if(a%3==2){
			ret.second+=(1<<now);
		}
		now++;
		a/=3;
	}
	return ret;
}

int back3(int a,int b){
	int ret=t[a]+2*t[b];
	return ret;
}
vector<int>tartib[18];
int adj[maxn],adja[maxn];
int n,m;

void aval(){
	int nx=1;
	for(int i=0;i<(1<<n);i++){
		int now=1,ret=0;
		for(int j=0;j<n;j++){
			if((i>>j)&1){
				ret+=now;
			}
			now*=3;
		}
		t[i]=ret;
	}
	for(int i=1;i<=n;i++){
		nx*=3;
	}
	for(int i=0;i<nx;i++){
		pair<int,int>fake=tab2(i);
		tartib[__builtin_popcount(fake.first)].push_back(i);
	}
}

void solve(){
	for(int i=0;i<maxn;i++){
		for(auto x:tartib[i]){
			pair<int,int>now=tab2(x);
			for(int j=0;j<n;j++){
				if((now.second>>j)&1){
					now.second^=(1<<j);
					pair<int,int>fake=now;
					fake.first|=(1<<j);
					fake.second|=(adj[j]^(adj[j]&now.first));
					int tof=back3(fake.first,fake.second);
					pd[tof]+=pd[x];
					pd[tof]=ww(pd[tof]);
				}
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	aval();	
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		u--;
		v--;
		adj[u]|=(1<<v);
		adj[v]|=(1<<u);
		adja[u]|=(1<<v);
	}
	pd[back3(0,(1<<n)-1)]=1;
	solve();
	int res=back3((1<<n)-1,0);
	pd[res]=1ll*pd[res]*m%mod;
	pd[res]=1ll*pd[res]*mypow(2,mod-2)%mod;
	cout<<pd[res]<<"\n";
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -