oj.uz

Submission #550988

# Submission time Handle Problem Language Result Execution time Memory
550988 2022-04-19T16:04:15 Z blue Plus Minus (BOI17_plusminus) C++17
100 / 100
 189 ms 21100 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
#define sz(x) int(x.size())

const ll mod = 1'000'000'007LL;

ll sq(ll a)
{
	return (a*a)%mod;
}

ll mul(ll a, ll b)
{
	return (a*b)%mod;
}

ll pow(ll b, ll e)
{
	if(e == 0) return 1;
	else if(e % 2 == 0) return sq(pow(b, e/2));
	else return mul(b, pow(b, e-1));
}

ll ad(ll a, ll b)
{
	return (a+b)%mod;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int N, M, K;
	cin >> N >> M >> K;

	set<int> rows, cols;

	set<pii> R, C;
	set<int> Z;

	for(int k = 1; k <= K; k++)
	{
		char z;
		cin >> z;

		int a = (z == '+');

		int x, y;
		cin >> x >> y;

		rows.insert(x);
		cols.insert(y);

		R.insert({x, a ^ (y % 2)});
		C.insert({y, a ^ (x % 2)});
		Z.insert(a ^ (x % 2) ^ (y % 2));
	}

	ll res = 0;

	// cerr << sz(rows) << ' ' << sz(cols) << '\n';


	if(sz(R) == sz(rows))
	{
		res = ad(res, pow(2, N - sz(rows)));
	}

	if(sz(C) == sz(cols))
	{
		res = ad(res, pow(2, M - sz(cols)));
	}
	// cerr << "\n";

	if(sz(Z) <= 1)
	{
		res = (res + mod - 1) % mod;
	}
	if(sz(Z) <= 0)
	{
		res = (res + mod - 1) % 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 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 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 320 KB Output is correct
9 Correct 1 ms 316 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 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 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 320 KB Output is correct
9 Correct 1 ms 316 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 316 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 456 KB Output is correct
16 Correct 53 ms 1460 KB Output is correct
17 Correct 52 ms 1536 KB Output is correct
18 Correct 50 ms 1476 KB Output is correct
19 Correct 47 ms 1356 KB Output is correct
20 Correct 44 ms 1364 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 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 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 320 KB Output is correct
9 Correct 1 ms 316 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 316 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 456 KB Output is correct
16 Correct 53 ms 1460 KB Output is correct
17 Correct 52 ms 1536 KB Output is correct
18 Correct 50 ms 1476 KB Output is correct
19 Correct 47 ms 1356 KB Output is correct
20 Correct 44 ms 1364 KB Output is correct
21 Correct 129 ms 13004 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 178 ms 14356 KB Output is correct
24 Correct 152 ms 14308 KB Output is correct
25 Correct 167 ms 14364 KB Output is correct
26 Correct 156 ms 17764 KB Output is correct
27 Correct 157 ms 17668 KB Output is correct
28 Correct 156 ms 17756 KB Output is correct
29 Correct 148 ms 17772 KB Output is correct
30 Correct 189 ms 21100 KB Output is correct