답안 #134407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134407	2019-07-22T16:16:51 Z	arthurconmy	게임 (IOI13_game)	C++14	10 / 100	3 ms	660 KB

game

#include <bits/stdc++.h>
#ifndef ARTHUR_LOCAL
	#include "game.h"
#endif
using namespace std;
using ll=long long;

ll grid[100][100];
int r,c;

void init(int r_r, int c_r)
{
	r=r_r;
	c=c_r;

	for(int i=0; i<100; i++)
	{
		for(int j=0; j<100; j++)
		{
			grid[i][j]=0;
		}
	}
}

void update(int p, int q, ll k)
{
	grid[p][q]=k;
}

ll calculate(int p, int q, int u, int v)
{
	ll cur_gcd = 0;

	for(int i=p; i<=u; i++)
	{
		for(int j=q; j<=v; j++)
		{
			//cout << i << " " << j << endl;

			cur_gcd = __gcd(cur_gcd,grid[i][j]);
		}
	}

	#ifdef ARTHUR_LOCAL
		cout << cur_gcd << endl;
	#endif

	return cur_gcd;
}

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;
      ^~~

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Runtime error	2 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Runtime error	3 ms	660 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Halted	0 ms	0 KB	-