oj.uz

Submission #405173

# Submission time Handle Problem Language Result Execution time Memory
405173 2021-05-15T20:19:32 Z ritul_kr_singh Plus Minus (BOI17_plusminus) C++17
100 / 100
 124 ms 17360 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

const int MOD = 1e9+7, INF = 1e18;

int p(int i){
	int res = 1, mul = 2;
	while(i){
		if(i & 1) res = (res * mul) % MOD;
		mul = (mul * mul) % MOD;
		i /= 2LL;
	}
	return res;
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, m, k; cin >> n >> m >> k;
	vector<int> xs, ys;
	array<int, 3> e[k];

	int w = - 1, ok = 1;

	for(auto &i : e){
		char j;
		cin >> j >> i[0] >> i[1];
		i[2] = j == '+';
		xs.push_back(i[0]);
		ys.push_back(i[1]);
		if(w < 0) w = (i[0] + i[1] + i[2]) % 2;
		else if(w != (i[0] + i[1] + i[2]) % 2) ok = 0;
	}

	sort(xs.begin(), xs.end());
	sort(ys.begin(), ys.end());

	vector<array<int, 2>> a[2][k];

	for(auto &i : e){
		a[0][lower_bound(xs.begin(), xs.end(), i[0])-xs.begin()].push_back({i[1], i[2]});
		a[1][lower_bound(ys.begin(), ys.end(), i[1])-ys.begin()].push_back({i[0], i[2]});
	}

	int cnt = 0, ans = 0, add = 0;

	for(int _=0; _<2; ++_){
		cnt = _ ? m : n;
		for(auto &i : a[_]){
			if(i.empty()) continue;
			--cnt;
			int z = (i[0][0]+i[0][1]) % 2;
			for(auto &j : i){
				if(z != (j[0]+j[1]) % 2) cnt = -INF;
			}
		}
		if(cnt >=0) ans += p(cnt), ++add;
	}
	if(k == 0) ans = (ans - 2 + MOD) % MOD;
	else if(add == 2) ans = (ans - ok + MOD) % MOD;
	cout << ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 79 ms 14244 KB Output is correct
17 Correct 78 ms 14308 KB Output is correct
18 Correct 78 ms 14256 KB Output is correct
19 Correct 78 ms 14316 KB Output is correct
20 Correct 77 ms 14212 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 79 ms 14244 KB Output is correct
17 Correct 78 ms 14308 KB Output is correct
18 Correct 78 ms 14256 KB Output is correct
19 Correct 78 ms 14316 KB Output is correct
20 Correct 77 ms 14212 KB Output is correct
21 Correct 108 ms 15284 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 124 ms 15348 KB Output is correct
24 Correct 105 ms 15312 KB Output is correct
25 Correct 106 ms 15364 KB Output is correct
26 Correct 89 ms 14668 KB Output is correct
27 Correct 88 ms 14508 KB Output is correct
28 Correct 101 ms 14448 KB Output is correct
29 Correct 85 ms 14484 KB Output is correct
30 Correct 109 ms 17360 KB Output is correct