oj.uz

Submission #701385

# Submission time Handle Problem Language Result Execution time Memory
701385 2023-02-21T06:44:14 Z amirhoseinfar1385 Plus Minus (BOI17_plusminus) C++17
100 / 100
 131 ms 14040 KB 
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
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 main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	int k;
	cin>>k;
	map<int,int>mpr,mpc;
	for(int i=0;i<k;i++){
		int u,v;
		char c;
		cin>>c;
		cin>>u>>v;
		if(c=='+'){
			if(v&1){
				mpr[u]|=1;
			}
			else{
				mpr[u]|=2;
			}
			if(u&1){
				mpc[v]|=1;
			}
			else{
				mpc[v]|=2;
			}
		}
		else{
			if(v&1){
				mpr[u]|=2;
			}
			else{
				mpr[u]|=1;
			}
			if(u&1){
				mpc[v]|=2;
			}
			else{
				mpc[v]|=1;
			}
		}
	}
	vector<pair<int,int>>allr,allc;
	for(auto x:mpr){
		allr.push_back(x);
	}
	for(auto x:mpc){
		allc.push_back(x);
	}
	sort(allr.begin(),allr.end());
	sort(allc.begin(),allc.end());
	int first=1,canfirst=1;
	for(auto x:allr){
		if(x.second==3){
	//		cout<<x.first<<" "<<x.second<<"\n";
			first=0;
		}
	}
	//cout<<first<<"\n";
	for(int i=1;i<(int)allr.size();i++){
		if((allr[i].first-allr[i-1].first)&1){
			if(allr[i].second==allr[i-1].second){
				canfirst=0;
			}
		}
		else{
			if(allr[i].second!=allr[i-1].second){
				canfirst=0;
			}
		}	
	}	
	long long res=0;
	//cout<<first<<"ads \n";
	if(first==1){
	//	cout<<(int)allr.size()<<"\n";
		res+=mypow(2,n-((int)allr.size()));
		if(canfirst==1){
			if(k==0){
				res+=mod-2;
				res%=mod;
			}
			else{
				res+=mod-1;
				res%=mod;
			}
		}
	}
	int second=1;
	for(auto x:allc){
		if(x.second==3){
			second=0;
		}
	}
	if(second==1){
		res+=mypow(2,m-((int)allc.size()));
	}
	res%=mod;
	cout<<res<<"\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 29 ms 1288 KB Output is correct
17 Correct 29 ms 1280 KB Output is correct
18 Correct 29 ms 1356 KB Output is correct
19 Correct 29 ms 1356 KB Output is correct
20 Correct 28 ms 1280 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 29 ms 1288 KB Output is correct
17 Correct 29 ms 1280 KB Output is correct
18 Correct 29 ms 1356 KB Output is correct
19 Correct 29 ms 1356 KB Output is correct
20 Correct 28 ms 1280 KB Output is correct
21 Correct 91 ms 8480 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 80 ms 8496 KB Output is correct
24 Correct 84 ms 8580 KB Output is correct
25 Correct 77 ms 8468 KB Output is correct
26 Correct 112 ms 12064 KB Output is correct
27 Correct 97 ms 12028 KB Output is correct
28 Correct 100 ms 12096 KB Output is correct
29 Correct 96 ms 12108 KB Output is correct
30 Correct 131 ms 14040 KB Output is correct