답안 #1007067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007067	2024-06-24T11:23:02 Z	NeroZein	축구 경기장 (IOI23_soccer)	C++17	1.5 / 100	189 ms	31828 KB

soccer

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

int biggest_stadium(int n, vector<vector<int>> F) {
  int r = -1, c = -1;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (F[i][j] == 1) {
        r = i, c = j; 
      }
    }
  }
  if (c == -1) {
    return n * n;
  }
  int rr = min(r, n - r - 1); 
  int cc = min(c, n - c - 1);
  int ans = n * n - rr - cc - 1;
  return ans; 
}

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	partial

Subtask #1

1.5 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	344 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	344 KB	partial
7	Partially correct	1 ms	348 KB	partial
8	Partially correct	12 ms	2200 KB	partial
9	Partially correct	189 ms	31828 KB	partial

Subtask #2

0.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	348 KB	ok
3	Partially correct	0 ms	348 KB	partial
4	Partially correct	0 ms	348 KB	partial
5	Partially correct	0 ms	348 KB	partial
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Correct	0 ms	348 KB	ok
9	Correct	0 ms	348 KB	ok
10	Incorrect	0 ms	348 KB	wrong
11	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Partially correct	0 ms	348 KB	partial
5	Partially correct	0 ms	348 KB	partial
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	348 KB	ok
11	Incorrect	0 ms	348 KB	wrong
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Partially correct	0 ms	348 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Incorrect	0 ms	348 KB	wrong
14	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Partially correct	0 ms	348 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Incorrect	0 ms	348 KB	wrong
14	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Partially correct	0 ms	344 KB	partial
8	Partially correct	1 ms	348 KB	partial
9	Partially correct	12 ms	2200 KB	partial
10	Partially correct	189 ms	31828 KB	partial
11	Partially correct	0 ms	348 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Partially correct	0 ms	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	348 KB	partial
16	Correct	0 ms	348 KB	ok
17	Correct	0 ms	348 KB	ok
18	Incorrect	0 ms	348 KB	wrong
19	Halted	0 ms	0 KB	-