oj.uz

Submission #253366

# Submission time Handle Problem Language Result Execution time Memory
253366 2020-07-27T19:03:34 Z Vimmer Topovi (COCI15_topovi) C++14
60 / 120
 2000 ms 22236 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10005
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


ll ans;

map <pair <ll, ll>, ll> a;

unordered_map <ll, ll> valx, valy, row, col;

set <ll> se;

void de(ll t, bool ob)
{
    if (ob) valx[row[t]]--; else valy[col[t]]--;
}

void ad(ll t, bool ob)
{
    if (ob) valx[row[t]]++; else  valy[col[t]]++;
}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n, k, p;

    cin >> n >> k >> p;

    for (ll i = 0; i < k; i++)
    {
        ll x, y, val;

        cin >> x >> y >> val;

        row[x] ^= val;

        col[y] ^= val;

        a[{x, y}] = val;
    }

    valy[0] = valx[0] = n;

    for (auto it : col) {valy[0]--; valy[it.S]++;}

    for (auto it : row) {valx[0]--; valx[it.S]++;}

    for (auto it : valx) ans += it.S * valy[it.F];

    for (; p > 0; p--)
    {
        ll x1, x2, y1, y2;

        cin >> x1 >> y1 >> x2 >> y2;

        ll val = a[{x2, y2}] = a[{x1, y1}];

        de(x1, 1); de(x2, 1); de(y1, 0); de(y2, 0);

        row[x1] ^= val; col[y1] ^= val; row[x2] ^= val; col[y2] ^= val;

        ad(x1, 1); ad(x2, 1); ad(y1, 0); ad(y2, 0);

        ll ans = 0;

        for (auto it : valx) ans += it.S * valy[it.F];

        cout << n * n - ans << '\n';
    }
}

Subtask #1
60.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 159 ms 5208 KB Output is correct
7 Correct 126 ms 4904 KB Output is correct
8 Correct 84 ms 3704 KB Output is correct
9 Correct 79 ms 3832 KB Output is correct
10 Correct 94 ms 3960 KB Output is correct
11 Execution timed out 2085 ms 22236 KB Time limit exceeded
12 Execution timed out 2087 ms 21756 KB Time limit exceeded
13 Execution timed out 2092 ms 21912 KB Time limit exceeded
14 Execution timed out 2089 ms 22036 KB Time limit exceeded
15 Execution timed out 2076 ms 21932 KB Time limit exceeded
16 Execution timed out 2092 ms 21884 KB Time limit exceeded
17 Execution timed out 2079 ms 22140 KB Time limit exceeded
18 Execution timed out 2091 ms 21884 KB Time limit exceeded
19 Execution timed out 2048 ms 21064 KB Time limit exceeded
20 Execution timed out 2092 ms 21308 KB Time limit exceeded