# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081864 | 2024-08-30T12:14:08 Z | LaMatematica14 | Soccer Stadium (IOI23_soccer) | C++17 | 1 ms | 432 KB |
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int N, std::vector<std::vector<int>> F){ int a, b; for (int i =0 ; i < N; i++) { for (int j = 0; j < N; j++) { if (F[i][j]) { a = i; b = j; } } } a++; b++; return N*N-min(min(a*b,(N-a+1)*(N-b+1)),min((N-a+1)*b, (N-b+1)*a)); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | ok |
2 | Correct | 0 ms | 348 KB | ok |
3 | Correct | 0 ms | 348 KB | ok |
4 | Correct | 0 ms | 348 KB | ok |
5 | Incorrect | 0 ms | 344 KB | wrong |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | ok |
2 | Correct | 0 ms | 348 KB | ok |
3 | Partially correct | 1 ms | 348 KB | partial |
4 | Partially correct | 0 ms | 432 KB | partial |
5 | Partially correct | 0 ms | 348 KB | partial |
6 | Partially correct | 0 ms | 344 KB | partial |
7 | Partially correct | 0 ms | 348 KB | partial |
8 | Correct | 1 ms | 348 KB | ok |
9 | Incorrect | 0 ms | 348 KB | wrong |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 1 ms | 348 KB | partial |
5 | Partially correct | 0 ms | 432 KB | partial |
6 | Partially correct | 0 ms | 348 KB | partial |
7 | Partially correct | 0 ms | 344 KB | partial |
8 | Partially correct | 0 ms | 348 KB | partial |
9 | Correct | 1 ms | 348 KB | ok |
10 | Incorrect | 0 ms | 348 KB | wrong |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 348 KB | ok |
5 | Correct | 0 ms | 348 KB | ok |
6 | Partially correct | 1 ms | 348 KB | partial |
7 | Partially correct | 0 ms | 432 KB | partial |
8 | Partially correct | 0 ms | 348 KB | partial |
9 | Partially correct | 0 ms | 344 KB | partial |
10 | Partially correct | 0 ms | 348 KB | partial |
11 | Correct | 1 ms | 348 KB | ok |
12 | Incorrect | 0 ms | 348 KB | wrong |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 348 KB | ok |
5 | Correct | 0 ms | 348 KB | ok |
6 | Partially correct | 1 ms | 348 KB | partial |
7 | Partially correct | 0 ms | 432 KB | partial |
8 | Partially correct | 0 ms | 348 KB | partial |
9 | Partially correct | 0 ms | 344 KB | partial |
10 | Partially correct | 0 ms | 348 KB | partial |
11 | Correct | 1 ms | 348 KB | ok |
12 | Incorrect | 0 ms | 348 KB | wrong |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 348 KB | ok |
5 | Correct | 0 ms | 348 KB | ok |
6 | Incorrect | 0 ms | 344 KB | wrong |
7 | Halted | 0 ms | 0 KB | - |