| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370413 | dssfsuper2 | Soccer Stadium (IOI23_soccer) | C++20 | 0 ms | 344 KiB |
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using pii = pair<int, int>;
int biggest_stadium(int N, vector<vector<int>> F){
pii ps={0, 0};
for(int i = 0;i<N;i++){
for(int j = 0;j<N;j++){
if(F[i][j]==1)ps={i, j};
}
}
return N*N-min(ps.first, N-ps.first-1)-min(ps.second, N-ps.second-1)-1;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
