# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
477724 |
2021-10-03T10:28:03 Z |
pypcdev |
Game (IOI13_game) |
C++17 |
|
0 ms |
0 KB |
#include<bits/stdc++.h>
#include"game.h"
typedef long long ll;
#define int ll
using namespace std;
const int MAX=1e10;
struct gcdNode{
gcdNode*left;gcdNode*right;
long long val;
gcdNode(){
val=0;
left=NULL;
right=NULL;
}
void try_create(gcdNode*&root){
if(root==NULL)root=new gcdNode();
}
};
long long gcd(long long left,long long right){
if(left==0&&right==0)return 0;
if(left==0||right==0)return left^right;
return __gcd(left,right);
}
long long merge(long long left,long long right){
return gcd(left,right);
}
struct segTreeNode{
gcdNode*root;
segTreeNode*left;segTreeNode*right;
segTreeNode(){
root=new gcdNode();
left=NULL;
right=NULL;
}
void try_create(segTreeNode*&v){
if(v==NULL)v=new segTreeNode();
}
long long get(gcdNode*&v,int l,int r,int y1,int y2){
if(y1==l&&y2==r){
return v->val;
}
int m=(l+r)/2;
if(y2<=m){
v->try_create(v->left);
return get(v->left,l,m,y1,y2);
}else if(y1>m){
v->try_create(v->right);
return get(v->right,m+1,r,y1,y2);
}else{
v->try_create(v->left);
v->try_create(v->right);
return merge(get(v->left,l,m,y1,m),get(v->right,m+1,r,m+1,y2));
}
}
void upd(gcdNode*&v,int l,int r,int pos,long long val){
if(l==pos&&r==pos){
v->val=val;
return;
}
int m=(l+r)/2;
v->try_create(v->left);
v->try_create(v->right);
if(pos<=m){
upd(v->left,l,m,pos,val);
}else{
upd(v->right,m+1,r,pos,val);
}
v->val=merge(v->left->val,v->right->val);
}
};
struct segTreeNode2{
segTreeNode*root;
segTreeNode2(){
root=new segTreeNode();
}
long long get(segTreeNode*&v,int l,int r,int x1,int x2,int y1,int y2){
if(l==x1&&r==x2){
return v->get(v->root,0,MAX,y1,y2);
}
int m=(l+r)/2;
if(x2<=m){
v->try_create(v->left);
return get(v->left,l,m,x1,x2,y1,y2);
}else if(x1>m){
v->try_create(v->right);
return get(v->right,m+1,r,x1,x2,y1,y2);
}else{
v->try_create(v->left);
v->try_create(v->right);
return merge(get(v->left,l,m,x1,m,y1,y2),get(v->right,m+1,r,m+1,x2,y1,y2));
}
}
void upd(segTreeNode*&v,int l,int r,int x,int y,long long val){
if(l==r&&l==x){
v->upd(v->root,0,MAX,y,val);
return;
}
int m=(l+r)/2;
if(x<=m){
v->try_create(v->left);
upd(v->left,l,m,x,y,val);
}else{
v->try_create(v->right);
upd(v->right,m+1,r,x,y,val);
}
v->upd(v->root,0,MAX,y,val);
}
};
segTreeNode2 root;
void init(int R,int C){
}
void update(int P,int Q,long long K){
root.upd(root.root,0,MAX,Q,P,K);
}
long long calculate(int P,int Q,int U,int V){
return root.get(root.root,0,MAX,Q,V,P,U);
}
//signed main(){}
Compilation message
/usr/bin/ld: /tmp/ccQOupH3.o: in function `main':
grader.c:(.text.startup+0x6b): undefined reference to `init'
/usr/bin/ld: grader.c:(.text.startup+0xd0): undefined reference to `calculate'
/usr/bin/ld: grader.c:(.text.startup+0x13e): undefined reference to `update'
collect2: error: ld returned 1 exit status