# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
281805 |
2020-08-23T13:46:09 Z |
shayan_p |
Game (IOI13_game) |
C++14 |
|
1 ms |
384 KB |
// And you curse yourself for things you never done
#include<bits/stdc++.h>
#include "game.h"
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int N, M;
struct node{
ll g = 0;
node *L = 0, *R = 0;
void put(int pos, ll x, int l = 0, int r = M, int id = 1){
if(r-l == 1){
g = x;
return;
}
int mid = (l+r) >> 1;
if(pos < mid){
if(!L)
L = new node();
L->put(pos, x, l, mid, 2*id);
}
else{
if(!R)
R = new node();
R->put(pos, x, mid, r, 2*id+1);
}
g = __gcd(L ? L->g : 0, R ? R->g : 0);
}
ll ask(int f, int s, int l = 0, int r = M, int id = 1){
if(r <= f || s <= l)
return 0;
if(f <= l && r <= s)
return g;
int mid = (l+r) >> 1;
return __gcd(L ? L->ask(f, s, l, mid, 2*id) : 0, R ? R->ask(f, s, mid, r, 2*id+1) : 0);
}
};
struct node2{
node* g = 0;
node2 *L = 0, *R = 0;
void put(int posx, int posy, ll x, int l = 0, int r = N, int id = 1){
if(!g)
g = new node();
g->put(posy, x);
if(r-l == 1){
return;
}
int mid = (l+r) >> 1;
if(posx < mid){
if(!L)
L = new node2();
L->put(posx, posy, x, l, mid, 2*id);
}
else{
if(!R)
R = new node2();
R->put(posx, posy, x, mid, r, 2*id+1);
}
}
ll ask(int f, int s, int ff, int ss, int l = 0, int r = N, int id = 1){
if(r <= f || s <= l)
return 0;
if(f <= l && r <= s)
return g ? g->ask(ff, ss) : 0;
int mid = (l+r) >> 1;
return __gcd(L ? L->ask(f, s, ff, ss, l, mid, 2*id) : 0, R ? R->ask(f, s, ff, ss, mid, r, 2*id+1) : 0);
}
};
node2* root;
void init(int N, int M){
::N = N, ::M = M;
root = new node2();
}
void update(int x, int y, ll w){
root->put(x, y, w);
}
ll calculate(int x, int y, int xx, int yy){
return root->ask(x, ++xx, y, ++yy);
}
Compilation message
grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
18 | int res;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |