제출 #980255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980255		vjudge1	축구 경기장 (IOI23_soccer)	C++17	6 / 100	262 ms	31764 KiB

soccer

#include <bits/stdc++.h>
#define endl '\n'
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
using namespace std;
using ll = long long; using ull = unsigned long long;
using vi = vector<int>;using ii = pair<int,int>;using mii = map<int,int>;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// bool are_connected(vi A, vi B);
int bits(int a){int cn = 0;
    while(a){if(a&1)cn++;a>>=1;}return cn;
}
int biggest_stadium(int n, vector<vi> arr){
    int con = 0;
    fo(i,n)fo(j,n)con+=arr[i][j];
    if(con ==0) return n*n;
    else if(con == 1){
        ii pos;fo(i,n)fo(j,n)if(arr[i][j])pos={i,j};
        if(pos == mp(0,0) || pos == mp(0,n-1) || pos == mp(n-1,0) || pos == mp(n-1,n-1))return n*n -1;
        int ans = ((n-pos.f)*(n-pos.s));
        ans = min(ans, (pos.f+1) *(n-pos.s));
        ans = min(ans, (n-pos.f)*(pos.s+1));
        ans = min(ans, (pos.f+1)*(pos.s+1));
        return n*n - ans;
    }
    // int tam = n*n;
    // int ans = 0;
    // for(int mask = 0; mask < 1<<tam; mask ++){
    //     bool valid = 1;
    //     if(valid)ans = max(ans, bits(mask));
    // }
    // return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^

• 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