Submission #1018066

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018066		kym	Soccer Stadium (IOI23_soccer)	C++17	25 / 100	309 ms	39764 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
const int oo=1'000'000'000ll;
int biggest_stadium(int n, vector<vector<int>> F)
{
    int tot=0;
    for(int i=0;i<n;i++)for(int j=0;j<n;j++)tot+=F[i][j]==0;
    for(int j=0;j<n;j++){ // this checks every column fulfill the condition
        int stage=0;
        for(int i=0;i<n;i++){
            if(stage==0){
                if(F[i][j]==1)continue;
                else stage=1;
            } else if(stage==1){
                if(F[i][j]==1)stage=2;
                else continue;
            } else if(stage==2){
                if(F[i][j]==1)continue;
                else return 0;
            }
        }
    }
    for(int i=0;i<n;i++){
        int stage=0;
        for(int j=0;j<n;j++){
            if(stage==0){
                if(F[i][j]==1)continue;
                else stage=1;
            } else if(stage==1){
                if(F[i][j]==1)stage=2;
                else continue;
            } else if(stage==2){
                if(F[i][j]==1)continue;
                else return 0;
            }
        }
    }
    vector<int> F1(n,oo);
    vector<int> L0(n,-1);
    for(int j=0;j<n;j++){
        for(int i=0;i<n;i++){
            if(F[i][j] == 0){
                L0[j]=i;
            } else{
                F1[j]=min(F1[j],i);
            }
        }
    }

    for(int i=0;i<n;i++){
        vector<int> vec;
        for(int j=0;j<n;j++)if(F[i][j]==0){
            vec.push_back(j);
        }
        if(vec.empty())continue;
        int st=vec[0], en=vec.back();
        int worst=oo;
        for(int i=st;i<=en;i++){
            worst=min(worst,L0[i]);
        }
        int best=0;
        for(int i=0;i<st;i++){
            best=max(best,L0[i]);
        }
        for(int i=en+1;i<n;i++){
            best=max(best,L0[i]);
        }
        if(best>worst){
            return 0;
        }
    }
    return tot;
}

• 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