oj.uz

Submission #440946

# Submission time Handle Problem Language Result Execution time Memory
440946 2021-07-03T15:01:45 Z S2speed Plus Minus (BOI17_plusminus) C++17
100 / 100
 68 ms 7252 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<pll , bool> pllb;
 
const ll maxn = 2e5 + 16 , md = 1e9 + 7;
 
ll tav(ll n , ll k){
	ll res = 1;
	while(k > 0){
		if(k & 1){
			res *= n; res %= md;
		}
		n *= n; n %= md;
		k >>= 1;
	}
	return res;
}
 
vector<pllb> a , b;
ll ant , bnt;
 
int main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 
	ll n , m , k;
	cin>>n>>m>>k;
	for(ll i = 0 ; i < k ; i++){
		ll v , u;
		char c;
		cin>>c>>v>>u;
		a.push_back({{v , u} , (c == '+')});
		b.push_back({{u , v} , (c == '+')});
	}
	sort(all(a)); sort(all(b));
	ant = bnt = 1;
	bool ad = false , bd = false;
	for(ll i = 1 ; i < k ; i++){
		if(a[i].first.first != a[i - 1].first.first){
			ant++;
			continue;
		}
		bool c = (a[i].first.second - a[i - 1].first.second) & 1 , d = (a[i].second ^ a[i - 1].second) , h;
		h = c ^ d;
		ad |= h;
	}
	for(ll i = 1 ; i < k ; i++){
		if(b[i].first.first != b[i - 1].first.first){
			bnt++;
			continue;
		}
		bool c = (b[i].first.second - b[i - 1].first.second) & 1 , d = (b[i].second ^ b[i - 1].second) , h;
		h = c ^ d;
		bd |= h;
	}
	if(ad & bd){
		cout<<"0\n";
		return 0;
	}
	ll ans;
	if(!ad & !bd){
		ans = tav(2 , n - ant) + tav(2 , m - bnt) - 1; if(ans >= md) ans -= md;
		if(k == 0){
			ans <<= 1;
			if(ans >= md) ans -= md;
		}
		cout<<ans<<'\n';
		return 0;
	}
	if(bd){
		ans = tav(2 , n - ant);
		cout<<ans<<'\n';
		return 0;
	}
	ans = tav(2 , m - bnt);
	cout<<ans<<'\n';
	return 0;
}

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 280 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 204 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 280 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 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 62 ms 6032 KB Output is correct
17 Correct 50 ms 6056 KB Output is correct
18 Correct 48 ms 6076 KB Output is correct
19 Correct 49 ms 6012 KB Output is correct
20 Correct 55 ms 6048 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 280 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 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 62 ms 6032 KB Output is correct
17 Correct 50 ms 6056 KB Output is correct
18 Correct 48 ms 6076 KB Output is correct
19 Correct 49 ms 6012 KB Output is correct
20 Correct 55 ms 6048 KB Output is correct
21 Correct 50 ms 6444 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 57 ms 6408 KB Output is correct
24 Correct 51 ms 6444 KB Output is correct
25 Correct 68 ms 6428 KB Output is correct
26 Correct 44 ms 6708 KB Output is correct
27 Correct 48 ms 6720 KB Output is correct
28 Correct 50 ms 6652 KB Output is correct
29 Correct 43 ms 6680 KB Output is correct
30 Correct 51 ms 7252 KB Output is correct