oj.uz

답안 #18687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18687 2016-02-14T03:32:12 Z suhgyuho_william 게임 (IOI13_game) C++
27 / 100
 589 ms 71412 KB 
#include "game.h"
#include <stdlib.h>

#define lld long long

long long gcd2(long long X, long long Y) {
    long long tmp;

	if(X == 0) return Y;
	if(Y == 0) return X;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}

struct data{
	lld s,e;
	lld value;
	data *par,*left,*right;
	data(){}
	data(data *ipar,long long is,long long ie){
		s = is; e = ie;
		par = ipar;
		left = right = NULL;
	}
};

lld R,C;
long long nr,nc;
long long seg[30][300000];

void init(int iR, int iC) {
	R = (lld)iR; C = (lld)iC;
    for(nr = 1; nr < R; nr *= 2);
    for(nc = 1; nc < C; nc *= 2);
}

void update(int iP, int iQ, long long K) {
	lld i,j;
	lld P,Q;

	P = (lld)iP; Q = (lld)iQ;
	P++; Q++;
	i = nr+P-1;
	j = nc+Q-1; seg[i][j] = K; j /= 2;
	while(j > 0){
		seg[i][j] = gcd2(seg[i][j*2],seg[i][(j*2)+1]);
		j /= 2;
	}
	i /= 2;
	while(i > 0){
		j = nc+Q-1;
		while(j > 0){
			seg[i][j] = gcd2(seg[i*2][j],seg[(i*2)+1][j]);
			j /= 2;
		}
		i /= 2;
	}
}

lld cnt1,cnt2;
lld p1[1000],p2[1000];
lld sr,er,sc,ec;
void find1(lld node,lld left,lld right){
	if(er < left || right < sr) return;
	if(sr <= left && right <= er){
		cnt1++;
		p1[cnt1] = node;
		return;
	}
	lld mid = (left+right)/2;
	find1(node*2,left,mid);
	find1((node*2)+1,mid+1,right);
}
void find2(lld node,lld left,lld right){
	if(ec < left || right < sc) return;
	if(sc <= left && right <= ec){
		cnt2++;
		p2[cnt2] = node;
		return;
	}
	lld mid = (left+right)/2;
	find2(node*2,left,mid);
	find2((node*2)+1,mid+1,right);
}

long long calculate(int iP, int iQ, int iU, int iV) {
	lld i,j;
	lld ans = 0;
	lld P,Q,U,V;

	P = (lld)iP; Q = (lld)iQ; U = (lld)iU; V = (lld)iV;
    P++; Q++; U++; V++;
	sr = P; er = U;
	sc = Q; ec = V;
	cnt1 = 0; find1(1,1,nr);
	cnt2 = 0; find2(1,1,nc);
	for(i=1; i<=cnt1; i++){
		for(j=1; j<=cnt2; j++){
			ans = gcd2(ans,seg[p1[i]][p2[j]]);
		}
	}

	return ans;
}

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 71412 KB Output is correct
2 Runtime error 0 ms 71408 KB SIGSEGV Segmentation fault
3 Halted 0 ms 0 KB -

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 71412 KB Output is correct
2 Correct 0 ms 71412 KB Output is correct
3 Correct 0 ms 71412 KB Output is correct
4 Correct 589 ms 71412 KB Output is correct
5 Correct 412 ms 71412 KB Output is correct
6 Correct 552 ms 71412 KB Output is correct
7 Correct 540 ms 71412 KB Output is correct
8 Correct 440 ms 71412 KB Output is correct
9 Correct 560 ms 71412 KB Output is correct
10 Correct 423 ms 71412 KB Output is correct
11 Correct 0 ms 71412 KB Output is correct

Subtask #3
0.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 71412 KB Output is correct
2 Runtime error 0 ms 71408 KB SIGSEGV Segmentation fault
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 71412 KB Output is correct
2 Runtime error 0 ms 71408 KB SIGSEGV Segmentation fault
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 71412 KB Output is correct
2 Runtime error 0 ms 71408 KB SIGSEGV Segmentation fault
3 Halted 0 ms 0 KB -