# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
29944 |
2017-07-21T11:16:56 Z |
inqr |
게임 (IOI13_game) |
C++14 |
|
13000 ms |
33424 KB |
#include "game.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define DB printf("debug\n");
using namespace std;
long long g[2005][2005];
int r,c;
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;
}
void init(int R, int C) {r=R;c=C;}
void update(int P, int Q, long long K){g[P][Q]=K;}
long long calculate(int P, int Q, int U, int V) {
long long ans=g[P][Q];
for(int i=P;i<=U;i++){
for(int j=Q;j<=V;j++){
ans=gcd2(ans,g[i][j]);
}
}
return ans;
}
Compilation message
grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
int res;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
33424 KB |
Output is correct |
2 |
Correct |
0 ms |
33424 KB |
Output is correct |
3 |
Correct |
0 ms |
33424 KB |
Output is correct |
4 |
Correct |
0 ms |
33424 KB |
Output is correct |
5 |
Correct |
0 ms |
33424 KB |
Output is correct |
6 |
Correct |
0 ms |
33424 KB |
Output is correct |
7 |
Correct |
0 ms |
33424 KB |
Output is correct |
8 |
Correct |
0 ms |
33424 KB |
Output is correct |
9 |
Correct |
0 ms |
33424 KB |
Output is correct |
10 |
Correct |
0 ms |
33424 KB |
Output is correct |
11 |
Correct |
0 ms |
33424 KB |
Output is correct |
12 |
Correct |
0 ms |
33424 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
33424 KB |
Output is correct |
2 |
Correct |
0 ms |
33424 KB |
Output is correct |
3 |
Correct |
0 ms |
33424 KB |
Output is correct |
4 |
Execution timed out |
13000 ms |
33424 KB |
Execution timed out |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
33424 KB |
Output is correct |
2 |
Correct |
0 ms |
33424 KB |
Output is correct |
3 |
Correct |
0 ms |
33424 KB |
Output is correct |
4 |
Correct |
0 ms |
33424 KB |
Output is correct |
5 |
Correct |
0 ms |
33424 KB |
Output is correct |
6 |
Correct |
0 ms |
33424 KB |
Output is correct |
7 |
Correct |
0 ms |
33424 KB |
Output is correct |
8 |
Correct |
0 ms |
33424 KB |
Output is correct |
9 |
Correct |
0 ms |
33424 KB |
Output is correct |
10 |
Correct |
0 ms |
33424 KB |
Output is correct |
11 |
Correct |
0 ms |
33424 KB |
Output is correct |
12 |
Execution timed out |
13000 ms |
33424 KB |
Execution timed out |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
33424 KB |
Output is correct |
2 |
Correct |
0 ms |
33424 KB |
Output is correct |
3 |
Correct |
0 ms |
33424 KB |
Output is correct |
4 |
Correct |
0 ms |
33424 KB |
Output is correct |
5 |
Correct |
0 ms |
33424 KB |
Output is correct |
6 |
Correct |
0 ms |
33424 KB |
Output is correct |
7 |
Correct |
0 ms |
33424 KB |
Output is correct |
8 |
Correct |
0 ms |
33424 KB |
Output is correct |
9 |
Correct |
0 ms |
33424 KB |
Output is correct |
10 |
Correct |
0 ms |
33424 KB |
Output is correct |
11 |
Correct |
0 ms |
33424 KB |
Output is correct |
12 |
Execution timed out |
13000 ms |
33424 KB |
Execution timed out |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
33424 KB |
Output is correct |
2 |
Correct |
0 ms |
33424 KB |
Output is correct |
3 |
Correct |
0 ms |
33424 KB |
Output is correct |
4 |
Correct |
0 ms |
33424 KB |
Output is correct |
5 |
Correct |
0 ms |
33424 KB |
Output is correct |
6 |
Correct |
0 ms |
33424 KB |
Output is correct |
7 |
Correct |
0 ms |
33424 KB |
Output is correct |
8 |
Correct |
0 ms |
33424 KB |
Output is correct |
9 |
Correct |
0 ms |
33424 KB |
Output is correct |
10 |
Correct |
0 ms |
33424 KB |
Output is correct |
11 |
Correct |
0 ms |
33424 KB |
Output is correct |
12 |
Execution timed out |
13000 ms |
33424 KB |
Execution timed out |
13 |
Halted |
0 ms |
0 KB |
- |