#define VERSION "0.1.5"
#include <cassert>
#include <cstdio>
#include <algorithm>
/** Fast allocation */
#ifdef FAST_ALLOCATOR_MEMORY
int allocator_pos = 0;
char allocator_memory[(int)FAST_ALLOCATOR_MEMORY];
inline void * operator new ( size_t n ) {
char *res = allocator_memory + allocator_pos;
allocator_pos += n;
assert(allocator_pos <= (int)FAST_ALLOCATOR_MEMORY);
return (void *)res;
}
inline void operator delete ( void * ) noexcept { }
//inline void * operator new [] ( size_t ) { assert(0); }
//inline void operator delete [] ( void * ) { assert(0); }
#endif
/** Fast input-output */
template <class T = int> inline T readInt();
inline double readDouble();
inline int readUInt();
inline int readChar(); // first non-blank character
inline void readWord( char *s );
inline bool readLine( char *s ); // do not save '\n'
inline bool isEof();
inline int getChar();
inline int peekChar();
inline bool seekEof();
inline void skipBlanks();
template <class T> inline void writeInt( T x, char end = 0, int len = -1 );
inline void writeChar( int x );
inline void writeWord( const char *s );
inline void writeDouble( double x, int len = 0 );
inline void flush();
static struct buffer_flusher_t {
~buffer_flusher_t() {
flush();
}
} buffer_flusher;
/** Read */
static const int buf_size = 4096;
static unsigned char buf[buf_size];
static int buf_len = 0, buf_pos = 0;
inline bool isEof() {
if (buf_pos == buf_len) {
buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);
if (buf_pos == buf_len)
return 1;
}
return 0;
}
inline int getChar() {
return isEof() ? -1 : buf[buf_pos++];
}
inline int peekChar() {
return isEof() ? -1 : buf[buf_pos];
}
inline bool seekEof() {
int c;
while ((c = peekChar()) != -1 && c <= 32)
buf_pos++;
return c == -1;
}
inline void skipBlanks() {
while (!isEof() && buf[buf_pos] <= 32U)
buf_pos++;
}
inline int readChar() {
int c = getChar();
while (c != -1 && c <= 32)
c = getChar();
return c;
}
inline int readUInt() {
int c = readChar(), x = 0;
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
return x;
}
template <class T>
inline T readInt() {
int s = 1, c = readChar();
T x = 0;
if (c == '-')
s = -1, c = getChar();
else if (c == '+')
c = getChar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
return s == 1 ? x : -x;
}
inline double readDouble() {
int s = 1, c = readChar();
double x = 0;
if (c == '-')
s = -1, c = getChar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
if (c == '.') {
c = getChar();
double coef = 1;
while ('0' <= c && c <= '9')
x += (c - '0') * (coef *= 1e-1), c = getChar();
}
return s == 1 ? x : -x;
}
inline void readWord( char *s ) {
int c = readChar();
while (c > 32)
*s++ = c, c = getChar();
*s = 0;
}
inline bool readLine( char *s ) {
int c = getChar();
while (c != '\n' && c != -1)
*s++ = c, c = getChar();
*s = 0;
return c != -1;
}
/** Write */
static int write_buf_pos = 0;
static char write_buf[buf_size];
inline void writeChar( int x ) {
if (write_buf_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;
write_buf[write_buf_pos++] = x;
}
inline void flush() {
if (write_buf_pos) {
fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;
fflush(stdout);
}
}
template <class T>
inline void writeInt( T x, char end, int output_len ) {
if (x < 0)
writeChar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n < output_len)
s[n++] = '0';
while (n--)
writeChar(s[n]);
if (end)
writeChar(end);
}
inline void writeWord( const char *s ) {
while (*s)
writeChar(*s++);
}
inline void writeDouble( double x, int output_len ) {
if (x < 0)
writeChar('-'), x = -x;
int t = (int)x;
writeInt(t), x -= t;
writeChar('.');
for (int i = output_len - 1; i > 0; i--) {
x *= 10;
t = std::min(9, (int)x);
writeChar('0' + t), x -= t;
}
x *= 10;
t = std::min(9, (int)(x + 0.5));
writeChar('0' + t);
}
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////
int n, m, k;
ll res = 0;
map<int, int> rcnt, rval;
map<int, int> ccnt, cval;
map<pair<int, int>, int> rooks;
void add(int r, int c, int a) {
res -= (n - ccnt[rval[r]]);
res -= (n - rcnt[cval[c]]);
if (rval[r] != cval[c]) res++;
// cout << res << endl;
rcnt[rval[r]]--;
rval[r] ^= a;
rcnt[rval[r]]++;
ccnt[cval[c]]--;
cval[c] ^= a;
ccnt[cval[c]]++;
res += (n - ccnt[rval[r]]);
res += (n - rcnt[cval[c]]);
if (rval[r] != cval[c]) res--;
rooks[{r, c}] ^= a;
}
int main() {
// FAST_IO;
// cin >> n >> m >> k;
n = readInt();
m = readInt();
k = readInt();
rcnt[0] = n; ccnt[0] = n;
rep(i, m) {
// cout << "--- " << i << " ---" << endl;
int x, y, a;
// cin >> x >> y >> a;
x = readInt();
y = readInt();
a = readInt();
add(x - 1, y - 1, a);
rooks[{x - 1, y - 1}] = a;
}
// cout << res << endl;
rep(i, k) {
// cout << "--- " << i << " ---" << '\n';
int x1, y1, x2, y2;
// cin >> x1 >> y1 >> x2 >> y2;
x1 = readInt();
y1 = readInt();
x2 = readInt();
y2 = readInt();
x1--; y1--; x2--; y2--;
int val = rooks[{x1, y1}];
add(x1, y1, val);
add(x2, y2, val);
// cout << res << '\n';
writeInt<ll>(res, '\n');
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
436 KB |
Output is correct |
| 3 |
Correct |
3 ms |
436 KB |
Output is correct |
| 4 |
Correct |
3 ms |
468 KB |
Output is correct |
| 5 |
Correct |
3 ms |
520 KB |
Output is correct |
| 6 |
Correct |
202 ms |
5612 KB |
Output is correct |
| 7 |
Correct |
197 ms |
5612 KB |
Output is correct |
| 8 |
Correct |
126 ms |
5612 KB |
Output is correct |
| 9 |
Correct |
129 ms |
5612 KB |
Output is correct |
| 10 |
Correct |
147 ms |
5612 KB |
Output is correct |
| 11 |
Correct |
1846 ms |
33716 KB |
Output is correct |
| 12 |
Execution timed out |
2020 ms |
33776 KB |
Time limit exceeded |
| 13 |
Correct |
1846 ms |
33776 KB |
Output is correct |
| 14 |
Correct |
1829 ms |
33912 KB |
Output is correct |
| 15 |
Correct |
1825 ms |
33928 KB |
Output is correct |
| 16 |
Execution timed out |
2005 ms |
33968 KB |
Time limit exceeded |
| 17 |
Correct |
1826 ms |
33968 KB |
Output is correct |
| 18 |
Correct |
1792 ms |
33968 KB |
Output is correct |
| 19 |
Correct |
1866 ms |
33968 KB |
Output is correct |
| 20 |
Correct |
1998 ms |
33968 KB |
Output is correct |
