oj.uz

답안 #18680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18680 2016-02-14T03:05:03 Z suhgyuho_william 게임 (IOI13_game) C++
10 / 100
 1786 ms 126084 KB 
#include "game.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;
}

int nr,nc;
long long seg[4000][4000];

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

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

	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;
		seg[i][j] = K;
		j /= 2;
		while(j > 0){
			seg[i][j] = gcd2(seg[i*2][j],seg[(i*2)+1][j]);
			j /= 2;
		}
		i /= 2;
	}
}

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

long long calculate(int P, int Q, int U, int V) {
	int i,j;
	long long ans = 0;

    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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 126084 KB Output is correct
2 Correct 2 ms 126084 KB Output is correct
3 Correct 2 ms 126084 KB Output is correct
4 Correct 0 ms 126084 KB Output is correct
5 Correct 0 ms 126084 KB Output is correct
6 Correct 0 ms 126084 KB Output is correct
7 Correct 0 ms 126084 KB Output is correct
8 Correct 0 ms 126084 KB Output is correct
9 Correct 0 ms 126084 KB Output is correct
10 Correct 0 ms 126084 KB Output is correct
11 Correct 0 ms 126084 KB Output is correct
12 Correct 0 ms 126084 KB Output is correct

Subtask #2
0.0 / 27.0

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

Subtask #3
0.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 126084 KB Output is correct
2 Correct 0 ms 126084 KB Output is correct
3 Correct 0 ms 126084 KB Output is correct
4 Correct 0 ms 126084 KB Output is correct
5 Correct 0 ms 126084 KB Output is correct
6 Correct 1 ms 126084 KB Output is correct
7 Correct 0 ms 126084 KB Output is correct
8 Correct 0 ms 126084 KB Output is correct
9 Correct 0 ms 126084 KB Output is correct
10 Correct 0 ms 126084 KB Output is correct
11 Correct 0 ms 126084 KB Output is correct
12 Correct 1132 ms 126084 KB Output is correct
13 Incorrect 1786 ms 126084 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 126084 KB Output is correct
2 Correct 0 ms 126084 KB Output is correct
3 Correct 2 ms 126084 KB Output is correct
4 Correct 0 ms 126084 KB Output is correct
5 Correct 0 ms 126084 KB Output is correct
6 Correct 0 ms 126084 KB Output is correct
7 Correct 0 ms 126084 KB Output is correct
8 Correct 0 ms 126084 KB Output is correct
9 Correct 0 ms 126084 KB Output is correct
10 Correct 0 ms 126084 KB Output is correct
11 Correct 0 ms 126084 KB Output is correct
12 Incorrect 626 ms 126084 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 126084 KB Output is correct
2 Correct 0 ms 126084 KB Output is correct
3 Correct 0 ms 126084 KB Output is correct
4 Correct 0 ms 126084 KB Output is correct
5 Correct 0 ms 126084 KB Output is correct
6 Correct 0 ms 126084 KB Output is correct
7 Correct 0 ms 126084 KB Output is correct
8 Correct 0 ms 126084 KB Output is correct
9 Correct 0 ms 126084 KB Output is correct
10 Correct 0 ms 126084 KB Output is correct
11 Correct 0 ms 126084 KB Output is correct
12 Incorrect 633 ms 126084 KB Output isn't correct
13 Halted 0 ms 0 KB -