oj.uz

Submission #477631

# Submission time Handle Problem Language Result Execution time Memory
477631 2021-10-02T21:43:03 Z lovrot Plus Minus (BOI17_plusminus) C++11
100 / 100
 113 ms 8628 KB 
#include <bits/stdc++.h> 

#define X first
#define Y second
#define ll long long 

using namespace std; 

const int MOD = 1000000007; 

int mult(ll x, ll y){ 
	return (ll) ((x % MOD) * (y % MOD)) % MOD;
}

int power(int x, int exp){ 
	int out = 1;
	while(exp){ 
		if(exp & 1)
			out = mult(out, x);

		x = mult(x, x);

		exp /= 2;
	}
	return out;
}

map<int, bool> m; 

int count(vector< pair<int, bool> > &r, vector< pair<int, bool> > &s, int rn, int sn, int n){ 
	m.clear();

	for(int i = 0; i < n; i ++){ 
		int x = r[i].X;
		int y = s[i].X;

		bool sign = r[i].Y;

		bool should; 

		if(!(x & 1)) should = sign; 
		else should = !sign;

		if(!m.count(y)) m[y] = should;
		else if (m[y] != should)	
			return 0;
	}

	return power(2, sn - m.size());
}

int main(){ 
	ios_base::sync_with_stdio(false);

	int rn, sn, n;

	cin >> rn >> sn;

	cin >> n; 

	bool board1 = true;
	bool board2 = true;

	vector<pair< int, bool >> r, s; 

	for(int i = 0; i < n; i ++){ 
		int x, y; 
		char c;

		cin >> c >> x >> y; x--; y--; 

		bool sign = (c == '+');

		board1 &= (!(!(x & 1) ^ !(y & 1)) == sign);
		board2 &= (!(!(x & 1) ^ !(y & 1)) == !sign);		
		
		r.push_back({x, sign});
		s.push_back({y, sign});	
	}
	//cout << "check: "<< (pow(2, 3) == 8) << "\n";
	//cout << count(r, s, rn, sn, n) << ' ' << count(s, r, sn, rn, n) << ' ' <<  board1 << ' ' << board2;
	//cout << "\n" << char(254) << "\n";

	cout << (ll) (count(r, s, rn, sn, n) + count(s, r, sn, rn, n) - board1 - board2) % MOD << "\n";

	//cout << power(2, 64);
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory 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 0 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 204 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory 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 0 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 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 21 ms 3040 KB Output is correct
17 Correct 19 ms 2972 KB Output is correct
18 Correct 24 ms 3020 KB Output is correct
19 Correct 43 ms 2996 KB Output is correct
20 Correct 41 ms 3004 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory 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 0 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 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 21 ms 3040 KB Output is correct
17 Correct 19 ms 2972 KB Output is correct
18 Correct 24 ms 3020 KB Output is correct
19 Correct 43 ms 2996 KB Output is correct
20 Correct 41 ms 3004 KB Output is correct
21 Correct 92 ms 5932 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 23 ms 3520 KB Output is correct
24 Correct 21 ms 3428 KB Output is correct
25 Correct 21 ms 3388 KB Output is correct
26 Correct 59 ms 6084 KB Output is correct
27 Correct 60 ms 5904 KB Output is correct
28 Correct 72 ms 6320 KB Output is correct
29 Correct 90 ms 7212 KB Output is correct
30 Correct 113 ms 8628 KB Output is correct