# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966397 | 2024-04-19T19:23:49 Z | VMaksimoski008 | Soccer Stadium (IOI23_soccer) | C++17 | 1 ms | 348 KB |
#include "soccer.h" #include <bits/stdc++.h> using namespace std; using ll = long long; int biggest_stadium(int N, std::vector<std::vector<int>> F) { int cnt = 0; for(int i=0; i<N; i++) for(int j=0; j<N; j++) cnt += (F[i][j] == 1); if(!cnt) return N * N; int x=0, y=0; for(int i=0; i<N; i++) for(int j=0; j<N; j++) if(F[i][j] == 1) x = i, y = j; int ans = N * N - 2 * (N - 1); return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | partial |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | partial |
2 | Incorrect | 0 ms | 348 KB | wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | partial |
2 | Incorrect | 0 ms | 348 KB | wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | partial |
2 | Incorrect | 0 ms | 348 KB | wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | partial |
2 | Incorrect | 0 ms | 348 KB | wrong |
3 | Halted | 0 ms | 0 KB | - |