oj.uz

Submission #932697

# Submission time Handle Problem Language Result Execution time Memory
932697 2024-02-24T03:31:03 Z gaga999 Topovi (COCI15_topovi) C++17
120 / 120
 549 ms 33464 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

llt ans = 0;
int n;
map<int, int> mx, my, cx, cy;
map<pii, int> mp;

inline void add(int x, int y, int w)
{
    int p = mx[x];
    mx[x] ^= w, ans -= n - cy[p], cx[p]--;
    p ^= w, ans += n - cy[p], cx[p]++;
    ///----
    p = my[y];
    my[y] ^= w, ans -= n - cx[p], cy[p]--;
    p ^= w, ans += n - cx[p], cy[p]++;
}

signed main()
{
    int m, q, x, y, w, a, b;
    rd(n, m, q), cx[0] = cy[0] = n;
    for (int i = 0; i < m; i++)
    {
        rd(x, y, w);
        add(x, y, w);
        mp[mpr(x, y)] = w;
    }
    while (q--)
    {
        rd(a, b, x, y);
        w = mp[mpr(a, b)];
        add(a, b, w);
        add(x, y, w);
        mp.erase(mpr(a, b));
        mp[mpr(x, y)] = w;
        prt(ans), putchar('\n');
    }
}

Subtask #1
120.0 / 120.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 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 444 KB Output is correct
6 Correct 52 ms 4936 KB Output is correct
7 Correct 36 ms 4696 KB Output is correct
8 Correct 34 ms 3912 KB Output is correct
9 Correct 30 ms 3928 KB Output is correct
10 Correct 33 ms 3920 KB Output is correct
11 Correct 450 ms 33108 KB Output is correct
12 Correct 504 ms 33464 KB Output is correct
13 Correct 496 ms 33212 KB Output is correct
14 Correct 499 ms 33220 KB Output is correct
15 Correct 549 ms 33196 KB Output is correct
16 Correct 456 ms 33356 KB Output is correct
17 Correct 484 ms 33176 KB Output is correct
18 Correct 471 ms 33152 KB Output is correct
19 Correct 529 ms 33292 KB Output is correct
20 Correct 478 ms 33364 KB Output is correct