oj.uz

답안 #937539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937539 2024-03-04T08:11:02 Z Wansur 축구 경기장 (IOI23_soccer) C++17
25 / 100
 589 ms 418896 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

typedef long long ll;
using namespace std;
struct seg{
    int m1,m2,sum,cnt;
};

const string out[2]={"NO\n","YES\n"};

const ll dx[]={0,1,0,-1,-1,1,1,-1};
const ll dy[]={1,0,-1,0,-1,1,-1,1};
const int mod=998244353;
const int md=1e9+7;
const int mx=2e3+12;
const bool T=0;

bool used[2001][2001];
int n;

void dfs(int x,int y){
    used[x][y]=1;
    for(int i=0;i<4;i++){
        int x1=dx[i]+x,y1=dy[i]+y;
        if(min(x1,y1)>=0 && max(x1,y1)<n && !used[x1][y1]){
            dfs(x1,y1);
        }
    }
}

int biggest_stadium(int N, vector<vector<int>> a){
    int sum=0;
    n=N;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            sum+=!a[i][j];
            if(a[i][j]){
                used[i][j]=1;
            }
        }
    }
    bool ok=0;
    int pos=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(!used[i][j]){
                pos=i;
                if(ok)return 0;
                ok=1;
                dfs(i,j);
            }
        }
    }
    int l=-1,r=-1;
    vector<pair<int,int>> v;
    for(int i=pos;i<n;i++) {
        int tl = -1, tr = -1, sum = 0;
        for (int j = 0; j < n; j++) {
            if (!a[i][j]) {
                ok = 1;
                if (tl == -1) {
                    tl = j;
                }
                tr = j;
                sum++;
            }
        }
        if (tl==-1){
            break;
        }
        if(sum!=tr-tl+1){
            return 0;
        }
        v.push_back({tl,tr});
    }
    for(int i=0;i<v.size();i++){
        auto [l,r]=v[i];
        int mxl=l, mnr=r;
        for(int j=i+1;j<v.size();j++){
            auto [tl, tr]=v[j];
            mxl=max(mxl,tl);
            mnr=min(mnr,tr);
            if(tr > r && (mxl > l || mnr < r))return 0;
            if(tl < l && (mnr < r || mxl > l))return 0;
            if(tr < r && (mxl > tl || mnr < tr))return 0;
            if(tl > l && (mnr < tr || mxl > tl))return 0;
        }
    }
    return sum;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:82:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~
