# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006886 | 2024-06-24T09:34:15 Z | Abito | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 348 KB |
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int n, std::vector<std::vector<int>> a) { int x=-1,y=-1,o=0; for (int i=0;i<n;i++){ for (int j=0;j<n;j++){ if (a[i][j]) x=i,y=j,o++; } } if (x==-1) return n*n; if (o>1) return 0; if (a[0][0]==1 || a[0][n-1]==1 || a[n-1][0]==1 || a[n-1][n-1]==1) return n*n; else return 0; }
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 | - |