oj.uz

답안 #1038420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038420 2024-07-29T19:08:23 Z fv3 축구 경기장 (IOI23_soccer) C++17
25 / 100
 272 ms 63344 KB 
#include "soccer.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;

vector<vector<int>> ps_h, ps_v;

bool gethrange(int l, int r, int y)
{
    if (l > r) swap(l, r);
    return ps_h[y][r + 1] - ps_h[y][l];
}

bool getvrange(int l, int r, int x)
{
    if (l > r) swap(l, r);
    return ps_v[x][r + 1] - ps_v[x][l];
}

int biggest_stadium(int N, vector<vector<int>> F)
{
    int res = 0;
 
    ps_h = ps_v = vector<vector<int>>(N, vector<int>(N+1));
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            ps_h[i][j + 1] = ps_h[i][j] + F[i][j];
            ps_v[i][j + 1] = ps_v[i][j] + F[j][i];
        }
    }
 
    int top;
    int topl, topr;
    for (int i = 0; i < N; i++)
    {
        if (ps_h[i][N] == N) continue;
        for (int j = 0; j < N; j++)
        {
            if (F[i][j]) continue;
            if (ps_h[i][j + (N - ps_h[i][N])] - ps_h[i][j])
                return -1;
 
            top = i;
            topl = j;
            topr = j + (N - ps_h[i][N] - 1);
 
            break;
        }
        break;
    }
 
    int btm;
    int btml, btmr;
    for (int i = N-1; i >= 0; i--)
    {
        if (ps_h[i][N] == N) continue;
        for (int j = 0; j < N; j++)
        {
            if (F[i][j]) continue;
            if (ps_h[i][j + (N - ps_h[i][N])] - ps_h[i][j])
                return -1;
 
            btm = i;
            btml = j;
            btmr = j + (N - ps_h[i][N] - 1);
 
            break;
        }
        break;
    }
 
    int lft;
    int lft_up, lft_dwn;
    for (int i = 0; i < N; i++)
    {
        if (ps_v[i][N] == N) continue;
        for (int j = 0; j < N; j++)
        {
            if (F[j][i]) continue;
            if (ps_v[i][j + (N - ps_v[i][N])] - ps_v[i][j])
                return -1;

            lft = i;
            lft_up = j;
            lft_dwn = j + (N - ps_v[i][N] - 1);
            break;
        }
        break;
    }
 
    int right;
    int right_up, right_dwn;
    for (int i = N-1; i >= 0; i--)
    {
        if (ps_v[i][N] == N) continue;
        for (int j = 0; j < N; j++)
        {
            if (F[j][i]) continue;
            if (ps_v[i][j + (N - ps_v[i][N])] - ps_v[i][j])
                return -1;

            right = i;
            right_up = j;
            right_dwn = j + (N - ps_v[i][N] - 1);
            break;
        }
        break;
    }
 
    if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
        return -1;
 
    int v = max(max(lft_up, right_up), min(lft_dwn, right_dwn));
    if (!(topl >= btml && topr <= btmr) && !(topl <= btml && topr >= btmr))
        return -1;
    int h = max(max(topl, btml), min(topr, btmr));
 
    int cnt = 0;
    for (int x = 0; x < N; x++)
    {
        for (int y = 0; y < N; y++)
        {
            if (F[y][x]) 
                continue;
            cnt++;
 
            if (gethrange(x, h, y))
                return -1;
            if (getvrange(y, v, x))
                return -1;
        }
    }
 
    for (int x = 0; x < N; x++)
    {
        for (int y = 0; y < N; y++)
        {
            if (F[y][x]) 
                continue;
 
            {
                bool b1 = getvrange(y, lft_up, x) || gethrange(x, lft, lft_up);
                bool b2 = getvrange(y, lft_up, lft) || gethrange(x, lft, y);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, right_up, x) || gethrange(x, right, right_up);
                bool b2 = getvrange(y, right_up, right) || gethrange(x, right, y);
      
                if (b1 && b2)
                    return -1;    
            }
            
            {
                bool b1 = getvrange(y, lft_dwn, x) || gethrange(x, lft, lft_dwn);
                bool b2 = getvrange(y, lft_dwn, lft) || gethrange(x, lft, y);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, right_dwn, x) || gethrange(x, right, right_dwn);
                bool b2 = getvrange(y, right_dwn, right) || gethrange(x, right, y);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, top, topl) || gethrange(x, topl, y);
                bool b2 = getvrange(y, top, x) || gethrange(x, topl, top);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, top, topr) || gethrange(x, topr, y);
                bool b2 = getvrange(y, top, x) || gethrange(x, topr, top);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, btm, btml) || gethrange(x, btml, y);
                bool b2 = getvrange(y, btm, x) || gethrange(x, btml, btm);
      
                if (b1 && b2)
                    return -1;    
            }
 
            {
                bool b1 = getvrange(y, btm, btmr) || gethrange(x, btmr, y);
                bool b2 = getvrange(y, btm, x) || gethrange(x, btmr, btm);
      
                if (b1 && b2)
                    return -1;    
            }
        }
    }
 
    return cnt;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:23:9: warning: unused variable 'res' [-Wunused-variable]
   23 |     int res = 0;
      |         ^~~
