oj.uz

Submission #547453

# Submission time Handle Problem Language Result Execution time Memory
547453 2022-04-10T18:22:32 Z Olympia Plus Minus (BOI17_plusminus) C++17
0 / 100
 1 ms 212 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;
int64_t solve (int N, int M, vector<pair<pair<int,int>, bool>> points) {
    map<int,int> myMap;
    for (auto& p: points) {
        if (myMap[p.first.first] != ((p.first.second % 2) ^ p.second)) {
            return 0;
        }
        myMap[p.first.first] = (p.first.second % 2) ^ p.second;
    }
    return pow(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);

}

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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -