oj.uz

Submission #1064004

# Submission time Handle Problem Language Result Execution time Memory
1064004 2024-08-18T07:42:46 Z parsadox2 Soccer Stadium (IOI23_soccer) C++17
6 / 100
 431 ms 301864 KB 
#include "soccer.h"
#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;

const int N = 2e3 + 10;
int n;
vector<vector<int>> a;
vector <int> Dx = {1 , -1 , 0 , 0};
vector <int> Dy = {0 , 0 , 1 , -1};
bool marked[N][N];

bool Check(int aa , int bb)
{
    if(aa < 0 || aa >= n || bb < 0 || bb >= n || marked[aa][bb] || a[aa][bb] == 1)
        return false;
    return true;
}

int Dfs(pair<int , int> v)
{
    marked[v.F][v.S] = true;
    int cnt = 1;
    for(int d = 0 ; d < 4 ; d++)  if(Check(v.F + Dx[d] , v.S + Dy[d]))
        cnt += Dfs(make_pair(v.F + Dx[d] , v.S + Dy[d]));
    return cnt;
}

int Count(int ty , int x , int y)
{
    int res = 0;
    if(ty == 0)
    {
        for(int i = 0 ; i <= x ; i++)  for(int j = 0 ; j <= y ; j++)
            res += (1 - a[i][j]);
    }
    else if(ty == 1)
    {
        for(int i = 0 ; i <= x ; i++)  for(int j = y ; j < n ; j++)
            res += (1 - a[i][j]);
    }
    else if(ty == 2)
    {
        for(int i = x ; i < n ; i++)  for(int j = 0 ; j <= y ; j++)
            res += (1 - a[i][j]);
    }
    else
    {
        for(int i = x ; i < n ; i++)  for(int j = y ; j < n ; j++)
            res += (1 - a[i][j]);
    }
    return res;
}

int biggest_stadium(int nn, vector<std::vector<int>> F)
{
    n = nn;
    a = F;
    int ans = n * n;
    for(int i = 0 ; i < n ; i++)  for(int j = 0 ; j < n ; j++)  if(a[i][j] == 1)
    {
        ans--;
        int tmp = n * n;
        for(int ty = 0 ; ty < 4 ; ty++)
            tmp = min(tmp , Count(ty , i , j));
        ans -= tmp;
    }
    ans = max(ans , 1);
    pair <int , int> star;
    for(int i = 0 ; i < n ; i++)  for(int j = 0 ; j < n ; j++)  if(a[i][j] == 0)
        star = make_pair(i , j);
    ans = min(ans , Dfs(star));
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 1372 KB ok
8 Correct 24 ms 19804 KB ok
9 Correct 431 ms 301864 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 600 KB ok
4 Correct 0 ms 344 KB ok
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 600 KB ok
5 Correct 0 ms 344 KB ok
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 600 KB ok
7 Correct 0 ms 344 KB ok
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 600 KB ok
7 Correct 0 ms 344 KB ok
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 1372 KB ok
9 Correct 24 ms 19804 KB ok
10 Correct 431 ms 301864 KB ok
11 Correct 0 ms 600 KB ok
12 Correct 0 ms 344 KB ok
13 Incorrect 0 ms 348 KB wrong
14 Halted 0 ms 0 KB -