# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798783 | vjudge1 | Game (IOI13_game) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
long long m, n, q, x, y, u, v, val, tt;
struct node1
{
long long l, r, ss;
node1 *left, *right;
node1(long long _l, long long _r)
{
l = _l;
r = _r;
ss = 0;
left = right = NULL;
}
void down()
{
if (l != r && left == NULL)
{
long long mid=(l+r)>>1;
left = new node1(l, mid);
right = new node1(mid+1, r);
}
}
void update(long long i, long long v)
{
if (r < i || i < l) return;
down();
if (l == r)
{
ss = v;
return;
}
left->update(i, v);
right->update(i, v);
ss = __gcd(left->ss, right->ss);
}
long long get(long long a, long long b)
{
if (r < a || b < l) return 0;
down();
if (a <= l && r <= b) return ss;
return __gcd(left->get(a, b), right->get(a, b));
}
};
struct node2
{
long long l, r, ss;
node2 *left, *right;
node1 *node;
node2(long long _l, long long _r)
{
l = _l;
r = _r;
ss = 0;
left = right = NULL;
node = new node1(1, n);
}
void down()
{
if (l!=r && left == NULL)
{
long long mid=(l+r)>>1;
left = new node2(l, mid);
right = new node2(mid+1, r);
}
}
void update(long long x, long long y, long long val)
{
if (r<x || x<l) return;
down();
node->update(y, val);
if (l==r) return;
left->update(x, y, val);
right->update(x, y, val);
}
long long get(long long x, long long y, long long u, long long v)
{
if (r<x || u<l) return 0;
down();
if (x<=l && r<=u) return node->get(y, v);
return __gcd(left->get(x, y, u, v), right->get(x, y, u, v));
}
};
node2* root;
void init(long long R, long long C)
{
m=R;
n=C;
root = new node2(1, R);
}
void update(long long P, long long Q, long long K)
{
return root->update(P+1, Q+1, K);
}
long long calculate(long long P, long long Q, long long U, long long V)
{
return root->get(P+1, Q+1, U+1, V+1);
}