oj.uz

답안 #388214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388214 2021-04-10T14:56:33 Z negar_a Plus Minus (BOI17_plusminus) C++14
100 / 100
 524 ms 37028 KB 
//!yrt tsuj uoy srettam gnihton no emoc
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second

vector <int> r, c;
map <int, vector <int>> row, col;
map <int, map <int, int>> mat;
ll ans = 0, mod = 1e9 + 7;

ll pw(ll a, ll b){
	ll res = 1;
	while(b){
		if(b & 1){
			res = (res * a) % mod;
		}
		a = (a * a) % mod;
		b /= 2;
	}
	return res % mod;
}

int main(){
	fast_io;
	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 0; i < k; i ++){
		char ch;
		int x, y;
		cin >> ch >> x >> y;
		row[x].pb(y);
		col[y].pb(x);
		mat[x][y] = (ch == '+') - (ch == '-');
		r.pb(x); c.pb(y);
	}
	sort(r.begin(), r.end());
	sort(c.begin(), c.end());
	r.resize(distance(r.begin(), unique(r.begin(), r.end())));
	c.resize(distance(c.begin(), unique(c.begin(), c.end())));
	//fact! : ya satr ha yeki dar mioonan ya sootoon ha!
	bool f1 = true, f2 = true;
	int v1 = -1;
	for(int i : c){
		set <int> x;
		for(int j : col[i]){
			x.insert(((i + j) & 1) ^ (mat[j][i] == 1));
		}
		if((int)x.size() >= 2){
			f1 = false;	
		}
	}
	for(int i : r){
		set <int> x;
		for(int j : row[i]){
			x.insert(((i + j) & 1) ^ (mat[i][j] == 1));
		}
		if((int)x.size() >= 2){
			f2 = false;	
		}
	}
	int x = r.size(), y = c.size();
	if(f1){
//		cout << "f1!" << endl;
		ans += pw(2, m - y);
		ans %= mod;
	}
	if(f2){
//		cout << "f2!" << endl;
		ans += pw(2, n - x);
		ans %= mod;
	}
	if(f2 && f1){
//		cout << "f3!" << endl;
		ans --;
	}
	if(k == 0){
		ans --;
	}
	ans = (ans + mod) % mod;
	cout << ans;
	
	return 0;
}

Compilation message

plusminus.cpp: In function 'int main()':
plusminus.cpp:50:6: warning: unused variable 'v1' [-Wunused-variable]
   50 |  int v1 = -1;
      |      ^~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 268 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 268 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 152 ms 7104 KB Output is correct
17 Correct 148 ms 7208 KB Output is correct
18 Correct 142 ms 7204 KB Output is correct
19 Correct 150 ms 7064 KB Output is correct
20 Correct 148 ms 7156 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 268 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 152 ms 7104 KB Output is correct
17 Correct 148 ms 7208 KB Output is correct
18 Correct 142 ms 7204 KB Output is correct
19 Correct 150 ms 7064 KB Output is correct
20 Correct 148 ms 7156 KB Output is correct
21 Correct 427 ms 24476 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 454 ms 24644 KB Output is correct
24 Correct 420 ms 24524 KB Output is correct
25 Correct 487 ms 24512 KB Output is correct
26 Correct 397 ms 31060 KB Output is correct
27 Correct 421 ms 30928 KB Output is correct
28 Correct 390 ms 30972 KB Output is correct
29 Correct 405 ms 31028 KB Output is correct
30 Correct 524 ms 37028 KB Output is correct