oj.uz

답안 #96830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96830 2019-02-12T10:54:06 Z kig9981 게임 (IOI13_game) C++17
0 / 100
 6 ms 832 KB 
#include <bits/stdc++.h>
#include "game.h"

using namespace std;

struct Seg
{
	int ul, ur, dl, dr;
	long long v;
	Seg() : ul(0), ur(0), dl(0), dr(0), v(0) {}
};

vector<Seg> tree;

void init(int R, int C) {tree.clear(); tree.resize(2);}

long long GCD(long long a, long long b)
{
	for(;b;a%=b,swap(a,b));
	return a;
}

void set_tree2(int n, long long v, int p, int s=0, int e=1e9)
{
	int m=(s+e)>>1;
	if(s==e) {
		tree[p].v=v;
		return;
	}
	if(n<=m) {
		if(tree[p].dl==0) tree[p].dl=tree.size(), tree.push_back(Seg());
		set_tree2(n,v,tree[p].dl,s,m);
	}
	else {
		if(tree[p].dr==0) tree[p].dr=tree.size(), tree.push_back(Seg());
		set_tree2(n,v,tree[p].dr,m+1,e);
	}
	tree[p].v=GCD(tree[tree[p].dl].v,tree[tree[p].dr].v);
}

void set_tree(int x, int y, long long v, int p=1, int s=0, int e=1e9)
{
	int m=(s+e)>>1;
	set_tree2(y,v,p);
	if(s==e) return;
	if(x<=m) {
		if(tree[p].ul==0) tree[p].ul=tree.size(), tree.push_back(Seg());
		set_tree(x,y,v,tree[p].ul,s,m);
	}
	else {
		if(tree[p].ur==0) tree[p].ur=tree.size(), tree.push_back(Seg());
		set_tree(x,y,v,tree[p].ur,m+1,e);
	}
}

void update(int P, int Q, long long K) {set_tree(P,Q,K);}

long long get_gcd2(int n1, int n2, int p, int s=0, int e=1e9)
{
	int m=(s+e)>>1;
	if(p==0 || n2<s || e<n1) return 0;
	if(n1<=s && e<=n2) return tree[p].v;
	return GCD(get_gcd2(n1,n2,tree[p].dl,s,m),get_gcd2(n1,n2,tree[p].dr,m+1,e));
}

long long get_gcd(int x1, int x2, int y1, int y2, int p=1, int s=0, int e=1e9)
{
	int m=(s+e)>>1;
	if(p==0 || x2<s || e<x1) return 0;
	if(x1<=s && e<=x2) return get_gcd2(y1,y2,p);
	return GCD(get_gcd(x1,x2,y1,y2,tree[p].ul,s,m),get_gcd(x1,x2,y1,y2,tree[p].ur,m+1,e));
}

long long calculate(int P, int Q, int U, int V) {return get_gcd(P,U,Q,V);}

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;
      ^~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 428 KB Output is correct
2 Incorrect 6 ms 832 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 3 ms 428 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 6 ms 832 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 5 ms 832 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 5 ms 832 KB Output isn't correct
3 Halted 0 ms 0 KB -