oj.uz

Submission #630876

# Submission time Handle Problem Language Result Execution time Memory
630876 2022-08-17T09:43:57 Z minhcool Plus Minus (BOI17_plusminus) C++17
100 / 100
 276 ms 19208 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 1e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, m, k;
set<int> se, see;
set<int> se0, se1, se2, se3;

int binpw(int base, int pw){
    int ans = 1;
    while(pw){
        if(pw & 1) ans = (ans * base) % mod;
        base = (base * base) % mod;
        pw >>= 1;
    }
    return ans;
}

void process(){
	cin >> n >> m >> k;
	for(int i = 1; i <= k; i++){
	    int x, y;
	    char c;
	    cin >> c >> x >> y;
	    se.insert(x);
	    bool ck1 = (y & 1), ck2 = (c == '+');
	    if(ck1 ^ ck2) se1.insert(x);
	    else se0.insert(x);
	    ck1 = (x & 1), ck2 = (c == '+');
	    if(ck1 ^ ck2) se2.insert(y);
	    else se3.insert(y);
	    see.insert(y);
	}
	bool ok = 1;
	for(auto it : se){
	    ok &= (se0.find(it) == se0.end() || se1.find(it) == se1.end());
	}
	if(ok){
	    int temp = binpw(2, n - se.size());
	    int ways = (binpw(2, m - see.size()) + mod) % mod;
	    for(auto it : se2){
	        if(se3.find(it) != se3.end()){
	            ways = 0;
	            break;
	        }
	    }
	    bool ck0 = 1, ck1 = 1;
	    for(auto it : se2){
	        if(it & 1) ck1 = 0;
	        else ck0 = 0;
	    }
	    for(auto it : se3){
	        if(it & 1) ck0 = 0;
	        else ck1 = 0;
	    }
	    cout << (temp + ways - ck0 - ck1) % mod;
	}
	else{
	    for(auto it : se2){
	        if(se3.find(it) != se3.end()){
	            cout << 0;
	            return;
	        }
	    }
	    cout << binpw(2, m - se2.size() - se3.size());
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	process();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 44 ms 684 KB Output is correct
17 Correct 40 ms 656 KB Output is correct
18 Correct 42 ms 676 KB Output is correct
19 Correct 37 ms 556 KB Output is correct
20 Correct 37 ms 556 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 44 ms 684 KB Output is correct
17 Correct 40 ms 656 KB Output is correct
18 Correct 42 ms 676 KB Output is correct
19 Correct 37 ms 556 KB Output is correct
20 Correct 37 ms 556 KB Output is correct
21 Correct 147 ms 11720 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 196 ms 13120 KB Output is correct
24 Correct 167 ms 13188 KB Output is correct
25 Correct 192 ms 13264 KB Output is correct
26 Correct 205 ms 16044 KB Output is correct
27 Correct 201 ms 16192 KB Output is correct
28 Correct 184 ms 16096 KB Output is correct
29 Correct 186 ms 16060 KB Output is correct
30 Correct 276 ms 19208 KB Output is correct