oj.uz

Submission #547455

# Submission time Handle Problem Language Result Execution time Memory
547455 2022-04-10T18:28:49 Z Olympia Plus Minus (BOI17_plusminus) C++17
100 / 100
 114 ms 9456 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
int MOD = 1e9 + 7;
int64_t binPow (int64_t x, int y) {
    int64_t res = x;
    int64_t ans = 1;
    while (y > 0) {
        if (y & 1) {
            ans *= res, ans %= MOD;
        }
        res *= res, res %= MOD;
        y /= 2;
    }
    return ans;
}
int64_t solve (int N, int M, vector<pair<pair<int,int>, bool>> points) {
    map<int,int> myMap;
    for (auto& p: points) {
        if (myMap.count(p.first.first) && myMap[p.first.first] != ((p.first.second % 2) ^ p.second)) {
            return 0;
        }
        myMap[p.first.first] = ((p.first.second % 2) ^ p.second);
    }
    return binPow(2, N - myMap.size());
}
int64_t overcount (vector<pair<pair<int,int>, bool>> points) {
    if (points.empty()) return 2;
    bool f[2];
    f[0] = f[1] = true;
    for (auto& p: points) {
        f[(p.first.first % 2) ^ (p.first.second % 2) ^ p.second] = false;
    }
    return f[0] + f[1];
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M, K; cin >> N >> M >> K;
    vector<pair<pair<int,int>, bool>> points(K);
    for (int i = 0; i < K; i++) {
        char c; cin >> c;
        cin >> points[i].first.first >> points[i].first.second;
        points[i].second = (c == '+');
    }
    int64_t ans = 0;
    ans += solve(N, M, points);
    for (int i = 0; i < K; i++) {
        swap(points[i].first.first, points[i].first.second);
    }
    ans += solve(M, N, points);
    cout << (ans - overcount(points) + MOD) % MOD;

}

Compilation message

plusminus.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O3")
      | 
plusminus.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 23 ms 3532 KB Output is correct
17 Correct 18 ms 3528 KB Output is correct
18 Correct 18 ms 3612 KB Output is correct
19 Correct 46 ms 3672 KB Output is correct
20 Correct 46 ms 3660 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 23 ms 3532 KB Output is correct
17 Correct 18 ms 3528 KB Output is correct
18 Correct 18 ms 3612 KB Output is correct
19 Correct 46 ms 3672 KB Output is correct
20 Correct 46 ms 3660 KB Output is correct
21 Correct 97 ms 6732 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 25 ms 3912 KB Output is correct
24 Correct 22 ms 3916 KB Output is correct
25 Correct 19 ms 3988 KB Output is correct
26 Correct 50 ms 6744 KB Output is correct
27 Correct 52 ms 6404 KB Output is correct
28 Correct 69 ms 7160 KB Output is correct
29 Correct 88 ms 7912 KB Output is correct
30 Correct 114 ms 9456 KB Output is correct