제출 #1242171

#제출 시각아이디문제언어결과실행 시간메모리
1242171AlperenT_축구 경기장 (IOI23_soccer)C++20
0 / 100
0 ms324 KiB
#include "soccer.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") #define pb push_back #define F first #define pii pair<int,int> #define all(a) a.begin(),a.end() #define S second #define sz(a) (int)a.size() #define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++) #define per(i , a , b) for(int i = (a) ; i >= (b) ; i--) #define ld double #define int long long using namespace std ; const int maxn = 30 + 2 ,s = 1000 , inf = 1e9 , mod = 998244353; int32_t biggest_stadium(int32_t n, std::vector<std::vector<int32_t>> F){ int ans =0 ; rep(i , 0 ,n-1){ rep(j , 0 ,n-1){ if(F[i][j] == 1){ ans = max({i*n , (n-i-1)*n , j * n , (n-j-1)*n}) ; } } } return ans; }
#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...