| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1358012 | maya_s | Soccer Stadium (IOI23_soccer) | C++20 | 125 ms | 31768 KiB |
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
int biggest_stadium(int n, vector<vector<int>> f)
{
for(ll i = 0; i < n; i++) for(ll j = 0; j < n; j++) if(f[i][j]){
return n*n - min(i+1, n-i) * min(j+1, n-j);
}
return n*n;
}
| # | 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... | ||||
