Submission #1242185

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242185		AlperenT_	축구 경기장 (IOI23_soccer)	C++20	6 / 100	194 ms	31772 KiB

soccer

#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 = -1;
    rep(i , 0 ,n-1){
        rep(j , 0 ,n-1){
            if(F[i][j] == 1){
                vector <int> a,b ;
                a.pb(i);
                a.pb(n-1-i);
                b.pb(j);
                b.pb(n-1-j); 
                for(int x : a){
                    for(int y : b){
                        ans = max({ans , (x+y)*n - x*y}) ;
                    }
                }
            }
        }
    }
    if(ans == -1)ans = n*n ;
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30