oj.uz

답안 #1025725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025725 2024-07-17T09:17:34 Z dozer 게임 (IOI13_game) C++14
63 / 100
 805 ms 256000 KB 
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int,int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define ll long long
#define MAXN 200005


const int M = 1e9;

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 Node{
	ll valy;
	Node *XL, *XR, *YR, *YL;
	Node(){
		XL = XR = YL = YR = NULL;
		valy = 0;
	}

	void pull_y(){
		ll lft = 0, rgt = 0;
		if (YL != NULL) lft = YL->valy;
		if (YR != NULL) rgt = YR->valy;
		valy = gcd2(lft, rgt);
	}

	void pull_x(){
		ll lft = 0, rgt = 0;
		if (XL != NULL) lft = XL->valy;
		if (XR != NULL) rgt = XR->valy;
		valy = gcd2(lft, rgt);
	}
};


typedef Node* pnode;

struct SegTree{
	pnode root;

	int R, C;

	SegTree(int r, int c){
		root = new Node();
		R = r, C = c;
	}

	void update_y(pnode node, int l, int r, int a, int b, int sl, ll val){
		if (l > sl || r < sl) return;
		if (l == r){
			if (a == b) node->valy = val;
			else {
				node->pull_x();
			}
			return;
		}

		int mid = (l + r) / 2;

		if (sl <= mid){
			if (node->YL == NULL){
				node->YL = new Node();
			}
			if (node-> XL != NULL) node->YL->XL = node->XL->YL;
			if (node->XR != NULL) node->YL->XR = node->XR->YL;
			update_y(node->YL, l, mid, a, b, sl, val);
		}

		else{
			if (node->YR == NULL){
				node->YR = new Node();
			}
			if (node-> XL != NULL) node->YR->XL = node->XL->YR;
			if (node->XR != NULL) node->YR->XR = node->XR->YR;
			update_y(node->YR, mid + 1, r, a, b, sl, val);
		}

		node->pull_y();
	}

	void update_x(pnode node, int l, int r, int x, int y, ll val){
		if (l > x || r < x) return;
		
		if (l != r){
			int mid = (l + r) / 2;
			if (x <= mid){
				if (node->XL == NULL){
					node->XL = new Node();
				}
				update_x(node->XL, l, mid, x, y, val);
			}

			else{
				if (node->XR == NULL){
					node->XR = new Node();
				}
				update_x(node->XR, mid + 1, r, x, y, val);
			}
		}

		update_y(node, 1, C, l, r, y, val);
	}


	void update(int x, int y, ll val){
		update_x(root, 1, R, x, y, val);
	}


	ll query_y(pnode node, int l, int r, int sl, int sr){
		if (l > sr || r < sl) return 0;
		if (l >= sl && r <= sr) return node->valy;
		ll lft = 0, rgt = 0;
		int mid = (l + r) / 2;
		if (node->YL != NULL && sl <= mid) lft = query_y(node->YL, l, mid, sl, sr);
		if (node->YR != NULL && sr > mid) rgt = query_y(node->YR, mid + 1, r, sl, sr);
		return gcd2(lft, rgt);
	}

	ll query_x(pnode node, int l, int r, int a, int b, int c, int d){
		if (l > b || r < a) return 0;
		if (l >= a && r <= b) {
			ll val = query_y(node, 1, C, c, d);
			return val;
		}
		ll lft = 0, rgt = 0;
		int mid = (l + r) / 2;
		if (node->XL != NULL && a <= mid){
			lft = query_x(node->XL, l, mid, a, b, c, d);
		}

		if (node->XR != NULL && b > mid){
			rgt = query_x(node->XR, mid + 1, r, a, b, c, d);
		}
		return gcd2(lft, rgt);
	}

	ll query(int a, int b, int c, int d){
		return query_x(root, 1, R, a, b, c, d);
	}
};



SegTree *t;

void init(int R, int C) {
    t = new SegTree(R, C);
}

