Submission #1007081

#TimeUsernameProblemLanguageResultExecution timeMemory
1007081De3b0o축구 경기장 (IOI23_soccer)C++17
6 / 100
204 ms31780 KiB
#include "soccer.h" #include<bits/stdc++.h> #include<random> #define ll long long #define F first #define S second #define in insert #define pb push_back #define ppb pop_back() #define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define cans cout << ans << "\n"; #define yes cout << "Yes" << "\n"; #define no cout << "No" << "\n"; #define pll pair<ll,ll> #define lin cout << "\n"; #define sqr 340 #define mod 1000000007 #define mid ((l+r)/2) #define lc (2*n) #define rc (2*n+1) using namespace std; ll n; int biggest_stadium(int N, std::vector<std::vector<int>> F) { n=N; ll x=-1 , y=-1; for(int i = 0 ; n>i ; i++) { for(int j = 0 ; n>j ; j++) { if(F[i][j]) { x=i; y=j; } } } if(x==-1) return n*n; else return n*n - min({(x+1)*(y+1),(n-x)*(y+1),(n-y)*(x+1),(n-y)*(n-x)}); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...