#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
struct FenwickTree{
int n;
Vi tree;
FenwickTree(int N){
n=N;
tree.resize(N+1);
}
void upd(int i, int k)
{
while (i <= n)
{
tree[i] += k;
i += (i&-i);
}
}
int sum(int i)
{
int c = 0;
while (i > 0)
{
c += tree[i];
i -= (i&-i);
}
return c;
}
};
ll cal(int x,int y,int z,FenwickTree &LR, FenwickTree &UD)
{
int t1=LR.sum(x+z-1)-LR.sum(x-1);
int t2=UD.sum(y+z-1)-UD.sum(y-1);
bool o1=(t1==0 || t1==z);
bool o2=(t2==0 || t2==z);
if(o1 && o2)return 1;
int m=z>>1;
return cal(x,y,m,LR,UD)+cal(x+m,y,m,LR,UD)+cal(x,y+m,m,LR,UD)+cal(x+m,y+m,m,LR,UD)+1;
}
int main() {
int n,q;
scanf("%d%d",&n,&q);
FenwickTree LR(1<<n),UD(1<<n);
Vi lr((1<<n)+1),ud((1<<n)+1);
while(q--)
{
int o,x;
scanf("%d%d",&o,&x);
Vi &v= o?ud:lr;
FenwickTree &tree=o?UD:LR;
int t=v[x];
v[x]^=1;
tree.upd(x,v[x]-t);
printf("%lld\n",cal(1,1,1<<n,LR,UD));
}
}
Compilation message
collecting.cpp: In function 'int main()':
collecting.cpp:103:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&q);
~~~~~^~~~~~~~~~~~~~
collecting.cpp:109:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&o,&x);
~~~~~^~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
3 ms |
376 KB |
Output is correct |
| 3 |
Correct |
14 ms |
376 KB |
Output is correct |
| 4 |
Correct |
3 ms |
256 KB |
Output is correct |
| 5 |
Correct |
17 ms |
376 KB |
Output is correct |
| 6 |
Correct |
13 ms |
376 KB |
Output is correct |
| 7 |
Correct |
7 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5011 ms |
504 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5077 ms |
16760 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
