이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
if (a[i][j]) x=i,y=j;
}
}
if (x==-1) return n*n;
int ans1=0,ans2=0,ans3=0,ans4=0;
for (int i=0;i<n;i++) for (int j=0;j<n;j++) ans1+=(i<x || j>y);
for (int i=0;i<n;i++) for (int j=0;j<n;j++) ans2+=(i<x || j<y);
for (int i=0;i<n;i++) for (int j=0;j<n;j++) ans3+=(i>x || j>y);
for (int i=0;i<n;i++) for (int j=0;j<n;j++) ans4+=(i>x || j<y);
return max(ans1,max(ans2,max(ans3,ans4)));
}
| # | 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... |