oj.uz

Submission #388490

# Submission time Handle Problem Language Result Execution time Memory
388490 2021-04-11T17:27:12 Z Return_0 Plus Minus (BOI17_plusminus) C++17
100 / 100
 228 ms 22176 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

inline ll bpow (ll x, ll n) { ll t = 1; for (; n; n >>= 1, x = 1LL * x * x % mod) if (n & 1) t = 1LL * t * x % mod; return t; }

cl N = 1e5 + 7;

ll n, m, k, ans;
map <ll, vector <array <ll, 2>>> X, Y;
bool shat1 = true, shat2 = true;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m >> k;
	for (ll i = 0, x, y; i < k; i++) {
		char c;
		cin>> c >> x >> y;
		X[x].push_back({y, c == '+'});
		Y[y].push_back({x, c == '+'});
	}

	if (!k) {
		ans = bpow(2, n) + bpow(2, m) - 2;
		ans = ((ans % mod) + mod) % mod;
		kill(ans);
	}

	for (auto &p : X) {
		sort(All(p.sc));
		for (ll i = 1; i < SZ(p.sc); i++) if (((p.sc[i][0] - p.sc[i-1][0]) & 1) ^ (p.sc[i][1] != p.sc[i-1][1])) shat1 = false;
	}
	for (auto &p : Y) {
		sort(All(p.sc));
		for (ll i = 1; i < SZ(p.sc); i++) if (((p.sc[i][0] - p.sc[i-1][0]) & 1) ^ (p.sc[i][1] != p.sc[i-1][1])) shat2 = false;
	}

	if (shat1 && shat2) {
		ans = (bpow(2, n - SZ(X)) + bpow(2, m - SZ(Y)) - 1) % mod;
		ans = (ans + mod) % mod;
	} else if (shat1) {
		ans = bpow(2, n - SZ(X));
	} else if (shat2) {
		ans = bpow(2, m - SZ(Y));
	}

	cout<< ans << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
2 4 4
+ 1 1
- 1 2
+ 1 3
- 1 4

3 3 3
- 2 1
+ 2 3
+ 3 3

4 4 0

*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 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 1 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 1 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 1 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 1 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 460 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 53 ms 2808 KB Output is correct
17 Correct 54 ms 2756 KB Output is correct
18 Correct 59 ms 2828 KB Output is correct
19 Correct 50 ms 2720 KB Output is correct
20 Correct 51 ms 2732 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 1 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 1 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 1 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 460 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 53 ms 2808 KB Output is correct
17 Correct 54 ms 2756 KB Output is correct
18 Correct 59 ms 2828 KB Output is correct
19 Correct 50 ms 2720 KB Output is correct
20 Correct 51 ms 2732 KB Output is correct
21 Correct 179 ms 13684 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 176 ms 13740 KB Output is correct
24 Correct 176 ms 13664 KB Output is correct
25 Correct 172 ms 13744 KB Output is correct
26 Correct 190 ms 18596 KB Output is correct
27 Correct 174 ms 18596 KB Output is correct
28 Correct 188 ms 18504 KB Output is correct
29 Correct 182 ms 18552 KB Output is correct
30 Correct 228 ms 22176 KB Output is correct