#include <bits/stdc++.h>
#define ii pair<int , int >
#define se second
#define fi first
using namespace std;
const int N=1e6+55;
ii tree[N*20][2];
map < ii , int > in;
map < int , ii > mx;
map < int , ii > my;
int cnt;
int columns_counter;
int rows_counter;
int newnode()
{
cnt++;
return cnt;
}
void add(int node , int i , int x , int val)
{
if(i<0)
return ;
bool bt=(x>>i)&1;
if(tree[node][bt].fi==0)
tree[node][bt].fi=newnode();
tree[node][bt].se+=val;
add(tree[node][bt].fi,i-1,x,val);
}
int get(int node , int i , int x)
{
if(i<0)
return 0;
bool bt=(x>>i)&1;
if(i==0)
return tree[node][bt].se;
return get(tree[node][bt].fi,i-1,x);
}
int main()
{
int n,k,q;
cin>>n>>k>>q;
int x,y,z;
for(int i=0;i<k;i++)
{
cout<<1<<endl;
cin>>x>>y>>z;
in.insert({{x,y},z});
my[y].fi^=z;
if(my[y].se==0)
columns_counter++;
my[y].se++;
mx[x].fi^=z;
if(mx[x].se==0)
rows_counter++;
mx[x].se++;
}
int root=newnode();
int ans=0;
for(auto t:my)
{
add(root,20,t.se.fi,+1);
}
int x1,y1;
while(q--)
{
cin>>x>>y>>x1>>y1;
z=in[{x,y}];
in[{x1,y1}]=z;
in[{x,y}]=0;
mx[x].fi^=z;
mx[x].se--;
if(!mx[x].se)
rows_counter--;
add(root,20,my[y].fi,-1);
my[y].fi^=z;
my[y].se--;
if(!my[y].se)
columns_counter--;
else
add(root,20,my[y].fi,+1);
if(!mx[x1].se)
rows_counter++;
mx[x1].se++;
mx[x1].fi^=z;
if(!my[y1].se)
columns_counter++;
else
add(root,20,my[y1].fi,-1);
my[y1].fi^=z;
my[y1].se++;
add(root,20,my[y1].fi,+1);
ans=rows_counter+columns_counter;
ans*=n;
ans-=rows_counter*columns_counter;
for(auto t:mx)
{
ans-=get(root,20,t.se.fi);
}
cout<<ans<<endl;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
1 ms |
128 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Runtime error |
1 ms |
220 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 3 |
Runtime error |
1 ms |
268 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Runtime error |
1 ms |
364 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 5 |
Runtime error |
1 ms |
364 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 6 |
Runtime error |
1 ms |
364 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 7 |
Runtime error |
1 ms |
416 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 8 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 9 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 10 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 11 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 12 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 13 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 14 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 15 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 16 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 17 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 18 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 19 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 20 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
