oj.uz

답안 #879191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879191 2023-11-26T18:00:52 Z DAleksa Plus Minus (BOI17_plusminus) C++17
54 / 100
 308 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

int add(int x, int y) { x += y; return (x >= mod ? x - mod : x); }
int mul(int x, int y) { return (x * 1LL * y) % mod; }

void sadd(int& x, int y) { x = add(x, y); }
void smul(int& x, int y) { x = mul(x, y); }

int pw(int a, int n) {
    if(n == 0) return 1;
    int x = pw(a, n / 2);
    smul(x, x);
    if(n % 2 == 1) smul(x, a);
    return x;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a[n + 1], b[m + 1];
    vector<char> col(n + 1, '.'), row(m + 1, '.');
    bool can_col = true, can_row = true;
    for(int i = 0; i < k; i++) {
        char c;
        int x, y;
        cin >> c >> x >> y;
        a[x].push_back(y);
        b[y].push_back(x);
        char temp = col[x];
        if(y % 2 == 1) col[x] = c;
        else col[x] = (c ^ '+' ^ '-');
        if(temp != '.' && temp != col[x]) can_col = false;
        temp = row[y];
        if(x % 2 == 1) row[y] = c;
        else row[y] = (c ^ '+' ^ '-');
        if(temp != '.' && temp != row[y]) can_row = false;
    }
    int ans = 0;
    if(can_col) {
        int cnt = 0;
        for(int i = 1; i <= n; i++) cnt += (col[i] == '.');
        sadd(ans, pw(2, cnt));
    }
    if(can_row) {
        int cnt = 0;
        for(int i = 1; i <= m; i++) cnt += (row[i] == '.');
        sadd(ans, pw(2, cnt));
    }
    ans -= (can_col && can_row);
    ans -= (k == 0);
    cout << ans;
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 17 ms 2452 KB Output is correct
17 Correct 14 ms 2396 KB Output is correct
18 Correct 13 ms 2396 KB Output is correct
19 Correct 13 ms 2604 KB Output is correct
20 Correct 13 ms 2396 KB Output is correct

Subtask #3
0 / 46.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 17 ms 2452 KB Output is correct
17 Correct 14 ms 2396 KB Output is correct
18 Correct 13 ms 2396 KB Output is correct
19 Correct 13 ms 2604 KB Output is correct
20 Correct 13 ms 2396 KB Output is correct
21 Correct 27 ms 9812 KB Output is correct
22 Runtime error 308 ms 524288 KB Execution killed with signal 9
23 Halted 0 ms 0 KB -