# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076303 | 2024-08-26T12:41:59 Z | MarwenElarbi | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> #include "soccer.h" using namespace std; #define pb push_back #define fi first #define se second const int nax = 2e5+5; const int MOD = 1e9+7; int biggest_stadium(int N, std::vector<std::vector<int>> F) { int n=N; int ans=0; bool test=0; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { test|=F[i][j]; if(F[i][j]){ ans=n*n-min({i+1+j,i+n-j,j+n-i,n-i+n-j-1}); } } } if(n==1&&test) return 0; if(test) return 1; else return n*n; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 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 | 0 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 | 0 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 | 0 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 | 0 ms | 344 KB | partial |
2 | Incorrect | 0 ms | 348 KB | wrong |
3 | Halted | 0 ms | 0 KB | - |