oj.uz

답안 #714595

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714595 2023-03-25T06:16:54 Z parsadox2 Plus Minus (BOI17_plusminus) C++14
100 / 100
 578 ms 40008 KB 
#include <bits/stdc++.h>
#define pb 		push_back
#define F		first
#define S 		second
#define debug(x)    cout << #x << "= " << x << ", "
#define ll 		long long
#define fast 		ios::sync_with_stdio(false), cin.tie(0),  cout.tie(0)
#define SZ(x)         (int) x.size()
#define wall 		cout << endl;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
map <int , bool> mp_c[2][2] , vis_c , vis_r , mp_r[2][2];
bool marked[2][2];

int mpo(int a , int b)
{
	if(b == 0)  return 1;
	int tmp = mpo(a , b >> 1);
	tmp = 1LL * tmp * tmp % mod;
	if(b & 1)  tmp = 1LL * tmp * a % mod;
	return tmp;
}

int32_t main()
{
	fast;
	int n , m , k;  cin >> n >> m >> k;
	int used_row = 0 , used_col = 0;
	bool shr = true , shc = true;
	while(k--)
	{
		char c;  int row , col;
		cin >> c >> row >> col;
		int val = (c == '-' ? 0 : 1);
		mp_r[val][(col & 1)][row] = true;
		mp_c[val][(row & 1)][col] = true;
		if(!vis_r[row])  used_row++;
		if(!vis_c[col])  used_col++;
		vis_r[row] = true;
		vis_c[col] = true;
		marked[val][((row + col) & 1)] = true;
		if(mp_r[val][(col & 1) ^ 1][row] || mp_r[(val ^ 1)][(col & 1)][row])  shr = false;
		if(mp_c[val][(row & 1) ^ 1][col] || mp_c[(val ^ 1)][(row & 1)][col])  shc = false;
	}
	int ans = 0;
	if(shr)  ans = (ans + mpo(2 , n - used_row)) % mod;
	if(shc)  ans = (ans + mpo(2 , m - used_col)) % mod;
	if(!marked[1][1] && !marked[0][0])  ans--;
	if(!marked[0][1] && !marked[1][0])  ans--;
	ans = (ans + mod) % mod;
	cout << ans << endl;
	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 83 ms 1680 KB Output is correct
17 Correct 85 ms 1792 KB Output is correct
18 Correct 84 ms 1740 KB Output is correct
19 Correct 97 ms 1612 KB Output is correct
20 Correct 99 ms 1712 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 83 ms 1680 KB Output is correct
17 Correct 85 ms 1792 KB Output is correct
18 Correct 84 ms 1740 KB Output is correct
19 Correct 97 ms 1612 KB Output is correct
20 Correct 99 ms 1712 KB Output is correct
21 Correct 464 ms 25788 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 496 ms 25704 KB Output is correct
24 Correct 439 ms 25672 KB Output is correct
25 Correct 440 ms 25728 KB Output is correct
26 Correct 476 ms 33424 KB Output is correct
27 Correct 461 ms 33384 KB Output is correct
28 Correct 439 ms 33420 KB Output is correct
29 Correct 451 ms 33452 KB Output is correct
30 Correct 578 ms 40008 KB Output is correct