| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 399481 |
2021-05-05T22:07:28 Z |
cfalas |
Game (IOI13_game) |
C++14 |
|
2 ms |
428 KB |
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;
#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
int t, n;
vi a, b;
static int M;
//static map<int, map<ii, int> > mapper;
long long gcd(long long X, long long Y) {
//return X + Y;
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
template<typename Q>
struct seg_tree_2d{
template<typename T>
struct seg_tree{
struct node{
T val;
node* left=nullptr;
node* right=nullptr;
node() {val=0;}
node(T v) {val=v;}
};
inline static node* seg;
//vector<node> seg;
T RAND_VALUE=0;
seg_tree(){seg = new node();}
unordered_map<int, T> leaves;
inline void merge(node *par){
par->val = gcd(par->left->val , par->right->val);
}
inline void update_node(node* ind, T val, int l, int r){
leaves[l] = val;
if(val==0) leaves.erase(l);
ind->val = val;
}
inline void create_children(node* ind, int l, int r){
if((*ind).left==nullptr) ind->left=new node();//seg.size(), /*mapper[parent][{l,MID}] = seg[ind].left,*/ seg.push_back(node());
if((*ind).right==nullptr) ind->right =new node();//seg[ind].right=seg.size(), /*mapper[parent][{MID+1,r}] = seg[ind].right,*/ seg.push_back(node());
}
/*
void print(int l=0, int r=M-1, int ind=0){
cout<<"("<<l<<" "<<r<<" "<<ind<<": "<<seg[ind].val<<") ";
if(seg[ind].left!=-1) print(l, MID, seg[ind].left);
if(seg[ind].right!=-1) print(MID+1, r, seg[ind].right);
}*/
void build(vector<T>& arr, int l=0, int r=M-1, node* ind=seg){
if(l==r) ind->val = node(arr[l]);// changed.push_back({l,r});
else{
create_children(ind, l, r);
//changed.push_back({l,r});
build(arr,l,MID,ind->left);
build(arr,MID+1,r,ind->right);
merge(ind);
}
}
void update(int x, T val, int l=0, int r=M-1, node* ind=seg){
if(x==l && r==x) update_node(ind, val,l,r);
else if(x<l || r<x) return;
else{
create_children(ind, l, r);
update(x,val,l,MID,ind->left);
update(x,val,MID+1,r,ind->right);
merge(ind);
}
}
T query(int rl, int rr, int l=0, int r=M-1, node* ind=seg){
if(rl<=l && r<=rr) return ind->val;
else if(rl>r || l>rr) return RAND_VALUE;
else{
create_children(ind, l, r);
return gcd(query(rl, rr, l, MID, ind->left) , query(rl,rr,MID+1,r,ind->right));
}
}
};
struct node{
seg_tree<Q> val;
int left=-1;
int right=-1;
node() {left=-1, right=-1;}
};
vector<node> seg2d;
static inline int N;
Q RAND_VALUE_2d=0;
seg_tree_2d(int n){N=n, seg2d.assign(1, node());}
inline void merge(node &par, node &a, node &b, int ind){
FOA(v,a.val.leaves){
Q val = v.S;
if(b.val.leaves[v.F]) val = gcd(val, b.val.leaves[v.F]);
if(par.val.leaves[v.F]!=val) par.val.update(v.F, val);
}
FOA(v,b.val.leaves){
Q val = v.S;
if(a.val.leaves[v.F]) val = gcd(val, a.val.leaves[v.F]);
if(par.val.leaves[v.F]!=val) par.val.update(v.F, val);
}
}
void print(int l=0, int r=N-1, int ind=0){
cout<<"L R "<<l<<" "<<r<<" "<<ind<<endl;
seg2d[ind].val.print();
cout<<endl;
if(seg2d[ind].left!=-1) print(l, MID, seg2d[ind].left);
if(seg2d[ind].right!=-1) print(MID+1, r, seg2d[ind].right);
}
inline void create_children(int ind){
if(seg2d[ind].left==-1){
seg2d[ind].left=seg2d.size();
seg2d.push_back(node());
//mapper[seg2d[ind].left][{0,M-1}] = 0;
}
if(seg2d[ind].right==-1){
seg2d[ind].right=seg2d.size();
seg2d.push_back(node());
//mapper[seg2d[ind].right][{0,M-1}] = 0;
}
//if(seg2d[ind].right==-1) seg2d[ind].right=seg2d.size(), seg2d.push_back(node()), seg2d.back().val.parent = seg2d[ind].right;
}
void build(vector<vector<Q> >& arr, int l=0, int r=N-1, int ind=0){
if(l==r){
seg2d[ind].val.build(arr[l]);
}
else{
create_children(ind);
build(arr,l,MID,seg2d[ind].left);
build(arr,MID+1,r,seg2d[ind].right);
merge(seg2d[ind], seg2d[seg2d[ind].left], seg2d[seg2d[ind].right], ind);
}
}
void update(int y, int x, Q val, int l=0, int r=N-1, int ind=0){
if(y==l && y==r) seg2d[ind].val.update(x, val);
else if(y<l || r<y) return;
else{
create_children(ind);
update(y,x,val,l,MID,seg2d[ind].left);
update(y,x,val,MID+1,r,seg2d[ind].right);
merge(seg2d[ind], seg2d[seg2d[ind].left], seg2d[seg2d[ind].right], ind);
}
}
Q query(int rl, int rr, int xl, int xr, int l=0, int r=N-1, int ind=0){
if(rl<=l && r<=rr) return seg2d[ind].val.query(xl, xr);
else if(rl>r || l>rr) return RAND_VALUE_2d;
else{
create_children(ind);
return gcd(query(rl, rr, xl, xr, l, MID, seg2d[ind].left), query(rl,rr,xl, xr, MID+1,r,seg2d[ind].right));
}
}
};
seg_tree_2d<ll> seg(n);
void init(int R, int C) {
M = R;
seg.N = C;
}
void update(int P, int Q, long long K) {
//changed.clear();
seg.update(Q,P,K);
//seg.print();
/*
FOR(i,M){
FOR(j,M) seg.query(i,i,j,j);
//FOR(j,M) cout<<setw(1)<<seg.query(i,i,j,j);
//cout<<endl;
}
*/
//cout<<endl;
}
long long calculate(int P, int Q, int U, int V) {
return seg.query(Q,V,P,U);
}
/*
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int q;
cin>>n>>q;
init(n,n);
string s[n];
vector<vector<ll> > a(n, vi(n, 0));
FOR(i,n) cin>>s[i];
FOR(i,n) FOR(j,n){
if(s[i][j]=='*') a[i][j] = 1;
else a[i][j] = 0;
}
seg.build(a);
while(q--){
cin>>t;
if(t==1){
int x, y;
cin>>x>>y;
update(x-1,y-1, 1);
}
else{
int x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
cout<<seg.query(x1-1,x2-1, y1-1, y2-1)<<"\n";
}
}
}
*/
Compilation message
game.cpp:54:3: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
54 | inline static node* seg;
| ^~~~~~
game.cpp:123:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
123 | static inline int N;
| ^~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
428 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
