1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef uint32_t ul;
typedef int32_t l;
typedef uint64_t ull;
typedef int64_t ll;

template <typename T>
using statistics_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const l INF = 1000000000 + 9;
const ll MOD = 123456789;
const l PRIME = 200003;
const ll L_INF = 1000000000000000000LL + 7;
const double EPS = 1e-5;

#define FOR(x, y, z) for (l z = x; z < y; z++)
#define FORE(x, y, z) for (l z = x; z <= y; z++)
#define FORD(x, y, z) for (l z = x; z > y; z--)
#define FORDE(x, y, z) for (l z = x; z >= y; z--)
#define REP(x, y) for (l y = 0; y < x; y++)
#define ALL(...) (__VA_ARGS__).begin(), (__VA_ARGS__).end()

#define PF push_front
#define POF pop_front
#define PB push_back
#define POB pop_back
#define MP make_pair
#define FS first
#define SC second

const l MAXN = 2005;

l n, m, q, full_row, full_col, black;
l arr[MAXN][MAXN], col[MAXN], row[MAXN];

l calc()
{
    l white{0};

    FORE(1, n, i)
        FORE(1, n, j)
            if (arr[i][j] == 0 && (row[i] || col[j]))
                white++;

    return min(white, black - full_col * full_row);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> m >> q;

    FORE(1, m, i)
    {
        l a, b, c, d;
        cin >> a >> c >> b >> d;

        arr[a][c] ^= 1;
        arr[a][d + 1] ^= 1;
        arr[b + 1][c] ^= 1;
        arr[b + 1][d + 1] ^= 1;
    }


    FORE(1, n, i)
        FORE(1, n, j)
        {
            arr[i][j] = arr[i - 1][j] ^ arr[i][j - 1] ^ arr[i - 1][j - 1] ^ arr[i][j];

            if (arr[i][j])
            {
                black++;

                row[i]++;
                if (row[i] == n)
                    full_row++;

                col[j]++;
                if (col[j] == n)
                    full_col++;
            }
        }

    cout << calc() << "\n";
    FORE(1, q, i)
    {
        l a, b;
        cin >> a >> b;

        arr[a][b] ^= 1;

        if (arr[a][b] == 0)
        {
            black--;

            row[a]--;
            if (row[a] == n - 1)
                full_row--;

            col[b]--;
            if (col[b] == n - 1)
                full_col--;
        }

        else
        {
            black++;

            row[a]++;
            if (row[a] == n)
                full_row++;

            col[b]++;
            if (col[b] == n)
                full_col++;
        }

        cout << calc() << "\n";
    }
}