Submission #1077910

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077910		Unforgettablepl	Soccer Stadium (IOI23_soccer)	C++17	25 / 100	276 ms	39764 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

int biggest_stadium(int N,vector<vector<int>> F){
    pair<int,int> best = {0,-1};
    vector L(N,N);
    vector R(N,-1);
    vector<pair<int,int>> ranges;
    int ans = 0;
    for(auto&i:F)for(int&j:i)if(j==0)ans++;
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++)if(F[i][j]==0)R[i]=j;
        for(int j=N-1;j>=0;j--)if(F[i][j]==0)L[i]=j;
        for(int j=L[i];j<=R[i];j++)if(F[i][j]==1)return 0;
        best = max(best,{R[i]-L[i]+1,i});
        ranges.emplace_back(R[i]-L[i]+1,i);
    }
    sort(ranges.begin(),ranges.end());
    for(int i=1;i<N;i++) {
        if(L[ranges[i-1].second]<L[ranges[i].second])return 0;
        if(R[ranges[i-1].second]>R[ranges[i].second])return 0;
    }
    for(int i=1;i<=best.second;i++)if(R[i]-L[i]<R[i-1]-L[i-1])return 0;
    for(int i=best.second;i<N-1;i++)if(R[i]-L[i]<R[i+1]-L[i+1])return 0;
    return ans;
}

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