#include <bits/stdc++.h>
using namespace std;
#ifndef __GAME_H__
#define __GAME_H__
#ifdef __cplusplus
extern "C" {
#endif
const long long maxn=2700;
vector<vector<long long> > tree; long long maxR, maxC;
vector<long long> edit;
long long gcd(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
void build_merge(long long parent, long long left, long long right, long long node, long long b, long long e)
{
if(b==e) { tree[parent][node] = gcd(tree[left][node], tree[right][node]); return ; }
long long __left=node<<1; long long __right=__left+1; long long mid=(b+e)>>1;
build_merge(parent, left, right, __left, b, mid);
build_merge(parent, left, right, __right, mid+1, e);
tree[parent][node]=gcd(tree[left][node], tree[right][node]);
}
void build_col(long long row, long long node, long long b, long long e)
{
if(b==e) { tree[row][node] = (long long)0; return ; }
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
build_col(row, left, b, mid); build_col(row, right, mid+1, e);
tree[row][node]=gcd(tree[row][left], tree[row][right]);
}
void build_row(long long node, long long b, long long e)
{
if(b==e) { build_col(node, 1, 0, maxC-1); return ; }
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
build_row(left, b, mid); build_row(right, mid+1, e);
build_merge(node, left, right, 1, 0, maxC-1);
}
void make_update_merge_list(long long node, long long b, long long e, long long pos)
{
if(b>pos || e<pos) return ; edit.push_back(node); if(b==e) return ;
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
make_update_merge_list(left, b, mid, pos); make_update_merge_list(right, mid+1, e, pos);
}
void update_col(long long row, long long node, long long b, long long e, long long pos, long long val)
{
if(b>pos || e<pos) return ;
if(b==e) { tree[row][node]=val; return ; }
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
update_col(row, left, b, mid, pos, val); update_col(row, right, mid+1, e, pos, val);
tree[row][node]=gcd(tree[row][left], tree[row][right]);
}
void update_row(long long node, long long b, long long e, long long x, long long y, long long val)
{
if(b>x || e<x) return ;
if(b==e) { update_col(node, 1, 0, maxC-1, y, val); return ; }
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
update_row(left, b, mid, x, y, val); update_row(right, mid+1, e, x, y, val);
for(int i=0; i<(int)edit.size(); i++) tree[node][edit[i]]=gcd(tree[left][edit[i]], tree[right][edit[i]]);
}
long long calculate_col(long long row, long long node, long long b, long long e, long long i, long long j)
{
if(b>j || e<i) return (long long)0;
if(i<=b && e<=j) return tree[row][node];
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
return gcd(calculate_col(row, left, b, mid, i, j), calculate_col(row, right, mid+1, e, i ,j));
}
long long calculate_row(long long node, long long b, long long e, long long i, long long j, long long l, long long r)
{
if(b>j || e<i) return (long long)0;
if(i<=b && e<=j) return calculate_col(node, 1, 0, maxC-1, l , r);
long long left=node<<1; long long right=left+1; long long mid=(b+e)>>1;
return gcd(calculate_row(left, b, mid, i, j, l, r), calculate_row(right, mid+1, e, i, j, l, r));
}
void init(long long R, long long C)
{
maxR=R; maxC=C; vector<int> temp;
R = ((long long)ceil(log((double)R)/log(2.0)))+1; R=1<<R;
C = ((long long)ceil(log((double)C)/log(2.0)))+1; C=1<<C;
for(int i=0; i<C; i++) temp.push_back(0);
for(int i=0; i<R; i++) tree.push_back(temp);
build_row(1, 0, maxR-1);
}
void update(long long P, long long Q, long long K)
{
edit.clear();
make_update_merge_list(1, 0, maxC-1, Q);
update_row(1, 0, maxR-1, P, Q, K);
}
long long calculate(long long P, long long Q, long long U, long long V)
{
return calculate_row(1, 0, maxR-1, P, U, Q, V);
}
#ifdef __cplusplus
}
#endif
#endif /* __GAME_H__ */
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 init(long long int, long long int)':
game.cpp:98:47: error: no matching function for call to 'std::vector<std::vector<long long int> >::push_back(std::vector<int>&)'
for(int i=0; i<R; i++) tree.push_back(temp);
^
In file included from /usr/include/c++/5/vector:64:0,
from /usr/include/c++/5/bits/random.h:34,
from /usr/include/c++/5/random:49,
from /usr/include/c++/5/bits/stl_algo.h:66,
from /usr/include/c++/5/algorithm:62,
from /usr/include/x86_64-linux-gnu/c++/5/bits/stdc++.h:64,
from game.cpp:1:
/usr/include/c++/5/bits/stl_vector.h:913:7: note: candidate: void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::value_type = std::vector<long long int>]
push_back(const value_type& __x)
^
/usr/include/c++/5/bits/stl_vector.h:913:7: note: no known conversion for argument 1 from 'std::vector<int>' to 'const value_type& {aka const std::vector<long long int>&}'
/usr/include/c++/5/bits/stl_vector.h:931:7: note: candidate: void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::value_type = std::vector<long long int>]
push_back(value_type&& __x)
^
/usr/include/c++/5/bits/stl_vector.h:931:7: note: no known conversion for argument 1 from 'std::vector<int>' to 'std::vector<std::vector<long long int> >::value_type&& {aka std::vector<long long int>&&}'
