oj.uz

답안 #937644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937644 2024-03-04T10:06:45 Z Wansur 축구 경기장 (IOI23_soccer) C++17
12 / 100
 26 ms 27480 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;

int dp[61][61][61][61];
int pref[61][61];
int n;

int get(int i,int l,int r){
    if(!l)return pref[i][r];
    return pref[i][r]-pref[i][l-1];
}

int biggest_stadium(int N, vector<vector<int>> a) {
    n = N;
    if (n > 30) {
        return 0;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            pref[i][j] = a[i][j];
            if (j)pref[i][j] += pref[i][j - 1];
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int l=0;l<n;l++){
                for(int r=0;r<n;r++){
                    dp[i][j][l][r]=-1e9;
                }
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int l=0;l<n;l++){
            for(int r=l;r<n;r++){
                if(a[i][r])break;
                dp[i][i][l][r]=r-l+1;
            }
        }
    }
    for(int len=2;len<=n;len++){
        for(int i=0;i+len-1<n;i++){
            int j=i+len-1;
            for(int len=1;len<=n;len++){
                for(int l=0;l+len-1<n;l++){
                    int r=l+len-1;
                    if(!get(i,l,r)){
                        for(int tl=l;tl>=0;tl--){
                            for(int tr=r;tr<n;tr++){
                                dp[i][j][l][r]=max(dp[i][j][l][r], dp[i+1][j][tl][tr] + r-l+1);
                            }
                        }
                    }
                    if(!get(j,l,r)){
                        for(int tl=l;tl>=0;tl--){
                            for(int tr=r;tr<n;tr++){
                                dp[i][j][l][r]=max(dp[i][j][l][r], dp[i][j-1][tl][tr] + r-l+1);
                            }
                        }
                    }
                    ans=max(ans,dp[i][j][l][r]);
                }
            }
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB ok

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB ok
2 Correct 0 ms 2396 KB ok
3 Correct 1 ms 8540 KB ok
4 Correct 1 ms 8536 KB ok
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB ok
2 Correct 0 ms 2396 KB ok
3 Correct 1 ms 2396 KB ok
4 Correct 1 ms 2396 KB ok
5 Correct 0 ms 2396 KB ok
6 Correct 1 ms 2396 KB ok
7 Correct 1 ms 2488 KB ok
8 Correct 2 ms 2396 KB ok
9 Correct 1 ms 2396 KB ok
10 Correct 1 ms 2396 KB ok
11 Partially correct 1 ms 2392 KB partial
12 Correct 1 ms 2392 KB ok
13 Correct 1 ms 2488 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB ok
2 Correct 2 ms 2396 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 2396 KB ok
5 Correct 1 ms 2396 KB ok
6 Correct 0 ms 2396 KB ok
7 Correct 1 ms 2396 KB ok
8 Correct 1 ms 2488 KB ok
9 Correct 2 ms 2396 KB ok
10 Correct 1 ms 2396 KB ok
11 Correct 1 ms 2396 KB ok
12 Partially correct 1 ms 2392 KB partial
13 Correct 1 ms 2392 KB ok
14 Correct 1 ms 2488 KB ok
15 Correct 1 ms 6492 KB ok
16 Correct 1 ms 6492 KB ok
17 Correct 3 ms 6492 KB ok
18 Correct 2 ms 6492 KB ok
19 Correct 1 ms 6492 KB ok
20 Correct 1 ms 6492 KB ok
21 Correct 1 ms 6592 KB ok
22 Correct 1 ms 6592 KB ok
23 Correct 1 ms 6492 KB ok
24 Correct 1 ms 6492 KB ok
25 Correct 1 ms 6492 KB ok
26 Correct 1 ms 6492 KB ok

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB ok
2 Correct 2 ms 2396 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 8540 KB ok
5 Correct 1 ms 8536 KB ok
6 Correct 1 ms 2396 KB ok
7 Correct 1 ms 2396 KB ok
8 Correct 0 ms 2396 KB ok
9 Correct 1 ms 2396 KB ok
10 Correct 1 ms 2488 KB ok
11 Correct 2 ms 2396 KB ok
12 Correct 1 ms 2396 KB ok
13 Correct 1 ms 2396 KB ok
14 Partially correct 1 ms 2392 KB partial
15 Correct 1 ms 2392 KB ok
16 Correct 1 ms 2488 KB ok
17 Correct 1 ms 6492 KB ok
18 Correct 1 ms 6492 KB ok
19 Correct 3 ms 6492 KB ok
20 Correct 2 ms 6492 KB ok
21 Correct 1 ms 6492 KB ok
22 Correct 1 ms 6492 KB ok
23 Correct 1 ms 6592 KB ok
24 Correct 1 ms 6592 KB ok
25 Correct 1 ms 6492 KB ok
26 Correct 1 ms 6492 KB ok
27 Correct 1 ms 6492 KB ok
28 Correct 1 ms 6492 KB ok
29 Correct 1 ms 6492 KB ok
30 Correct 25 ms 27228 KB ok
31 Correct 13 ms 27256 KB ok
32 Correct 8 ms 27228 KB ok
33 Correct 6 ms 27480 KB ok
34 Correct 8 ms 27224 KB ok
35 Correct 12 ms 27224 KB ok
36 Correct 6 ms 27228 KB ok
37 Correct 7 ms 27228 KB ok
38 Correct 8 ms 27228 KB ok
39 Correct 8 ms 27228 KB ok
40 Correct 22 ms 27228 KB ok
41 Correct 26 ms 27232 KB ok

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB ok
2 Correct 2 ms 2396 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 8540 KB ok
5 Correct 1 ms 8536 KB ok
6 Correct 1 ms 2396 KB ok
7 Correct 1 ms 2396 KB ok
8 Correct 0 ms 2396 KB ok
9 Correct 1 ms 2396 KB ok
10 Correct 1 ms 2488 KB ok
11 Correct 2 ms 2396 KB ok
12 Correct 1 ms 2396 KB ok
13 Correct 1 ms 2396 KB ok
14 Partially correct 1 ms 2392 KB partial
15 Correct 1 ms 2392 KB ok
16 Correct 1 ms 2488 KB ok
17 Correct 1 ms 6492 KB ok
18 Correct 1 ms 6492 KB ok
19 Correct 3 ms 6492 KB ok
20 Correct 2 ms 6492 KB ok
21 Correct 1 ms 6492 KB ok
22 Correct 1 ms 6492 KB ok
23 Correct 1 ms 6592 KB ok
24 Correct 1 ms 6592 KB ok
25 Correct 1 ms 6492 KB ok
26 Correct 1 ms 6492 KB ok
27 Correct 1 ms 6492 KB ok
28 Correct 1 ms 6492 KB ok
29 Correct 1 ms 6492 KB ok
30 Correct 25 ms 27228 KB ok
31 Correct 13 ms 27256 KB ok
32 Correct 8 ms 27228 KB ok
33 Correct 6 ms 27480 KB ok
34 Correct 8 ms 27224 KB ok
35 Correct 12 ms 27224 KB ok
36 Correct 6 ms 27228 KB ok
37 Correct 7 ms 27228 KB ok
38 Correct 8 ms 27228 KB ok
39 Correct 8 ms 27228 KB ok
40 Correct 22 ms 27228 KB ok
41 Correct 26 ms 27232 KB ok
42 Partially correct 16 ms 2908 KB partial
43 Partially correct 15 ms 2876 KB partial
44 Partially correct 19 ms 2832 KB partial
45 Partially correct 19 ms 2684 KB partial
46 Partially correct 15 ms 2908 KB partial
47 Partially correct 15 ms 2904 KB partial
48 Incorrect 15 ms 2904 KB wrong
49 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB ok
2 Correct 2 ms 2396 KB ok
3 Correct 0 ms 2396 KB ok
4 Correct 1 ms 8540 KB ok
5 Correct 1 ms 8536 KB ok
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -