제출 #251700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251700		Vimmer	Topovi (COCI15_topovi)	C++14	30 / 120	16 ms	512 KiB

topovi

#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 100010
#define M ll(10007)
#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 <int, 3> a3;
typedef array <int, 4> a4;
typedef pair <int, int> pt;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
    //freopen("mining.in", "r", stdin); freopen("mining.out", "w", stdout);

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

    int n, k, p;

    cin >> n >> k >> p;

    int a[n][n];

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) a[i][j] = 0;

    for (int i = 0; i < k; i++)
    {
        int x, y, t;

        cin >> x >> y >> t;

        x--; y--;

        a[x][y] = t;
    }

    int ans = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            int x = 0;

            for (int u = 0; u < n; u++)
            {
                if (u != i) x ^= a[u][j];

                if (u != j) x ^= a[i][u];
            }

            if (x != 0) ans++;
        }

    for (; p > 0; p--)
    {
        int x, y, nx, ny;

        cin >> x >> y >> nx >> ny;

        x--; y--; nx--; ny--;

        set <pair <int, int> > se; se.clear();

        for (int i = 0; i < n; i++)
        {
            if (se.find({i, y}) == se.end())
            {
                se.insert({i, y});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != i) xr ^= a[u][y];

                    if (u != y) xr ^= a[i][u];
                }

                if (xr != 0) ans--;
            }

            if (se.find({x, i}) == se.end())
            {
                se.insert({x, i});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != x) xr ^= a[u][i];

                    if (u != i) xr ^= a[x][u];
                }

                if (xr != 0) ans--;
            }
        }

        for (int i = 0; i < n; i++)
        {
            if (se.find({i, ny}) == se.end())
            {
                se.insert({i, ny});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != i) xr ^= a[u][ny];

                    if (u != ny) xr ^= a[i][u];
                }

                if (xr != 0) ans--;
            }

            if (se.find({nx, i}) == se.end())
            {
                se.insert({nx, i});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != nx) xr ^= a[u][i];

                    if (u != i) xr ^= a[nx][u];
                }

                if (xr != 0) ans--;
            }
        }

        swap(a[nx][ny], a[x][y]);

        se.clear();

        for (int i = 0; i < n; i++)
        {
            if (se.find({i, y}) == se.end())
            {
                se.insert({i, y});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != i) xr ^= a[u][y];

                    if (u != y) xr ^= a[i][u];
                }

                if (xr != 0) ans++;
            }

            if (se.find({x, i}) == se.end())
            {
                se.insert({x, i});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != x) xr ^= a[u][i];

                    if (u != i) xr ^= a[x][u];
                }

                if (xr != 0) ans++;
            }
        }

        for (int i = 0; i < n; i++)
        {
            if (se.find({i, ny}) == se.end())
            {
                se.insert({i, ny});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != i) xr ^= a[u][ny];

                    if (u != ny) xr ^= a[i][u];
                }

                if (xr != 0) ans++;
            }

            if (se.find({nx, i}) == se.end())
            {
                se.insert({nx, i});

                int xr = 0;

                for (int u = 0; u < n; u++)
                {
                    if (u != nx) xr ^= a[u][i];

                    if (u != i) xr ^= a[nx][u];
                }

                if (xr != 0) ans++;
            }
        }

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

• Subtask 1: 30 / 120