Submission #411610

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
411610	2021-05-25T15:20:37 Z	Mlxa	Game (IOI13_game)	C++14	10 / 100	13000 ms	16952 KB

game

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "game.h"

ll gcd(ll x, ll y) {
	ll tmp;
	while (x != y && y != 0) {
		tmp = x;
		x = y;
		y = tmp % y;
	}
	return x;
}

const int NN = 2020;

ll a[NN][NN];
vector<pair<int, int>> pa;


void init(int r, int c) {
	(void)r; (void)c;
}

void update(int p, int q, ll k) {
	pa.emplace_back(p, q);
	a[p][q] = k;
}

ll calculate(int p, int q, int u, int v) {
	ll ans = 0;
	for (auto e : pa) {
		if (p <= e.x && e.x <= u && q <= e.y && e.y <= v) {
			ans = gcd(ans, a[e.x][e.y]);
		}
	}
	return ans;
}

#ifdef LC
#include "grader.c"
#endif

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	460 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct

Subtask #2

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Execution timed out	13079 ms	9596 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Execution timed out	13036 ms	16952 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	1 ms	560 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	564 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	460 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Execution timed out	13082 ms	9716 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	588 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Execution timed out	13102 ms	9528 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-