답안 #383975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
383975	2021-03-31T06:21:24 Z	ParsaAlizadeh	게임 (IOI13_game)	C++17	10 / 100	13000 ms	2380 KB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long       ll;
typedef pair<ll, ll>    pll;
typedef pair<int, int>  pii;

#define all(x)          x.begin(), x.end()
#define kill(x)         return cout << x << endl, 0
#define X               first
#define Y               second
#define endl            '\n'

constexpr int N   = 2e3 + 10;

ll mp[N][N];

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

void init(int R, int C) {
    assert(R < N && C < N);
}

void update(int P, int Q, long long K) {
    mp[P][Q] = K;
}

ll calculate(int P, int Q, int U, int V) {
    ll ans = 0;
    for (int i = P; i <= U; i++) {
        for (int j = Q; j <= V; j++) {
            ans = gcd2(ans, mp[i][j]);
        }
    }
    return ans;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Runtime error	3 ms	492 KB	Execution killed with signal 6
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	620 KB	Output is correct
3	Correct	1 ms	620 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	620 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	620 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Execution timed out	13067 ms	2380 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	620 KB	Output is correct
3	Correct	2 ms	620 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	620 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	620 KB	Output is correct
10	Correct	2 ms	492 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Runtime error	3 ms	492 KB	Execution killed with signal 6
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	364 KB	Output is correct
2	Correct	1 ms	620 KB	Output is correct
3	Correct	1 ms	620 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	620 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Runtime error	3 ms	492 KB	Execution killed with signal 6
13	Halted	0 ms	0 KB	-