oj.uz

Submission #884368

# Submission time Handle Problem Language Result Execution time Memory
884368 2023-12-07T08:52:58 Z vjudge1 Plus Minus (BOI17_plusminus) C++17
100 / 100
 155 ms 24148 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define vec e.S
using namespace std;

const int MOD = 1e9 + 7;

int n[2], k, ans;
bool cnt1 = true, cnt2 = true, ch;
map<int, vector<pair<int, bool>>> a[2];

int power(int a, int b) {
    if (b == 0) return 1;
    int tmp = power(a, b / 2);
    if (b & 1) return (tmp * tmp % MOD) * a % MOD;
    return tmp * tmp % MOD;
}

int dard(int a, int b) {
    return (((a + b) % MOD) + MOD) % MOD;
}

signed main() {
    ios:: sync_with_stdio(0), cin.tie(0);
    cin >> n[0] >> n[1] >> k;
    for (int i = 1; i <= k; i++) {
        int x, y;
        char c;
        cin >> c >> x >> y;
        if ((((x + y) & 1) && c ^ '+') || ((x + y) % 2 == 0 && c == '+')) cnt1 = false;
        if ((((x + y) & 1) && c == '+') || ((x + y) % 2 == 0 && c ^ '+')) cnt2 = false;
        a[0][x].pb({y, (c == '+')});
        a[1][y].pb({x, (c == '+')});
    }
    for (int l = 0; l < 2; l++) {
        for (auto e : a[l]) {
            sort(all(vec));
            for (int i = 0; i < vec.size() - 1; i++) {
                if (vec[i].S == vec[i + 1].S && (vec[i + 1].F - vec[i].F) & 1) ch = true;
                if (vec[i].S ^ vec[i + 1].S && (vec[i + 1].F - vec[i].F) % 2 == 0) ch = true;
            }
        }
        if (!ch) ans = dard(ans, power(2, n[l] - a[l].size()));
        ch = false;
    }
    ans = dard(ans, -cnt1), ans = dard(ans, -cnt2);
    cout << ans << '\n';
}

Compilation message

plusminus.cpp: In function 'int main()':
plusminus.cpp:42:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for (int i = 0; i < vec.size() - 1; i++) {
      |                             ~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 36 ms 6128 KB Output is correct
17 Correct 42 ms 6140 KB Output is correct
18 Correct 38 ms 5972 KB Output is correct
19 Correct 35 ms 5992 KB Output is correct
20 Correct 35 ms 5912 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 36 ms 6128 KB Output is correct
17 Correct 42 ms 6140 KB Output is correct
18 Correct 38 ms 5972 KB Output is correct
19 Correct 35 ms 5992 KB Output is correct
20 Correct 35 ms 5912 KB Output is correct
21 Correct 107 ms 16216 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 122 ms 16516 KB Output is correct
24 Correct 155 ms 16212 KB Output is correct
25 Correct 100 ms 16212 KB Output is correct
26 Correct 109 ms 20048 KB Output is correct
27 Correct 137 ms 20276 KB Output is correct
28 Correct 126 ms 20280 KB Output is correct
29 Correct 128 ms 20252 KB Output is correct
30 Correct 145 ms 24148 KB Output is correct