#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll n,k,q;cin>>n>>k>>q;
map<ll,ll> x,y;
set<PP> v;
rep(i,k){
ll a,b,c;cin>>a>>b>>c;
x[a]^=c;y[b]^=c;
v.insert(PP(a,b,c));
}
map<ll,ll> mx,my;
auto itr=x.begin();
while(itr!=x.end()){
mx[itr->se]++;itr++;
}
itr=y.begin();
while(itr!=y.end()){
my[itr->se]++;itr++;
}
mx[0]+=n-x.size();
my[0]+=n-y.size();
ll ans=0;
itr=mx.begin();
while(itr!=mx.end()){
ans+=(itr->se)*my[itr->fi];itr++;
}
rep(i,q){
ll a,b,c,d;cin>>a>>b>>c>>d;
auto it=v.lower_bound(PP(a,b,0));
ll e=get<2>(*it);
v.erase(it);
v.insert(PP(c,d,e));
set<PP> ch;
ll A=x[a],B=y[b],C=x[c],D=y[d];
if(get<0>(*ch.lower_bound(PP(A,0,0)))!=A||ch.size()==0)ch.insert(PP(A,mx[A],my[A]));
mx[A]--;
A^=e;x[a]^=e;
if(get<0>(*ch.lower_bound(PP(A,0,0)))!=A||ch.size()==0)ch.insert(PP(A,mx[A],my[A]));
mx[A]++;
if(get<0>(*ch.lower_bound(PP(C,0,0)))!=C||ch.size()==0)ch.insert(PP(C,mx[C],my[C]));
mx[C]--;
C^=e;x[c]^=e;
if(get<0>(*ch.lower_bound(PP(C,0,0)))!=C||ch.size()==0)ch.insert(PP(C,mx[C],my[C]));
mx[C]++;
if(get<0>(*ch.lower_bound(PP(B,0,0)))!=B||ch.size()==0)ch.insert(PP(B,mx[B],my[B]));
my[B]--;
B^=e;y[b]^=e;
if(get<0>(*ch.lower_bound(PP(B,0,0)))!=B||ch.size()==0)ch.insert(PP(B,mx[B],my[B]));
my[B]++;
if(get<0>(*ch.lower_bound(PP(D,0,0)))!=D||ch.size()==0)ch.insert(PP(D,mx[D],my[D]));
my[D]--;
D^=e;y[d]^=e;
if(get<0>(*ch.lower_bound(PP(D,0,0)))!=D||ch.size()==0)ch.insert(PP(D,mx[D],my[D]));
my[D]++;
auto itr=ch.begin();
while(itr!=ch.end()){
ans-=get<1>(*itr)*get<2>(*itr);
ans+=mx[get<0>(*itr)]*my[get<0>(*itr)];
itr++;
}
out(n*n-ans);
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 6 |
Correct |
193 ms |
5240 KB |
Output is correct |
| 7 |
Correct |
142 ms |
4984 KB |
Output is correct |
| 8 |
Correct |
128 ms |
4152 KB |
Output is correct |
| 9 |
Correct |
119 ms |
4288 KB |
Output is correct |
| 10 |
Correct |
135 ms |
4216 KB |
Output is correct |
| 11 |
Correct |
1683 ms |
33876 KB |
Output is correct |
| 12 |
Correct |
1854 ms |
33788 KB |
Output is correct |
| 13 |
Correct |
1812 ms |
33692 KB |
Output is correct |
| 14 |
Correct |
1829 ms |
33948 KB |
Output is correct |
| 15 |
Correct |
1686 ms |
33644 KB |
Output is correct |
| 16 |
Correct |
1692 ms |
33804 KB |
Output is correct |
| 17 |
Correct |
1767 ms |
33656 KB |
Output is correct |
| 18 |
Correct |
1736 ms |
33784 KB |
Output is correct |
| 19 |
Correct |
1785 ms |
33784 KB |
Output is correct |
| 20 |
Correct |
1652 ms |
33656 KB |
Output is correct |
