Submission #1206950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206950		HappyCapybara	Soccer Stadium (IOI23_soccer)	C++17	25 / 100	227 ms	31772 KiB

soccer

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

int biggest_stadium(int N, vector<vector<int>> F){
    int res = 0;
    vector<pair<int,int>> v(N, {-1, -1}), w(N, {-1, -1});
    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++){
            if (!F[i][j]){
                res++;
                if (v[i].first == -1) v[i] = {j, j};
                else if (v[i].second != j-1) return 0;
                v[i].second = j;
                if (w[j].first == -1) w[j] = {i, i};
                else if (w[j].second != i-1) return 0;
                w[j].second = i;
            }
        }
        if (v[i] != make_pair(-1, -1)){
            for (int j=0; j<i; j++){
                if (v[j] != make_pair(-1, -1) && ((v[i].first < v[j].first && v[i].second < v[j].second) || (v[j].first < v[i].first && v[j].second < v[i].second))) return 0;
            }
        }
    }
    return res;
}

• 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