답안 #1056264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056264	2024-08-13T08:32:01 Z	Ignut	축구 경기장 (IOI23_soccer)	C++17	3.5 / 100	167 ms	51764 KB

soccer

/* Ignut
started: 13.08.2024
now: 13.08.2024
████████████████████████████████████████████████████████████████████
████████████████████████████████    ████████████████████████████████
██████████████████████████████        ██████████████████████████████
██████      ██████████████████        ██████████████████      ██████
██████          ██████████████        ██████████████          ██████
██████      ██    ████████████        ████████████    ██      ██████
██████      ████    ██████████        ██████████    ████      ██████
██████      ████      ██████████    ██████████      ████      ██████
██████      ████      ██████████    ██████████    ██████      ██████
██████      ██████    ██████████    ██████████    ██████      ██████
██████      ██████    ████████        ████████    ██████      ██████
██████      ██████      ██████        ██████      ██████      ██████
██████      ████        ████            ████        ████      ██████
██████            ██████████    ████    ██████████            ██████
██████      ██      ██████    ████████    ██████      ██      ██████
██████      ██████            ████████            ██████      ██████
██████                    ██            ██                    ██████
██████████████████████      ████    ████      ██████████████████████
████████████████████████      ██    ██      ████████████████████████
██████████████████████████                ██████████████████████████
██████████████████████████████        ██████████████████████████████
████████████████████████████████████████████████████████████████████
*/

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 2222;
int n;
vector<vector<int>> f;

bool used[MAXN][MAXN];

vector<pair<int, int>> delta = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};

bool Good(int i, int j) {
    return i >= 0 && j >= 0 && i < n && j < n && f[i][j] == 0 && !used[i][j];
}

int cnt = 0;
void dfs(int i, int j) {
    cnt ++;
    used[i][j] = true;
    for (auto [di, dj] : delta) {
        int ci = i + di, cj = j + dj;
        if (Good(ci, cj)) {
            dfs(ci, cj);
        }
    }
}

