Submission #840200

#	Time	Username	Problem	Language	Result	Execution time	Memory
840200		bachhoangxuan	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	261 ms	31648 KiB

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
const int maxn=2005;
int f[maxn][maxn],Max[maxn][maxn];


int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int x=-1,y=-1,cnt=0;
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++) if(F[i][j]==1) x=i,y=j,cnt++;
    }
    if(cnt==1) return N*N-min(x+1,N-x)*min(y+1,N-y);

    vector<pii> p;
    for(int i=0;i<N;i++){
        int l=0;
        for(int j=0;j<N;j++){
            if(F[i][j]){
                if(l<j) p.push_back({l,1-j});
                l=j+1;
            }
        }
        if(l<N) p.push_back({l,1-N});
    }
    sort(p.begin(),p.end());
    for(int i=1;i<(int)p.size();i++) if(p[i].se>p[i-1].se) return 0;

    p.clear();
    for(int i=0;i<N;i++){
        int l=0;
        for(int j=0;j<N;j++){
            if(F[j][i]){
                if(l<j) p.push_back({l,1-j});
                l=j+1;
            }
        }
        if(l<N) p.push_back({l,1-N});
    }
    sort(p.begin(),p.end());
    for(int i=1;i<(int)p.size();i++) if(p[i].se>p[i-1].se) return 0;

    return N*N-cnt;
}

• 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