| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1194617 | Ak_16 | Soccer Stadium (IOI23_soccer) | C++20 | 218 ms | 31772 KiB |
#include <iostream>
#include <vector>
using namespace std;
int fin;
int biggest_stadium(int n, vector<vector<int>> f){
int r,c;
r=-1;
c=-1;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(f[i][j]==1){
r=i;
c=j;
}
}
}
r = min(r, n-1-r);
c = min(c, n-1-c);
fin = n*n;
fin -= (r+1)*(c+1);
return fin;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