int biggest_stadium(int N, vector<vector<int>> F) {
    // for (int i = 0; i < N; i ++) {
    //     for (int j = 0; j < N; j ++) {
    //         if (F[i][j] == 0) continue;
    //         int mn = N * N;
    //         mn = min(mn, (i + 1) * (j + 1));
    //         mn = min(mn, (N - i) * (N - j));
    //         mn = min(mn, (N - i) * (j + 1));
    //         mn = min(mn, (i + 1) * (N - j));
    //         return N * N - mn;
    //     }
    // }
    for (int i = 0; i < N; i ++)
        for (int j = 0; j < N; j ++)
            used[i][j] = false;

    n = N;
    f = F;
    int prev_l = -1, prev_r = -1;
    bool have_sm = false;
    for (int i = 0; i < N; i ++) {
        int first = -1, last = -1, cnt = 0;
        for (int j = 0; j < N; j ++) {
            if (F[i][j] == 1) continue;
            if (first == -1) first = j;
            last = j;
            cnt ++;
        }
        if (cnt > 0 && cnt != last - first + 1) return 1;

        if (prev_l == -1) {
            prev_l = first;
            prev_r = last;
            continue;
        }
        if (cnt == 0) continue;

        bool sm = false;
        if (first > prev_l || last < prev_r) sm = true;
        bool bg = false;
        if (first < prev_l || last > prev_r) bg = true;
        
        if (sm && bg) return 1;
        if (bg && have_sm) return 1;
        if (sm) have_sm = true;

        prev_l = first;
        prev_r = last;
    }

    prev_l = -1, prev_r = -1;
    have_sm = false;
    for (int j = 0; j < N; j ++) {
        int first = -1, last = -1, cnt = 0;
        for (int i = 0; i < N; i ++) {
            if (F[i][j] == 1) continue;
            if (first == -1) first = i;
            last = i;
            cnt ++;
        }
        if (cnt > 0 && cnt != last - first + 1) return 1;
     
        if (prev_l == -1) {
            prev_l = first;
            prev_r = last;
            continue;
        }
        if (cnt == 0) continue;

        bool sm = false;
        if (first > prev_l || last < prev_r) sm = true;
        bool bg = false;
        if (first < prev_l || last > prev_r) bg = true;
        
        if (sm && bg) return 1;
        if (bg && have_sm) return 1;
        if (sm) have_sm = true;
        
        prev_l = first;
        prev_r = last;
    }

    for (int i = 0; i < N; i ++) {
        for (int j = 0; j < N; j ++) {
            if (F[i][j] == 1) continue;
            int up = 0;
            for (int ii = i; ii >= 0; ii --) {
                if (F[ii][j] == 1) break;
                up ++;
            }
            int left = 0;
            for (int jj = j; jj >= 0; jj --) {
                if (F[i][jj] == 1) break;
                left ++;
            }
            if (Good(i - up, j - left)) return 1;
        }
    }

    int i0, j0;
    for (int i = 0; i < N; i ++)
        for (int j = 0; j < N; j ++)
            if (F[i][j] == 0)
                i0 = i, j0 = j;
    cnt = 0;
    dfs(i0, j0);

    int sum = N * N;
    for (int i = 0; i < N; i ++)
        for (int j = 0; j < N; j ++)
            sum -= F[i][j];

    if (cnt != sum) return 1;
    
    return sum;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:162:8: warning: 'i0' may be used uninitialized in this function [-Wmaybe-uninitialized]
  162 |     dfs(i0, j0);
      |     ~~~^~~~~~~~
soccer.cpp:162:8: warning: 'j0' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #0
0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	1 ms	348 KB	partial

Subtask #1
1.5 / 6.0

#	결과	실행 시간	메모리	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	Partially correct	0 ms	348 KB	partial
7	Partially correct	1 ms	2652 KB	partial
8	Partially correct	10 ms	5536 KB	partial
9	Partially correct	167 ms	51764 KB	partial

Subtask #2
2.0 / 8.0

#	결과	메모리	Grader output
1	Correct	348 KB	ok
2	Correct	348 KB	ok
3	Partially correct	348 KB	partial
4	Partially correct	348 KB	partial
5	Partially correct	348 KB	partial
6	Partially correct	348 KB	partial
7	Partially correct	348 KB	partial
8	Correct	348 KB	ok
9	Correct	348 KB	ok
10	Partially correct	348 KB	partial
11	Partially correct	348 KB	partial
12	Partially correct	348 KB	partial
13	Correct	348 KB	ok

Subtask #3
0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	1 ms	348 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Partially correct	0 ms	348 KB	partial
5	Partially correct	0 ms	348 KB	partial
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	348 KB	ok
11	Partially correct	0 ms	348 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Partially correct	0 ms	348 KB	partial
14	Correct	0 ms	348 KB	ok
15	Partially correct	1 ms	348 KB	partial
16	Partially correct	0 ms	348 KB	partial
17	Partially correct	0 ms	348 KB	partial
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Correct	0 ms	348 KB	ok
21	Correct	0 ms	348 KB	ok
22	Partially correct	0 ms	348 KB	partial
23	Incorrect	0 ms	348 KB	wrong
24	Halted	0 ms	0 KB	-

Subtask #4
0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	1 ms	348 KB	partial
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	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Partially correct	0 ms	348 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Partially correct	0 ms	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	348 KB	partial
16	Correct	0 ms	348 KB	ok
17	Partially correct	1 ms	348 KB	partial
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Partially correct	0 ms	348 KB	partial
21	Partially correct	0 ms	348 KB	partial
22	Correct	0 ms	348 KB	ok
23	Correct	0 ms	348 KB	ok
24	Partially correct	0 ms	348 KB	partial
25	Incorrect	0 ms	348 KB	wrong
26	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	1 ms	348 KB	partial
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	Partially correct	0 ms	348 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Partially correct	0 ms	348 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	348 KB	ok
13	Partially correct	0 ms	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	348 KB	partial
16	Correct	0 ms	348 KB	ok
17	Partially correct	1 ms	348 KB	partial
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Partially correct	0 ms	348 KB	partial
21	Partially correct	0 ms	348 KB	partial
22	Correct	0 ms	348 KB	ok
23	Correct	0 ms	348 KB	ok
24	Partially correct	0 ms	348 KB	partial
25	Incorrect	0 ms	348 KB	wrong
26	Halted	0 ms	0 KB	-

Subtask #6
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	1 ms	348 KB	partial
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	Partially correct	0 ms	348 KB	partial
8	Partially correct	1 ms	2652 KB	partial
9	Partially correct	10 ms	5536 KB	partial
10	Partially correct	167 ms	51764 KB	partial
11	Partially correct	0 ms	348 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Partially correct	0 ms	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	348 KB	partial
16	Correct	0 ms	348 KB	ok
17	Correct	0 ms	348 KB	ok
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Partially correct	0 ms	348 KB	partial
21	Correct	0 ms	348 KB	ok
22	Partially correct	1 ms	348 KB	partial
23	Partially correct	0 ms	348 KB	partial
24	Partially correct	0 ms	348 KB	partial
25	Partially correct	0 ms	348 KB	partial
26	Partially correct	0 ms	348 KB	partial
27	Correct	0 ms	348 KB	ok
28	Correct	0 ms	348 KB	ok
29	Partially correct	0 ms	348 KB	partial
30	Incorrect	0 ms	348 KB	wrong
31	Halted	0 ms	0 KB	-

답안 #1056264

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 1.5 / 6.0

Subtask #2 2.0 / 8.0

Subtask #3 0.0 / 22.0

Subtask #4 0.0 / 18.0

Subtask #5 0.0 / 16.0

Subtask #6 0.0 / 30.0

Subtask #0
0.0 / 0.0

Subtask #1
1.5 / 6.0

Subtask #2
2.0 / 8.0

Subtask #3
0.0 / 22.0

Subtask #4
0.0 / 18.0

Subtask #5
0.0 / 16.0

Subtask #6
0.0 / 30.0