제출 #1225214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225214		amine_aroua	축구 경기장 (IOI23_soccer)	C++20	1.50 / 100	495 ms	298708 KiB

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int cnt = 0;
int xx [] = {-1 , 1 , 0 , 0};
int yy[] = {0 , 0 , -1 , 1};
vector<vector<bool>> vis;
vector<vector<int>> grid;
int get_nest(pair<int ,int> a , pair<int ,int> b)
{
    if(a.first == b.first && a.second == b.second)
        return 2;
    if(a.first <= b.first && b.second <= a.second)
        return 0;
    swap(a , b);
    if(a.first <= b.first && b.second <= a.second)
        return 1;
    return -1;
}
void dfs(int x , int y)
{
    if(vis[x][y])
        return ;
    vis[x][y] = 1;
    cnt++;
    for(int k = 0 ; k < 4 ; k++)
    {
        int nx = x + xx[k] , ny = y + yy[k];
        if(grid[nx][ny] == 0)
            dfs(nx , ny);
    }
}

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    cnt = 0;
    vis.assign(N + 2 ,vector<bool>(N + 2 , 1));
    grid.assign(N + 2 ,vector<int> (N + 2 , 1));
    int ret = 0;
    for(int i= 1 ; i <= N ; i++)
    {
        for(int j = 1 ; j <= N ; j++)
        {
            grid[i][j] = F[i-1][j-1];
            vis[i][j] = 0;
            ret+=(grid[i][j]^1);
        }
    }
    bool check = true;
    vector<pair<int , int>> v(N + 1);
    for(int i = 1 ; i <= N ; i++)
    {
        int ans = 0;
        for(int j = 1 ;j <= N+  1 ; j++)
        {
            ans+=(grid[i][j] != grid[i][j - 1]);
        }
        if(ans != 2 && ans!= 0)
        {
            check = false; 
            break;
        }
        int fr = -1;
        int lst = -1;
        for(int j = 1 ; j <= N ; j++)
        {
            if(grid[i][j] == 0)
            {
                if(fr== -1)
                    fr = j;
                lst = j;
            }
        }
        v[i] = {fr , lst};
    }
    for(int i = 1 ; i <= N ; i++)
    {
        for(int j = 1 ; j <= N ; j++)
        {
            if(grid[i][j] == 0)
            {
                dfs(i , j);
                i = N + 1;
                break;   
            }
        }
    }
    check&= (cnt == ret);
    if(check == false)
        return 0;
    int fr = 0;
    for(int i = 2 ; i <= N ; i++)
    {
        if(v[i].first == -1 || v[i - 1].first == -1)
        {
            continue;
        }
        if(v[i].first == v[i - 1].first && v[i].second == v[i - 1].second)
            continue;
        fr = i;
        break;
    }
    if(fr)
    {
        int sens = get_nest(v[fr - 1] , v[fr]);
        if(sens == -1)
            check = false;
        else
        {
            for(int i = fr + 1 ; i <= N ; i++)
            {
                int nb =get_nest(v[i] , v[i - 1]);
                if(nb == 2)
                    nb = sens; 
                check&=(nb == sens);
            }
        }
    }
    if(check == false)
        ret = 0;
    return ret;
}

• 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