void update(int P, int Q, long long K) {
    t->update(P + 1, Q + 1, K);
}

long long calculate(int P, int Q, int U, int V) {
    P++, Q++, U++, V++;
    return t->query(P, U, Q, V);
}


/*
#define fail(s, x...) do { \
		fprintf(stderr, s "\n", ## x); \
		exit(1); \
	} while(0)

#define MAX_SIZE 1000000000
#define MAX_N 272000

int main() {
	int R, C, N;
    int P, Q, U, V;
    long long K;
    int i, type;
	int res;

	freopen("output.txt", "w", stdout);

	FILE *f = fopen("input.txt", "r");
	if (!f)
		fail("Failed to open input file.");

	res = fscanf(f, "%d", &R);
	res = fscanf(f, "%d", &C);
	res = fscanf(f, "%d", &N);

    init(R, C);

	for (i = 0; i < N; i++) {
        res = fscanf(f, "%d", &type);
        if (type == 1) {
		    res = fscanf(f, "%d%d%lld", &P, &Q, &K);
            update(P, Q, K);
        } else if (type == 2) {
		    res = fscanf(f, "%d%d%d%d", &P, &Q, &U, &V);
            printf("%lld\n", calculate(P, Q, U, V));
        } else
			fail("Invalid action type in input file.");
	}
	fclose(f);

	return 0;
}
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 346 ms 16864 KB Output is correct
5 Correct 213 ms 17240 KB Output is correct
6 Correct 335 ms 14028 KB Output is correct
7 Correct 354 ms 13752 KB Output is correct
8 Correct 241 ms 9044 KB Output is correct
9 Correct 313 ms 14052 KB Output is correct
10 Correct 285 ms 13648 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 474 ms 21492 KB Output is correct
13 Correct 699 ms 8684 KB Output is correct
14 Correct 151 ms 1108 KB Output is correct
15 Correct 805 ms 12404 KB Output is correct
16 Correct 124 ms 26760 KB Output is correct
17 Correct 488 ms 16212 KB Output is correct
18 Correct 720 ms 26964 KB Output is correct
19 Correct 661 ms 27248 KB Output is correct
20 Correct 613 ms 26472 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 289 ms 16728 KB Output is correct
13 Correct 194 ms 17020 KB Output is correct
14 Correct 276 ms 14164 KB Output is correct
15 Correct 300 ms 13908 KB Output is correct
16 Correct 205 ms 8952 KB Output is correct
17 Correct 294 ms 13968 KB Output is correct
18 Correct 279 ms 13520 KB Output is correct
19 Correct 426 ms 21588 KB Output is correct
20 Correct 683 ms 8516 KB Output is correct
21 Correct 150 ms 1108 KB Output is correct
22 Correct 771 ms 12368 KB Output is correct
23 Correct 115 ms 26708 KB Output is correct
24 Correct 472 ms 16212 KB Output is correct
25 Correct 726 ms 26964 KB Output is correct
26 Correct 674 ms 27216 KB Output is correct
27 Correct 616 ms 26448 KB Output is correct
28 Runtime error 348 ms 256000 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 296 ms 16828 KB Output is correct
13 Correct 229 ms 17072 KB Output is correct
14 Correct 278 ms 14172 KB Output is correct
15 Correct 311 ms 13904 KB Output is correct
16 Correct 202 ms 9136 KB Output is correct
17 Correct 297 ms 13904 KB Output is correct
18 Correct 264 ms 13664 KB Output is correct
19 Correct 446 ms 21584 KB Output is correct
20 Correct 694 ms 8764 KB Output is correct
21 Correct 148 ms 1120 KB Output is correct
22 Correct 787 ms 12288 KB Output is correct
23 Correct 117 ms 26752 KB Output is correct
24 Correct 468 ms 16344 KB Output is correct
25 Correct 734 ms 26852 KB Output is correct
26 Correct 657 ms 27120 KB Output is correct
27 Correct 637 ms 26448 KB Output is correct
28 Runtime error 369 ms 256000 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -