oj.uz

답안 #543945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543945 2022-03-31T16:54:32 Z OttoTheDino Plus Minus (BOI17_plusminus) C++17
100 / 100
 336 ms 30600 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

const ll mod = 1e9+7;

long long bin_exp (long long a, long long x) {
    long long res = 1;
    while (x>0) {
        if (x%2) res = res*a%mod;
        a = a*a%mod;
        x /= 2;
    }
    return res;
}


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

    int n, m, k; cin >> n >> m >> k;

    if (k==0) {
        cout << (bin_exp(2,n)+bin_exp(2,m)+mod-2)%mod << "\n";
        return 0;
    }

    map<int,int> rowh[2], colh[2];
    set<int> sepr, sepc;

    bool fC = 0, fR = 0;

    while (k--) {
        char x; int r, c; cin >> x >> r >> c;
        sepr.insert(r);
        sepc.insert(c);
        bool b = (x=='+')^(c%2); 
        rowh[b][r] = 1;
        if (rowh[!b][r]) fC = 1; 
        b = (x=='+')^(r%2);
        colh[b][c] = 1;
        if (colh[!b][c]) fR = 1;  
    }

    if (fC && fR) cout << "0\n";
    else if (fC) cout << bin_exp(2, m-sepc.size()) << "\n";
    else if (fR) cout << bin_exp(2, n-sepr.size()) <<"\n";
    else {
        ll res = (bin_exp(2,m-sepc.size()) + bin_exp(2,n-sepr.size()) + mod - 1) % mod;
        cout << res << "\n";
    }

    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 54 ms 1460 KB Output is correct
17 Correct 62 ms 1460 KB Output is correct
18 Correct 54 ms 1544 KB Output is correct
19 Correct 55 ms 1452 KB Output is correct
20 Correct 55 ms 1456 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 54 ms 1460 KB Output is correct
17 Correct 62 ms 1460 KB Output is correct
18 Correct 54 ms 1544 KB Output is correct
19 Correct 55 ms 1452 KB Output is correct
20 Correct 55 ms 1456 KB Output is correct
21 Correct 295 ms 18520 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 222 ms 18588 KB Output is correct
24 Correct 248 ms 18492 KB Output is correct
25 Correct 226 ms 18476 KB Output is correct
26 Correct 260 ms 25624 KB Output is correct
27 Correct 262 ms 25528 KB Output is correct
28 Correct 260 ms 25564 KB Output is correct
29 Correct 262 ms 25616 KB Output is correct
30 Correct 336 ms 30600 KB Output is correct