| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1328271 | Mamikonm1 | Game (IOI13_game) | C++17 | 13083 ms | 9028 KiB |
#include<bits//stdc++.h>
#include "game.h"
using namespace std;
using ll = long long;
long long GCD(long long X, long long Y) {
return(Y?GCD(Y,X%Y):X);
}
vector<vector<ll>>a;
void init(int R, int C) {
a.resize(R,vector<ll>(C));
}
void update(int P, int Q, long long K) {
a[P][Q]=K;
}
long long calculate(int P, int Q, int U, int V) {
ll res=0;
for(int i=P;i<=U;++i){
for(int j=Q;j<=V;++j){
res=GCD(res,a[i][j]);
}
}
return res;
}| # | 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... | ||||
