oj.uz

Submission #908702

# Submission time Handle Problem Language Result Execution time Memory
908702 2024-01-16T17:16:00 Z amirhoseinfar1385 Amusement Park (CEOI19_amusementpark) C++17
42 / 100
 3000 ms 122872 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=15,maxm=14348907,mod=998244353;
int dp[maxm],pd[maxm];
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=0,now=1;
	while(a+b!=0){
		if(a&1){
			ret+=now;
		}
		else if(b&1){
			ret+=2*now;
		}
		now*=3;
		a>>=1;
		b>>=1;
	}
	return ret;
}
vector<int>tartib[18];
int adj[maxn],adja[maxn];
int n,m;

void aval(){
	int nx=1;
	for(int i=1;i<=n;i++){
		nx*=3;
	}
	for(int i=0;i<nx;i++){
		pair<int,int>fake=tab2(i);
//		cout<<i<<" "<<fake.first<<" "<<fake.second<<"\n";
		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);
		//	cout<<now.first<<" "<<now.second<<" "<<pd[x]<<" "<<dp[x]<<endl;
			for(int j=0;j<n;j++){
				if((now.second>>j)&1){
					pair<int,int>fake=now;
					fake.first|=(1<<j);
					for(int h=0;h<=j;h++){
						if((fake.second>>h)&1){
							fake.second^=(1<<h);
						}
					}
					fake.second|=(adj[j]^(adj[j]&now.first));
					int tof=back3(fake.first,fake.second);
				//	cout<<now.first<<" "<<now.second<<" "<<fake.first<<" "<<fake.second<<" "<<adja[j]<<" salam\n";
					pd[tof]+=pd[x];
					pd[tof]=ww(pd[tof]);
			//		dp[tof]+=dp[x]+pd[x]*(__builtin_popcount(adja[j]&now.first));
				}
			}
		}
	}
}

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);
	//dp[res]=pd[res]*m;
	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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #3
23.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 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 2 ms 548 KB Output is correct
39 Correct 5 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 604 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 5 ms 600 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 5 ms 604 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 15 ms 3044 KB Output is correct
53 Correct 15 ms 2908 KB Output is correct
54 Correct 15 ms 2904 KB Output is correct
55 Correct 15 ms 2908 KB Output is correct
56 Correct 15 ms 3044 KB Output is correct
57 Correct 15 ms 2908 KB Output is correct
58 Correct 15 ms 3008 KB Output is correct
59 Correct 16 ms 2904 KB Output is correct
60 Correct 15 ms 2688 KB Output is correct
61 Correct 15 ms 2908 KB Output is correct
62 Correct 15 ms 2908 KB Output is correct
63 Correct 15 ms 2908 KB Output is correct
64 Correct 16 ms 2908 KB Output is correct

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 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 2 ms 548 KB Output is correct
39 Correct 5 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 604 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 5 ms 600 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 5 ms 604 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 15 ms 3044 KB Output is correct
53 Correct 15 ms 2908 KB Output is correct
54 Correct 15 ms 2904 KB Output is correct
55 Correct 15 ms 2908 KB Output is correct
56 Correct 15 ms 3044 KB Output is correct
57 Correct 15 ms 2908 KB Output is correct
58 Correct 15 ms 3008 KB Output is correct
59 Correct 16 ms 2904 KB Output is correct
60 Correct 15 ms 2688 KB Output is correct
61 Correct 15 ms 2908 KB Output is correct
62 Correct 15 ms 2908 KB Output is correct
63 Correct 15 ms 2908 KB Output is correct
64 Correct 16 ms 2908 KB Output is correct
65 Correct 1728 ms 42276 KB Output is correct
66 Correct 1755 ms 39352 KB Output is correct
67 Correct 1731 ms 36644 KB Output is correct
68 Correct 1721 ms 36224 KB Output is correct
69 Correct 1720 ms 43756 KB Output is correct
70 Correct 1704 ms 43532 KB Output is correct
71 Correct 1706 ms 36084 KB Output is correct
72 Correct 1709 ms 32820 KB Output is correct
73 Correct 1698 ms 43656 KB Output is correct
74 Correct 1692 ms 35872 KB Output is correct
75 Correct 1704 ms 33604 KB Output is correct
76 Correct 1685 ms 29504 KB Output is correct
77 Execution timed out 3030 ms 122872 KB Time limit exceeded
78 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 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 2 ms 548 KB Output is correct
39 Correct 5 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 5 ms 604 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 5 ms 600 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 5 ms 604 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 15 ms 3044 KB Output is correct
53 Correct 15 ms 2908 KB Output is correct
54 Correct 15 ms 2904 KB Output is correct
55 Correct 15 ms 2908 KB Output is correct
56 Correct 15 ms 3044 KB Output is correct
57 Correct 15 ms 2908 KB Output is correct
58 Correct 15 ms 3008 KB Output is correct
59 Correct 16 ms 2904 KB Output is correct
60 Correct 15 ms 2688 KB Output is correct
61 Correct 15 ms 2908 KB Output is correct
62 Correct 15 ms 2908 KB Output is correct
63 Correct 15 ms 2908 KB Output is correct
64 Correct 16 ms 2908 KB Output is correct
65 Correct 1728 ms 42276 KB Output is correct
66 Correct 1755 ms 39352 KB Output is correct
67 Correct 1731 ms 36644 KB Output is correct
68 Correct 1721 ms 36224 KB Output is correct
69 Correct 1720 ms 43756 KB Output is correct
70 Correct 1704 ms 43532 KB Output is correct
71 Correct 1706 ms 36084 KB Output is correct
72 Correct 1709 ms 32820 KB Output is correct
73 Correct 1698 ms 43656 KB Output is correct
74 Correct 1692 ms 35872 KB Output is correct
75 Correct 1704 ms 33604 KB Output is correct
76 Correct 1685 ms 29504 KB Output is correct
77 Execution timed out 3030 ms 122872 KB Time limit exceeded
78 Halted 0 ms 0 KB -