Submission #1081844

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081844		LaMatematica14	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	214 ms	39508 KiB

soccer

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

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int tot = 0;
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++) {
            if (!F[i][j]) tot++;
        }
    }
    vector<int> lc(N, -1); // -1 non ancora vuota, 0 vuota, 1 ritrovata piena
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++) {
            if (!F[i][j]) {
                if (lc[j] == 0) continue;
                lc[j]++;
                if (lc[j] == 2) return tot+1;

            }
            else if (lc[j] == 0) lc[j]++;
        }
    }
    fill(lc.begin(), lc.end(), -1);
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++) {
            if (!F[j][i]) {
                if (lc[j] == 0) continue;
                lc[j]++;
                if (lc[j] == 2) return tot+1;

            }
            else if (lc[j] == 0) lc[j]++;
        }
    }
    return tot;
}

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