oj.uz

답안 #94591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
94591 2019-01-21T11:44:56 Z Retro3014 게임 (IOI13_game) C++17
0 / 100
 3 ms 504 KB 
#include "game.h"
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <deque>

typedef long long ll;
using namespace std;


long long gcd2(long long X, long long Y) {
    long long tmp;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}

struct SEG2{
	int s, e;
	int l=-1, r=-1;
	ll gcd = 0;
};
vector<SEG2> s2;

struct SEG1{
	int s, e;
	int l, r;
	vector<SEG2> seg2;
};
vector<SEG1> seg1;
int r, c;


void init(int R, int C) {
	r = R; c = C;
	seg1.push_back({0, R-1, -1, -1, s2});
}

void update2(int x, int y, int idx, ll K){
	//seg1[x].seg2[y].gcd = gcd2(seg1[x].seg2[y].gcd, K);
	if(seg1[x].seg2[y].s==seg1[x].seg2[y].e){
		seg1[x].seg2[y].gcd = K;
		return;
	}
	if(idx<=(seg1[x].seg2[y].s+seg1[x].seg2[y].e)/2){
		if(seg1[x].seg2[y].l==-1){
			seg1[x].seg2[y].l = seg1[x].seg2.size();
			SEG2 tmp; tmp.s=seg1[x].seg2[y].s; tmp.e=(seg1[x].seg2[y].s+seg1[x].seg2[y].e)/2; tmp.l=-1;tmp.r=-1;tmp.gcd=0;
			seg1[x].seg2.push_back(tmp);
		}
		update2(x, seg1[x].seg2[y].l, idx, K);
		if(seg1[x].seg2[y].r==-1)	seg1[x].seg2[y].gcd = seg1[x].seg2[seg1[x].seg2[y].l].gcd;
		else	seg1[x].seg2[y].gcd = gcd2(seg1[x].seg2[seg1[x].seg2[y].l].gcd, seg1[x].seg2[seg1[x].seg2[y].r].gcd);
	}else{
		if(seg1[x].seg2[y].r==-1){
			seg1[x].seg2[y].r = seg1[x].seg2.size();
			SEG2 tmp; tmp.s=(seg1[x].seg2[y].s+seg1[x].seg2[y].e)/2+1; tmp.e=seg1[x].seg2[y].e; tmp.l=-1;tmp.r=-1;tmp.gcd=0;
			seg1[x].seg2.push_back(tmp);
		}
		update2(x, seg1[x].seg2[y].r, idx, K);
		if(seg1[x].seg2[y].l==-1)	seg1[x].seg2[y].gcd = seg1[x].seg2[seg1[x].seg2[y].r].gcd;
		else	seg1[x].seg2[y].gcd = gcd2(seg1[x].seg2[seg1[x].seg2[y].l].gcd, seg1[x].seg2[seg1[x].seg2[y].r].gcd);
	}
}

void update(int P, int Q, long long K) {
    int idx = 0;
    while(1){
    	if(seg1[idx].seg2.empty()){
    		SEG2 tmp;tmp.s=0;tmp.e=c-1;tmp.l=-1;tmp.r=-1;tmp.gcd=0;
    		seg1[idx].seg2.push_back(tmp);
    	}
    	update2(idx, 0, Q, K);
    	if(seg1[idx].s==seg1[idx].e){
    		return;
    	}
    	if(P<=(seg1[idx].s+seg1[idx].e)/2){
    		if(seg1[idx].l==-1){
    			seg1[idx].l = seg1.size();
    			seg1.push_back({seg1[idx].s, (seg1[idx].s+seg1[idx].e)/2, -1, -1, s2});
    		}
    		idx = seg1[idx].l;
    	}else{
    		if(seg1[idx].r==-1){
    			seg1[idx].r = seg1.size();
    			seg1.push_back({(seg1[idx].s+seg1[idx].e)/2+1, seg1[idx].e, -1, -1, s2});
    		}
    		idx = seg1[idx].r;
    	}
    }
}

int p, q, u, v;

ll calc2(int x, int y){
	if(y==-1)	return 0;
	if(seg1[x].seg2[y].s > v || seg1[x].seg2[y].e < q)	return 0;
	if(q <= seg1[x].seg2[y].s && seg1[x].seg2[y].e <= v)	return seg1[x].seg2[y].gcd;
	return gcd2(calc2(x, seg1[x].seg2[y].l), calc2(x, seg1[x].seg2[y].r));
}

ll calc1(int x){
	if(x==-1)	return 0;
	if(seg1[x].s>u || seg1[x].e<p)	return 0;
	if(p <= seg1[x].s && seg1[x].e <= u){
		if(seg1[x].seg2.empty())	return 0;
		else{
			return calc2(x, 0);
		}
	}
	return gcd2(calc1(seg1[x].l), calc1(seg1[x].r));
}

long long calculate(int P, int Q, int U, int V) {
    p = P; q = Q;
    u = U; v = V;
    return calc1(0);
}

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 2 ms 376 KB Output is correct
2 Incorrect 3 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 20.0

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