soccer.cpp:113:18: warning: 'right_up' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |           ~~~~~~~^~~~~~~~~~~
soccer.cpp:113:41: warning: 'right_dwn' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |                                 ~~~~~~~~^~~~~~~~~~~~
soccer.cpp:113:18: warning: 'right_up' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |           ~~~~~~~^~~~~~~~~~~
soccer.cpp:113:41: warning: 'right_dwn' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |                                 ~~~~~~~~^~~~~~~~~~~~
soccer.cpp:113:18: warning: 'right_up' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |           ~~~~~~~^~~~~~~~~~~
soccer.cpp:113:41: warning: 'right_dwn' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |     if (!(lft_up >= right_up && lft_dwn <= right_dwn) && !(lft_up <= right_up && lft_dwn >= right_dwn))
      |                                 ~~~~~~~~^~~~~~~~~~~~
soccer.cpp:75:9: warning: 'lft' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     int lft;
      |         ^~~
soccer.cpp:17:5: warning: 'btm' may be used uninitialized in this function [-Wmaybe-uninitialized]
   17 |     if (l > r) swap(l, r);
      |     ^~
soccer.cpp:55:9: note: 'btm' was declared here
   55 |     int btm;
      |         ^~~
soccer.cpp:17:5: warning: 'top' may be used uninitialized in this function [-Wmaybe-uninitialized]
   17 |     if (l > r) swap(l, r);
      |     ^~
soccer.cpp:35:9: note: 'top' was declared here
   35 |     int top;
      |         ^~~
soccer.cpp:94:9: warning: 'right' may be used uninitialized in this function [-Wmaybe-uninitialized]
   94 |     int right;
      |         ^~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 512 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 348 KB partial
8 Partially correct 12 ms 4248 KB partial
9 Partially correct 209 ms 63256 KB partial

Subtask #2
2.0 / 8.0

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

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 512 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 1 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 0 ms 344 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 Partially correct 1 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