soccer.cpp:85:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int j=i+1;j<v.size();j++){
      |                       ~^~~~~~~~~
soccer.cpp:60:9: warning: unused variable 'l' [-Wunused-variable]
   60 |     int l=-1,r=-1;
      |         ^
soccer.cpp:60:14: warning: unused variable 'r' [-Wunused-variable]
   60 |     int l=-1,r=-1;
      |              ^

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 344 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 1 ms 348 KB partial
7 Partially correct 2 ms 1628 KB partial
8 Partially correct 37 ms 28500 KB partial
9 Partially correct 589 ms 418760 KB partial

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 344 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 1 ms 348 KB ok
10 Partially correct 1 ms 348 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 1 ms 452 KB partial
13 Correct 0 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 344 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 1 ms 348 KB ok
11 Partially correct 1 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 1 ms 452 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 600 KB partial
19 Partially correct 0 ms 344 KB partial
20 Correct 1 ms 344 KB ok
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

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 344 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 1 ms 348 KB ok
13 Partially correct 1 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 452 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 0 ms 600 KB partial
21 Partially correct 0 ms 344 KB partial
22 Correct 1 ms 344 KB ok
23 Correct 1 ms 348 KB ok
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 Partially correct 1 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 1 ms 344 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 1 ms 600 KB ok
35 Correct 1 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 552 KB partial
41 Partially correct 1 ms 348 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 344 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 1 ms 348 KB ok
13 Partially correct 1 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 452 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 0 ms 600 KB partial
21 Partially correct 0 ms 344 KB partial
22 Correct 1 ms 344 KB ok
23 Correct 1 ms 348 KB ok
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 Partially correct 1 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 1 ms 344 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 1 ms 600 KB ok
35 Correct 1 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 552 KB partial
41 Partially correct 1 ms 348 KB partial
42 Partially correct 31 ms 21772 KB partial
43 Partially correct 30 ms 17172 KB partial
44 Partially correct 36 ms 27220 KB partial
45 Partially correct 38 ms 27988 KB partial
46 Partially correct 34 ms 24916 KB partial
47 Partially correct 36 ms 28496 KB partial
48 Correct 27 ms 16724 KB ok
49 Partially correct 28 ms 17812 KB partial
50 Partially correct 27 ms 16980 KB partial
51 Partially correct 17 ms 4952 KB partial
52 Partially correct 20 ms 8272 KB partial
53 Partially correct 18 ms 6236 KB partial
54 Partially correct 19 ms 8028 KB partial
55 Partially correct 21 ms 10064 KB partial
56 Partially correct 24 ms 14428 KB partial
57 Partially correct 30 ms 22604 KB partial
58 Partially correct 30 ms 21584 KB partial
59 Partially correct 29 ms 20048 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 344 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 1 ms 348 KB partial
8 Partially correct 2 ms 1628 KB partial
9 Partially correct 37 ms 28500 KB partial
10 Partially correct 589 ms 418760 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 1 ms 348 KB ok
18 Partially correct 1 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 1 ms 452 KB partial
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 600 KB partial
26 Partially correct 0 ms 344 KB partial
27 Correct 1 ms 344 KB ok
28 Correct 1 ms 348 KB ok
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 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 1 ms 344 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Correct 1 ms 600 KB ok
40 Correct 1 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 552 KB partial
46 Partially correct 1 ms 348 KB partial
47 Partially correct 31 ms 21772 KB partial
48 Partially correct 30 ms 17172 KB partial
49 Partially correct 36 ms 27220 KB partial
50 Partially correct 38 ms 27988 KB partial
51 Partially correct 34 ms 24916 KB partial
52 Partially correct 36 ms 28496 KB partial
53 Correct 27 ms 16724 KB ok
54 Partially correct 28 ms 17812 KB partial
55 Partially correct 27 ms 16980 KB partial
56 Partially correct 17 ms 4952 KB partial
57 Partially correct 20 ms 8272 KB partial
58 Partially correct 18 ms 6236 KB partial
59 Partially correct 19 ms 8028 KB partial
60 Partially correct 21 ms 10064 KB partial
61 Partially correct 24 ms 14428 KB partial
62 Partially correct 30 ms 22604 KB partial
63 Partially correct 30 ms 21584 KB partial
64 Partially correct 29 ms 20048 KB partial
65 Partially correct 481 ms 313376 KB partial
66 Partially correct 276 ms 43696 KB partial
67 Partially correct 263 ms 43600 KB partial
68 Partially correct 537 ms 416804 KB partial
69 Partially correct 561 ms 404252 KB partial
70 Partially correct 514 ms 387868 KB partial
71 Partially correct 543 ms 417108 KB partial
72 Partially correct 549 ms 418896 KB partial
73 Correct 417 ms 231460 KB ok
74 Correct 424 ms 235152 KB ok
75 Partially correct 475 ms 234580 KB partial
76 Partially correct 434 ms 231424 KB partial
77 Partially correct 424 ms 231360 KB partial
78 Partially correct 278 ms 43600 KB partial
79 Partially correct 260 ms 43416 KB partial
80 Partially correct 259 ms 43424 KB partial
81 Partially correct 258 ms 43604 KB partial
82 Partially correct 257 ms 43604 KB partial
83 Partially correct 265 ms 43608 KB partial
84 Partially correct 286 ms 77652 KB partial
85 Partially correct 309 ms 64800 KB partial
86 Partially correct 311 ms 94112 KB partial
87 Partially correct 303 ms 99152 KB partial
88 Partially correct 379 ms 194788 KB partial
89 Partially correct 559 ms 384152 KB partial
90 Partially correct 481 ms 296268 KB partial
91 Partially correct 527 ms 359580 KB partial
92 Partially correct 269 ms 43560 KB partial
93 Partially correct 297 ms 43604 KB partial
94 Partially correct 258 ms 43600 KB partial
95 Partially correct 259 ms 43548 KB partial
96 Partially correct 256 ms 43600 KB partial
97 Partially correct 257 ms 43664 KB partial
98 Partially correct 261 ms 43740 KB partial
99 Partially correct 256 ms 43348 KB partial
100 Partially correct 527 ms 325204 KB partial
101 Partially correct 290 ms 85916 KB partial
102 Partially correct 302 ms 90284 KB partial
103 Partially correct 475 ms 305748 KB partial
104 Partially correct 313 ms 105552 KB partial
105 Partially correct 315 ms 110932 KB partial
106 Partially correct 424 ms 260248 KB partial
107 Partially correct 416 ms 234916 KB partial
108 Partially correct 259 ms 43604 KB partial
109 Partially correct 400 ms 35768 KB partial