| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 94371 |
2019-01-18T02:16:21 Z |
fjzzq2002 |
Game (IOI13_game) |
C++14 |
|
2 ms |
380 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
inline ull gcd(ull a,ull b)
{
if(a==0||b==0) return a^b;
#define ctz __builtin_ctzll
int shift = ctz(a | b);
b >>= ctz(b);
while (a) {
a >>= ctz(a);
if (a < b) swap(a, b);
a -= b;
}
return b << shift;
#undef ctz
}
#define SS 2600003
int an=0,ch[SS][2],sz[SS],R;
ull vv[SS],ss[SS];
ll xx[SS];
void upd(int x)
{
sz[x]=1+sz[ch[x][0]]+sz[ch[x][1]];
ss[x]=gcd(gcd(vv[x],ss[ch[x][0]]),ss[ch[x][1]]);
}
#define rnd rand
int merge(int a,int b)
{
if(a&&b);else return a^b;
if(rnd()%(sz[a]+sz[b])<sz[a])
{
ch[a][1]=merge(ch[a][1],b),upd(a);
return a;
}
else
{
ch[b][0]=merge(a,ch[b][0]),upd(b);
return b;
}
}
void split(int x,ll u,int& a,int& b)
{
if(x==0) {a=b=0; return;}
if(xx[x]<=u)
a=x, split(ch[a][1],u,ch[a][1],b), upd(a);
else
b=x, split(ch[b][0],u,a,ch[b][0]), upd(b);
}
const ll P=1.01e9;
void edt(int& u,int x,int y,ull v)
{
int A,B,C;
split(u,x*P+y-1,A,B);
split(B,x*P+y,B,C);
if(!B) B=++an,sz[B]=1,xx[B]=x*P+y;
else assert(sz[B]==1);
vv[B]=ss[B]=v;
B=merge(B,C);
u=merge(A,B);
}
inline int calc(int u,ll L,ll R)
{
if(!u) return 0;
if(xx[u]<L) return calc(ch[u][1],L,R);
if(R<xx[u]) return calc(ch[u][0],L,R);
return gcd(vv[u],gcd(calc(ch[u][0],L,R),calc(ch[u][1],L,R)));
}
inline ull qry(int& u,int l,int r)
{return calc(u,l*P-1,r*P+P-1);}
int seg_ch[SS][2],seg_ps[SS],sn=0,ro;
void edt(int& x,int l,int r,int p,int q,ull v)
{
if(!x) x=++sn; edt(seg_ps[x],q,p,v);
if(l==r) return;
int m=(l+r)>>1;
if(p<=m) edt(seg_ch[x][0],l,m,p,q,v);
else edt(seg_ch[x][1],m+1,r,p,q,v);
}
ull qry(int x,int l,int r,int pl,int pr,int sl,int sr)
{
if(r<pl||pr<l||!x||pl>pr) return 0;
if(pl<=l&&r<=pr) return qry(seg_ps[x],sl,sr);
int m=(l+r)>>1;
return gcd(qry(seg_ch[x][0],l,m,pl,pr,sl,sr),
qry(seg_ch[x][1],m+1,r,pl,pr,sl,sr));
}
void init(int R_, int C_) {
R=R_;
}
void update(int P, int Q, long long K) {
edt(ro,0,R-1,P,Q,K);
}
long long calculate(int P, int Q, int U, int V) {
return qry(ro,0,R-1,P,U,Q,V);
}
Compilation message
grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
int res;
^~~
game.cpp: In function 'void edt(int&, int, int, int, int, ull)':
game.cpp:77:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(!x) x=++sn; edt(seg_ps[x],q,p,v);
^~
game.cpp:77:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
if(!x) x=++sn; edt(seg_ps[x],q,p,v);
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
