Submission #1175360

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1175360	2025-03-28 12:54:02	ThylOne	Soccer Stadium (IOI23_soccer)	C++20	1.50 / 100	190 ms	31772 KiB

soccer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
bool a_dans_b(pair<int,int> a, pair<int,int> b){
    return b.first<=a.first && a.second<=b.second;
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int empty = 0;
    int cnt= 0;
    vector<pair<int,int>> inters;
    for(int y = 0 ; y < N ; y++){
        int flag = 0;
        pair<int,int> inter = {-1,-1};
        for(int x = 0 ; x < N ; x++){
            if(F[y][x]==0)empty++;
            if(flag==0 && F[y][x])continue;
            if(flag<=1 && F[y][x]==0){
                if(flag==0)inter.first=x;
                inter.second=x;
                flag=1;
                cnt++;
            }
            if(flag==1 && F[y][x]){
                flag=2;
            }
        }
        inters.push_back(inter);
    }
    if(cnt!=empty){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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