# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551045 | tatyam | Game (IOI13_game) | C++17 | 1 ms | 468 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;
using u32 = uint32_t;
using u64 = uint64_t;
u32 R, C;
struct DynamicSegTree{
unordered_map<u32, u64> seg;
u64 at(u32 x) const {
auto p = seg.find(x);
if(p == seg.end()) return 0;
return p->second;
}
void set(u32 i, u64 x){
i += C;
seg[i] = x;
while(i >= 2){
x = gcd(x, at(i ^ 1));
seg[i >>= 1] = x;
}
}
u64 get(u32 l, u32 r) const {
u64 ans = 0;
l += C;
r += C;
while(l < r){
if(l & 1) ans = gcd(ans, at(l++));
if(r & 1) ans = gcd(ans, at(--r));
l >>= 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |