oj.uz

답안 #1076826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076826 2024-08-26T17:00:43 Z mickey080929 축구 경기장 (IOI23_soccer) C++17
25 / 100
 319 ms 55684 KB 
#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};

int biggest_stadium(int N, vector<vector<int>> F) {
    vector<vector<int>> vis(N, vector<int>(N, 0));
    queue<pair<int,int>> q;
    for (int i=0; i<N; i++) {
        for (int j=0; j<N; j++) {
            if (F[i][j] == 0) {
                vis[i][j] = 1;
                q.push({i, j});
                break;
            }
        }
        if (!q.empty()) break;
    }
    while (!q.empty()) {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        for (int k=0; k<4; k++) {
            int nx = x + dx[k];
            int ny = y + dy[k];
            if (nx < 0 || nx >= N || ny < 0 || ny >= N) continue;
            if (vis[nx][ny]) continue;
            if (F[nx][ny]) continue;
            vis[nx][ny] = 1;
            q.push({nx, ny});
        }
    }
    for (int i=0; i<N; i++) {
        for (int j=0; j<N; j++) {
            if (F[i][j] == 0 && vis[i][j] == 0) {
                return 0;
            }
        }
    }
    int tot = 0;
    bool flag = false;
    int pl = -1, pr = -1;
    vector<pair<int,int>> ran;
    for (int i=0; i<N; i++) {
        int l = -1, r = -1, cnt = 0;
        for (int j=0; j<N; j++) {
            if (F[i][j] == 0) {
                if (l == -1) l = j;
                r = j;
                cnt ++;
            }
        }
        if (cnt == 0) {
            pl = -1; pr = -1;
            continue;
        }
        ran.push_back({l, r});
        if (r - l + 1 != cnt) {
            return 0;
        }
        if (pl != -1) {
            if (!flag) {
                if (l <= pl && pr <= r) {}
                else if (pl <= l && r <= pr) {
                    flag = true;
                }
                else return 0;
            }
            else {
                if (pl <= l && r <= pr) {}
                else return 0;
            }
        }
        pl = l; pr = r;
        tot += cnt;
    }
    sort(ran.begin(), ran.end(), [&](pair<int,int> &u, pair<int,int> &v) {
        return u.second - u.first < v.second - v.first;
    });
    for (int i=0; i+1<ran.size(); i++) {
        if (ran[i+1].first <= ran[i].first && ran[i].second <= ran[i+1].second) {}
        else return 0;
    }
    return tot;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:83:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int i=0; i+1<ran.size(); i++) {
      |                   ~~~^~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 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 496 KB partial
8 Partially correct 17 ms 3676 KB partial
9 Partially correct 269 ms 55304 KB partial

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
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 Correct 1 ms 344 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Correct 1 ms 348 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 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 1 ms 344 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 1 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 1 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 Partially correct 0 ms 348 KB partial
24 Partially correct 1 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 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 1 ms 344 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 1 ms 348 KB ok
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 Partially correct 1 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 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 344 KB partial
31 Partially correct 1 ms 604 KB partial
32 Partially correct 1 ms 432 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 1 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 344 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 0 ms 344 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 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 1 ms 344 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 1 ms 348 KB ok
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 Partially correct 1 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 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 344 KB partial
31 Partially correct 1 ms 604 KB partial
32 Partially correct 1 ms 432 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 1 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 344 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 0 ms 344 KB partial
42 Partially correct 20 ms 3920 KB partial
43 Partially correct 23 ms 3676 KB partial
44 Partially correct 33 ms 3716 KB partial
45 Partially correct 17 ms 3672 KB partial
46 Partially correct 21 ms 3716 KB partial
47 Partially correct 27 ms 3720 KB partial
48 Correct 20 ms 3852 KB ok
49 Partially correct 31 ms 3716 KB partial
50 Partially correct 16 ms 3676 KB partial
51 Partially correct 19 ms 3672 KB partial
52 Partially correct 14 ms 3932 KB partial
53 Partially correct 28 ms 3760 KB partial
54 Partially correct 14 ms 3672 KB partial
55 Partially correct 13 ms 3716 KB partial
56 Partially correct 15 ms 3720 KB partial
57 Partially correct 16 ms 4040 KB partial
58 Partially correct 18 ms 3676 KB partial
59 Partially correct 15 ms 3676 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 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 496 KB partial
9 Partially correct 17 ms 3676 KB partial
10 Partially correct 269 ms 55304 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 1 ms 344 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 1 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 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 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 1 ms 348 KB partial
35 Partially correct 0 ms 344 KB partial
36 Partially correct 1 ms 604 KB partial
37 Partially correct 1 ms 432 KB partial
38 Partially correct 1 ms 348 KB partial
39 Correct 1 ms 348 KB ok
40 Correct 0 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 1 ms 348 KB partial
43 Partially correct 1 ms 344 KB partial
44 Partially correct 1 ms 348 KB partial
45 Partially correct 1 ms 348 KB partial
46 Partially correct 0 ms 344 KB partial
47 Partially correct 20 ms 3920 KB partial
48 Partially correct 23 ms 3676 KB partial
49 Partially correct 33 ms 3716 KB partial
50 Partially correct 17 ms 3672 KB partial
51 Partially correct 21 ms 3716 KB partial
52 Partially correct 27 ms 3720 KB partial
53 Correct 20 ms 3852 KB ok
54 Partially correct 31 ms 3716 KB partial
55 Partially correct 16 ms 3676 KB partial
56 Partially correct 19 ms 3672 KB partial
57 Partially correct 14 ms 3932 KB partial
58 Partially correct 28 ms 3760 KB partial
59 Partially correct 14 ms 3672 KB partial
60 Partially correct 13 ms 3716 KB partial
61 Partially correct 15 ms 3720 KB partial
62 Partially correct 16 ms 4040 KB partial
63 Partially correct 18 ms 3676 KB partial
64 Partially correct 15 ms 3676 KB partial
65 Partially correct 305 ms 51756 KB partial
66 Partially correct 252 ms 55376 KB partial
67 Partially correct 214 ms 55376 KB partial
68 Partially correct 269 ms 52568 KB partial
69 Partially correct 319 ms 55380 KB partial
70 Partially correct 307 ms 55380 KB partial
71 Partially correct 276 ms 55380 KB partial
72 Partially correct 268 ms 55380 KB partial
73 Correct 266 ms 55684 KB ok
74 Correct 260 ms 55376 KB ok
75 Partially correct 257 ms 55376 KB partial
76 Partially correct 279 ms 55380 KB partial
77 Partially correct 285 ms 55124 KB partial
78 Partially correct 219 ms 55300 KB partial
79 Partially correct 240 ms 55376 KB partial
80 Partially correct 248 ms 55380 KB partial
81 Partially correct 219 ms 55376 KB partial
82 Partially correct 219 ms 55380 KB partial
83 Partially correct 207 ms 55308 KB partial
84 Partially correct 215 ms 55376 KB partial
85 Partially correct 256 ms 55380 KB partial
86 Partially correct 243 ms 55376 KB partial
87 Partially correct 258 ms 55380 KB partial
88 Partially correct 282 ms 55380 KB partial
89 Partially correct 288 ms 54168 KB partial
90 Partially correct 316 ms 55316 KB partial
91 Partially correct 290 ms 55380 KB partial
92 Partially correct 251 ms 55432 KB partial
93 Partially correct 215 ms 55300 KB partial
94 Partially correct 203 ms 55376 KB partial
95 Partially correct 207 ms 55296 KB partial
96 Partially correct 200 ms 55192 KB partial
97 Partially correct 208 ms 55376 KB partial
98 Partially correct 200 ms 55192 KB partial
99 Partially correct 222 ms 55380 KB partial
100 Partially correct 248 ms 55376 KB partial
101 Partially correct 215 ms 55380 KB partial
102 Partially correct 224 ms 55244 KB partial
103 Partially correct 233 ms 55316 KB partial
104 Partially correct 228 ms 55316 KB partial
105 Partially correct 222 ms 55304 KB partial
106 Partially correct 311 ms 55316 KB partial
107 Partially correct 226 ms 55308 KB partial
108 Partially correct 210 ms 55380 KB partial
109 Partially correct 223 ms 55428 KB partial