Submission #956914

# Submission time Handle Problem Language Result Execution time Memory
956914 2024-04-02T16:27:46 Z Ariadna Topovi (COCI15_topovi) C++14
30 / 120
386 ms 65536 KB
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int MAX_ROOKS = 2e5;

int main() {
    int n, k, p;
    cin >> n >> k >> p;
    map<int, int> rows, columns;
    map<pair<int, int>, int> rooks;
    while (k--) {
        int r, c, x;
        cin >> r >> c >> x;
        --r; --c;
        rows[r] ^= x;
        columns[c] ^= x;
        rooks[{r, c}] = x;
    }
    ll total = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (((rows[i] ^ rooks[{i, j}]) ^ (columns[j] ^ rooks[{i, j}])) > 0) ++total;
        }
    }
    while (p--) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2; 
        --r1; --r2; --c1; --c2;
        for (int i = 0; i < n; ++i) {
            if (i == c1) continue;
            if ((columns[i] ^ rows[r1]) == rooks[{r1, c1}]) --total;
            else if ((columns[i] ^ rows[r1]) == 0) ++total;
        }
        for (int i = 0; i < n; ++i) {
            if (i == r1) continue;
            if ((columns[c1] ^ rows[i]) == rooks[{r1, c1}]) --total;
            else if ((columns[c1] ^ rows[i]) == 0) ++total;
        }
        rows[r1] ^= rooks[{r1, c1}];
        columns[c1] ^= rooks[{r1, c1}];
        rooks[{r2, c2}] = rooks[{r1, c1}];
        rooks[{r1, c1}] = 0;
        for (int i = 0; i < n; ++i) {
            if (i == c2) continue;
            if ((columns[i] ^ rows[r2]) == rooks[{r2, c2}]) --total;
            else if ((columns[i] ^ rows[r2]) == 0) ++total;
        }
        for (int i = 0; i < n; ++i) {
            if (i == r2) continue;
            if ((columns[c2] ^ rows[i]) == rooks[{r2, c2}]) --total;
            else if ((columns[c2] ^ rows[i]) == 0) ++total;
        }
        rows[r2] ^= rooks[{r2, c2}];
        columns[c2] ^= rooks[{r2, c2}];

        cout << total << '\n';
    }

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Runtime error 205 ms 65536 KB Execution killed with signal 9
7 Runtime error 262 ms 65536 KB Execution killed with signal 9
8 Runtime error 215 ms 65536 KB Execution killed with signal 9
9 Runtime error 236 ms 65536 KB Execution killed with signal 9
10 Runtime error 232 ms 65536 KB Execution killed with signal 9
11 Runtime error 364 ms 65536 KB Execution killed with signal 9
12 Runtime error 348 ms 65536 KB Execution killed with signal 9
13 Runtime error 344 ms 65536 KB Execution killed with signal 9
14 Runtime error 328 ms 65536 KB Execution killed with signal 9
15 Runtime error 386 ms 65536 KB Execution killed with signal 9
16 Runtime error 325 ms 65536 KB Execution killed with signal 9
17 Runtime error 322 ms 65536 KB Execution killed with signal 9
18 Runtime error 331 ms 65536 KB Execution killed with signal 9
19 Runtime error 345 ms 65536 KB Execution killed with signal 9
20 Runtime error 328 ms 65536 KB Execution killed with signal 9