oj.uz

Submission #132505

# Submission time Handle Problem Language Result Execution time Memory
132505 2019-07-19T05:09:57 Z 이온조(#3199) Plus Minus (BOI17_plusminus) C++14
100 / 100
 161 ms 6140 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;
struct mes { int x, y, v; } A[100009];
int N, M, K, ans;

int myp(int x) {
	if(x == 0) return 1;
	int t = myp(x>>1);
	if(x&1) return 1LL*t*t%MOD*2%MOD;
	return 1LL*t*t%MOD;
}

int solve() {
	set<int> st;
	map<int, int> mp;
	for(int i=0; i<K; i++) {
		if(mp.find(A[i].x) == mp.end()) mp[A[i].x] = (A[i].y + A[i].v & 1);
		else if(mp[A[i].x] != (A[i].y + A[i].v & 1)) return 0;
		st.insert(A[i].x + A[i].y + A[i].v & 1);
	}
	ans += myp(N - (int)mp.size()); ans %= MOD;
	return ((int)st.size() == 1);
}

int main() {
	scanf("%d%d%d",&N,&M,&K);
	if(K == 0) {
		ans = (myp(N) + myp(M)) % MOD;
		printf("%d", (ans - 2 + MOD) % MOD);
		return 0;
	}
	for(int i=0; i<K; i++) {
		char c;	scanf(" %c%d%d", &c, &A[i].x, &A[i].y);
		A[i].v = (c == '+' ? 1 : 0);
	}
	int c = 0;
	for(int i=0; i<2; i++) {
		c += solve();
		swap(N, M);
		for(int j=0; j<K; j++) swap(A[j].x, A[j].y);
	}
	printf("%d", (ans - c/2 + MOD) % MOD);
	return 0;
}

Compilation message

plusminus.cpp: In function 'int solve()':
plusminus.cpp:19:56: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   if(mp.find(A[i].x) == mp.end()) mp[A[i].x] = (A[i].y + A[i].v & 1);
                                                 ~~~~~~~^~~~~~~~
plusminus.cpp:20:33: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   else if(mp[A[i].x] != (A[i].y + A[i].v & 1)) return 0;
                          ~~~~~~~^~~~~~~~
plusminus.cpp:21:29: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   st.insert(A[i].x + A[i].y + A[i].v & 1);
             ~~~~~~~~~~~~~~~~^~~~~~~~
plusminus.cpp: In function 'int main()':
plusminus.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&N,&M,&K);
  ~~~~~^~~~~~~~~~~~~~~~~~~
plusminus.cpp:35:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   char c; scanf(" %c%d%d", &c, &A[i].x, &A[i].y);
           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 252 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 27 ms 1528 KB Output is correct
17 Correct 27 ms 1528 KB Output is correct
18 Correct 27 ms 1528 KB Output is correct
19 Correct 56 ms 1528 KB Output is correct
20 Correct 56 ms 1656 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 252 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 27 ms 1528 KB Output is correct
17 Correct 27 ms 1528 KB Output is correct
18 Correct 27 ms 1528 KB Output is correct
19 Correct 56 ms 1528 KB Output is correct
20 Correct 56 ms 1656 KB Output is correct
21 Correct 161 ms 4472 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 32 ms 1432 KB Output is correct
24 Correct 32 ms 1528 KB Output is correct
25 Correct 32 ms 1528 KB Output is correct
26 Correct 82 ms 4088 KB Output is correct
27 Correct 83 ms 3824 KB Output is correct
28 Correct 114 ms 4476 KB Output is correct
29 Correct 130 ms 5368 KB Output is correct
30 Correct 159 ms 6140 KB Output is correct