oj.uz

Submission #239810

# Submission time Handle Problem Language Result Execution time Memory
239810 2020-06-17T10:28:11 Z dsjong Plus Minus (BOI17_plusminus) C++14
100 / 100
 386 ms 12128 KB 
#include <bits/stdc++.h>
using namespace std;
long long MOD=1e9+7;
long long modpow(long long x, long long e){
	if(e==0) return 1;
	long long y=modpow(x, e/2);
	if(e%2==0) return (y*y)%MOD;
	return (((y*y)%MOD)*x)%MOD;
}
map<int, int>col, row;
int main(){
	long long n, m, k;
	cin>>n>>m>>k;
	set<int>chess;
	long long good1=1, good2=1, setrows=0, setcols=0;
	for(int i=1;i<=k;i++){
		char c;
		int x, y, s;
		cin>>c>>x>>y;
		if(c=='+') s=1;
		else s=0;
		chess.insert((x+y+s)%2);
		int row_cur=1, col_cur=1;
		if((s+y)%2==0) row_cur=2;
		if((s+x)%2==0) col_cur=2;
		if(!row[x]){
			setrows++;
			row[x]=row_cur;
		}
		else{
			if(row[x]!=row_cur) good1=0;
		}
		if(!col[y]){
			setcols++;
			col[y]=col_cur;
		}
		else{
			if(col[y]!=col_cur) good2=0;
		}
	}
	//cout<<setrows<<" "<<setcols<<" "<<good1<<" "<<good2<<endl;
	long long ans=(modpow(2, n-setrows)*good1 + modpow(2, m-setcols)*good2)%MOD;
	//cout<<ans<<endl;
	if(k==0) ans=(ans+MOD-2)%MOD;
	else if(chess.size()==1 && good1) ans=(ans+MOD-1)%MOD;
	cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 126 ms 1340 KB Output is correct
17 Correct 112 ms 1376 KB Output is correct
18 Correct 114 ms 1376 KB Output is correct
19 Correct 111 ms 1376 KB Output is correct
20 Correct 108 ms 1400 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 126 ms 1340 KB Output is correct
17 Correct 112 ms 1376 KB Output is correct
18 Correct 114 ms 1376 KB Output is correct
19 Correct 111 ms 1376 KB Output is correct
20 Correct 108 ms 1400 KB Output is correct
21 Correct 248 ms 7288 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 270 ms 7416 KB Output is correct
24 Correct 248 ms 7288 KB Output is correct
25 Correct 258 ms 7416 KB Output is correct
26 Correct 275 ms 9952 KB Output is correct
27 Correct 301 ms 9996 KB Output is correct
28 Correct 278 ms 9976 KB Output is correct
29 Correct 272 ms 10104 KB Output is correct
30 Correct 386 ms 12128 KB Output is correct