oj.uz

답안 #937556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937556 2024-03-04T08:32:06 Z Wansur 축구 경기장 (IOI23_soccer) C++17
25 / 100
 567 ms 418836 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;
    int len=0,sg=0;
    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(l==-1){
            l=tl,r=tr;
        }
        if(!(l<=tl && tr<=r || tl<=l && r<=tr) || sum!=tr-tl+1){
            return 0;
        }
        if(r-l+1 <= tr-tl+1){
            if(r-l+1 < tr-tl+1 && sg){
                return 0;
            }
        }
        else{
            sg=1;
        }
        l=tl,r=tr;
        v.push_back({tl,tr});
    }
    sort(v.begin(),v.end(),[](pair<int,int> a,pair<int,int> b){
        return a.s-a.f>b.s-b.f;
    });
    l=v[0].f,r=v[0].s;
    for(auto [tl,tr]: v){
        if(tl < l || tr > r){
            return 0;
        }
        l=tl, r=tr;
    }
    return sum;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:79:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   79 |         if(!(l<=tl && tr<=r || tl<=l && r<=tr) || sum!=tr-tl+1){
      |              ~~~~~~^~~~~~~~
soccer.cpp:61:9: warning: unused variable 'len' [-Wunused-variable]
   61 |     int len=0,sg=0;
      |         ^~~

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 2 ms 1628 KB partial
8 Partially correct 39 ms 27948 KB partial
9 Partially correct 567 ms 411424 KB partial

Subtask #2
2.0 / 8.0

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

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Partially correct 1 ms 344 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 1 ms 344 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 1 ms 344 KB partial
13 Partially correct 1 ms 344 KB partial
14 Correct 1 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 1 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 1 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 1 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 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 1 ms 344 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 1 ms 344 KB partial
15 Partially correct 1 ms 344 KB partial
16 Correct 1 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 1 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 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 1 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 1 ms 440 KB partial
34 Correct 1 ms 504 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 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 1 ms 448 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 1 ms 344 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 1 ms 344 KB partial
15 Partially correct 1 ms 344 KB partial
16 Correct 1 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 1 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 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 1 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 1 ms 440 KB partial
34 Correct 1 ms 504 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 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 348 KB partial
41 Partially correct 1 ms 448 KB partial
42 Partially correct 32 ms 21784 KB partial
43 Partially correct 33 ms 16904 KB partial
44 Partially correct 43 ms 27232 KB partial
45 Partially correct 37 ms 27884 KB partial
46 Partially correct 34 ms 25036 KB partial
47 Partially correct 38 ms 28496 KB partial
48 Correct 26 ms 16732 KB ok
49 Partially correct 38 ms 17700 KB partial
50 Partially correct 28 ms 16732 KB partial
51 Partially correct 17 ms 4956 KB partial
52 Partially correct 18 ms 8284 KB partial
53 Partially correct 19 ms 6492 KB partial
54 Partially correct 18 ms 8028 KB partial
55 Partially correct 20 ms 10076 KB partial
56 Partially correct 25 ms 14416 KB partial
57 Partially correct 33 ms 22720 KB partial
58 Partially correct 31 ms 21592 KB partial
59 Partially correct 28 ms 20060 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 2 ms 1628 KB partial
9 Partially correct 39 ms 27948 KB partial
10 Partially correct 567 ms 411424 KB partial
11 Partially correct 1 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Partially correct 1 ms 344 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 1 ms 344 KB partial
20 Partially correct 1 ms 344 KB partial
21 Correct 1 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 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Correct 1 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 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 1 ms 348 KB partial
35 Partially correct 1 ms 348 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 1 ms 440 KB partial
39 Correct 1 ms 504 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 348 KB partial
44 Partially correct 1 ms 348 KB partial
45 Partially correct 1 ms 348 KB partial
46 Partially correct 1 ms 448 KB partial
47 Partially correct 32 ms 21784 KB partial
48 Partially correct 33 ms 16904 KB partial
49 Partially correct 43 ms 27232 KB partial
50 Partially correct 37 ms 27884 KB partial
51 Partially correct 34 ms 25036 KB partial
52 Partially correct 38 ms 28496 KB partial
53 Correct 26 ms 16732 KB ok
54 Partially correct 38 ms 17700 KB partial
55 Partially correct 28 ms 16732 KB partial
56 Partially correct 17 ms 4956 KB partial
57 Partially correct 18 ms 8284 KB partial
58 Partially correct 19 ms 6492 KB partial
59 Partially correct 18 ms 8028 KB partial
60 Partially correct 20 ms 10076 KB partial
61 Partially correct 25 ms 14416 KB partial
62 Partially correct 33 ms 22720 KB partial
63 Partially correct 31 ms 21592 KB partial
64 Partially correct 28 ms 20060 KB partial
65 Partially correct 487 ms 313228 KB partial
66 Partially correct 259 ms 43432 KB partial
67 Partially correct 240 ms 43536 KB partial
68 Partially correct 548 ms 417192 KB partial
69 Partially correct 523 ms 404220 KB partial
70 Partially correct 532 ms 388180 KB partial
71 Partially correct 547 ms 417340 KB partial
72 Partially correct 535 ms 418836 KB partial
73 Correct 405 ms 231572 KB ok
74 Correct 404 ms 235016 KB ok
75 Partially correct 408 ms 235032 KB partial
76 Partially correct 417 ms 231428 KB partial
77 Partially correct 424 ms 231444 KB partial
78 Partially correct 235 ms 43536 KB partial
79 Partially correct 248 ms 43604 KB partial
80 Partially correct 241 ms 43664 KB partial
81 Partially correct 240 ms 43408 KB partial
82 Partially correct 246 ms 43672 KB partial
83 Partially correct 247 ms 43504 KB partial
84 Partially correct 274 ms 77648 KB partial
85 Partially correct 255 ms 64856 KB partial
86 Partially correct 284 ms 94288 KB partial
87 Partially correct 298 ms 99156 KB partial
88 Partially correct 374 ms 194640 KB partial
89 Partially correct 531 ms 384300 KB partial
90 Partially correct 447 ms 296244 KB partial
91 Partially correct 493 ms 359164 KB partial
92 Partially correct 248 ms 43544 KB partial
93 Partially correct 244 ms 43412 KB partial
94 Partially correct 238 ms 43604 KB partial
95 Partially correct 237 ms 43600 KB partial
96 Partially correct 240 ms 43412 KB partial
97 Partially correct 249 ms 43412 KB partial
98 Partially correct 246 ms 43536 KB partial
99 Partially correct 238 ms 43348 KB partial
100 Partially correct 470 ms 325224 KB partial
101 Partially correct 270 ms 85664 KB partial
102 Partially correct 286 ms 90452 KB partial
103 Partially correct 456 ms 305812 KB partial
104 Partially correct 288 ms 105552 KB partial
105 Partially correct 290 ms 111124 KB partial
106 Partially correct 410 ms 260388 KB partial
107 Partially correct 411 ms 234912 KB partial
108 Partially correct 239 ms 43544 KB partial
109 Partially correct 240 ms 35788 KB partial