Subtask #4
4.5 / 18.0

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

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 512 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 1 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 0 ms 344 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 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 0 ms 344 KB partial
40 Partially correct 0 ms 600 KB partial
41 Partially correct 0 ms 344 KB partial
42 Partially correct 13 ms 4188 KB partial
43 Partially correct 13 ms 4188 KB partial
44 Partially correct 18 ms 4188 KB partial
45 Partially correct 13 ms 4188 KB partial
46 Partially correct 19 ms 4188 KB partial
47 Partially correct 13 ms 4200 KB partial
48 Correct 15 ms 4420 KB ok
49 Partially correct 12 ms 4188 KB partial
50 Partially correct 13 ms 4184 KB partial
51 Partially correct 14 ms 4188 KB partial
52 Partially correct 12 ms 4400 KB partial
53 Partially correct 14 ms 4184 KB partial
54 Partially correct 14 ms 4188 KB partial
55 Partially correct 15 ms 4188 KB partial
56 Partially correct 13 ms 4188 KB partial
57 Partially correct 12 ms 4188 KB partial
58 Partially correct 12 ms 4188 KB partial
59 Partially correct 13 ms 4188 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 512 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 348 KB partial
9 Partially correct 12 ms 4248 KB partial
10 Partially correct 209 ms 63256 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 1 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 0 ms 344 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 Partially correct 1 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 0 ms 348 KB partial
44 Partially correct 0 ms 344 KB partial
45 Partially correct 0 ms 600 KB partial
46 Partially correct 0 ms 344 KB partial
47 Partially correct 13 ms 4188 KB partial
48 Partially correct 13 ms 4188 KB partial
49 Partially correct 18 ms 4188 KB partial
50 Partially correct 13 ms 4188 KB partial
51 Partially correct 19 ms 4188 KB partial
52 Partially correct 13 ms 4200 KB partial
53 Correct 15 ms 4420 KB ok
54 Partially correct 12 ms 4188 KB partial
55 Partially correct 13 ms 4184 KB partial
56 Partially correct 14 ms 4188 KB partial
57 Partially correct 12 ms 4400 KB partial
58 Partially correct 14 ms 4184 KB partial
59 Partially correct 14 ms 4188 KB partial
60 Partially correct 15 ms 4188 KB partial
61 Partially correct 13 ms 4188 KB partial
62 Partially correct 12 ms 4188 KB partial
63 Partially correct 12 ms 4188 KB partial
64 Partially correct 13 ms 4188 KB partial
65 Partially correct 209 ms 63312 KB partial
66 Partially correct 237 ms 63256 KB partial
67 Partially correct 206 ms 63316 KB partial
68 Partially correct 206 ms 63252 KB partial
69 Partially correct 197 ms 63252 KB partial
70 Partially correct 206 ms 63316 KB partial
71 Partially correct 193 ms 63312 KB partial
72 Partially correct 237 ms 63316 KB partial
73 Correct 272 ms 63272 KB ok
74 Correct 269 ms 63260 KB ok
75 Partially correct 228 ms 63256 KB partial
76 Partially correct 194 ms 63268 KB partial
77 Partially correct 201 ms 63316 KB partial
78 Partially correct 195 ms 63172 KB partial
79 Partially correct 197 ms 63316 KB partial
80 Partially correct 242 ms 63256 KB partial
81 Partially correct 197 ms 63320 KB partial
82 Partially correct 192 ms 63312 KB partial
83 Partially correct 197 ms 63252 KB partial
84 Partially correct 223 ms 63312 KB partial
85 Partially correct 233 ms 63316 KB partial
86 Partially correct 227 ms 63320 KB partial
87 Partially correct 226 ms 63344 KB partial
88 Partially correct 199 ms 63316 KB partial
89 Partially correct 210 ms 63312 KB partial
90 Partially correct 198 ms 63312 KB partial
91 Partially correct 211 ms 63268 KB partial
92 Partially correct 188 ms 63312 KB partial
93 Partially correct 229 ms 63316 KB partial
94 Partially correct 218 ms 63260 KB partial
95 Partially correct 220 ms 63312 KB partial
96 Partially correct 204 ms 63316 KB partial
97 Partially correct 238 ms 63312 KB partial
98 Partially correct 195 ms 63312 KB partial
99 Partially correct 222 ms 63316 KB partial
100 Partially correct 193 ms 63272 KB partial
101 Partially correct 197 ms 63312 KB partial
102 Partially correct 203 ms 63260 KB partial
103 Partially correct 204 ms 63252 KB partial
104 Partially correct 210 ms 63316 KB partial
105 Partially correct 198 ms 63316 KB partial
106 Partially correct 266 ms 63316 KB partial
107 Partially correct 194 ms 63316 KB partial
108 Partially correct 228 ms 63256 KB partial
109 Partially correct 212 ms 63316 KB partial