| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1315390 | kawhiet | 게임 (IOI13_game) | C++20 | 13091 ms | 12840 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int n, m;
vector<array<int, 2>> pos;
vector<vector<long long>> a;
void init(int R, int C) {
n = R;
m = C;
a.resize(n, vector<long long>(m));
}
void update(int i, int j, long long k) {
a[i][j] = k;
pos.push_back({i, j});
}
long long calculate(int p, int q, int u, int v) {
long long ans = 0;
for (auto [i, j] : pos) {
if (p <= i && i <= u && q <= j && j <= v) {
ans = gcd(ans, a[i][j]);
}
}
return ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
