oj.uz

답안 #915925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915925 2024-01-24T22:47:03 Z biank 축구 경기장 (IOI23_soccer) C++17
64 / 100
 1512 ms 64284 KB 
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define SIZE(x) (int)x.size()
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define forn(i,n) for(int i=0;i<int(n);i++)
#define dforsn(i,s,n) for(int i=int(n)-1;i>=int(s);i--)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)
#define fst first
#define snd second
typedef pair<int,int> ii;
const int MAXN = 500;
int f[MAXN][MAXN];
int dp[MAXN][MAXN];
ii ran[MAXN][MAXN];
int L[MAXN][MAXN], R[MAXN][MAXN];

int n;

pair<int,ii> solve(int l, int r, int p) {
    if(l>r) return {0LL,{-1,n}};
    if(dp[l][r]!=-1) return {dp[l][r],ran[l][r]};
    auto calculate = [&](pair<int,ii> prev, int i) {
        auto [val,range] = prev;
        int mini = max(range.fst, L[i][p]), maxi = min(range.snd, R[i][p]);
        return (pair<int,ii>){val+max(maxi-mini-1,0),{mini,maxi}};
    };
    pair<int,ii> res = max(calculate(solve(l+1,r,p),l),
                           calculate(solve(l,r-1,p),r));
    dp[l][r]=res.fst, ran[l][r]=res.snd;
    return res;
}

int only_check(vector<vector<int>> f) {
    vector<int> l(n,n), r(n,-1);
    forn(i,n) forn(j,n) {
        if(f[i][j]==0) {
            l[i]=min(l[i],j);
            r[i]=max(r[i],j);
        }
    }
    forn(i,n) forsn(j,l[i],r[i]+1) {
        if(f[i][j]==1) return -1;
    }
    forn(i,n) forn(j,n) {
        if(l[i]>l[j] && r[i]>r[j]) return -1;
    }
    
    vector<int> c(n);
    forn(i,n) c[i]=max(r[i]-l[i]+1,0);
    int maxi = int(max_element(ALL(c)) - c.begin());
    forsn(i,maxi,n-1) {
        if(c[i]<c[i+1]) return -1;
    }
    forn(i,maxi) {
        if(c[i]>c[i+1]) return -1;
    }
    int count=0;
    forn(i,n) forn(j,n) {
        count += f[i][j]==0;
    }
    return count;
}

int subtask1(vector<vector<int>> f) {
    ii pos={-1,-1};
    forn(i,n) forn(j,n) {
        if(f[i][j]==1) pos={i,j};
    }
    auto calculate = [](int i, int j) {
        return n*n-(i+1)*(j+1);
    };
    auto [i,j] = pos;
    return max({calculate(i,j),calculate(n-i-1,j),calculate(i,n-j-1),calculate(n-i-1,n-j-i)});
}

int biggest_stadium(int N, vector<vector<int>> F) {
    n=N;
    int count=0;
    forn(i,n) forn(j,n) {
        count += f[i][j]==1;
    }
    if(count==1) return subtask1(F);
    if(n>500) return only_check(F);
    forn(i,n) forn(j,n) {
        f[i][j]=F[i][j];
    }
    forn(i,n) {
        int k=-1;
        forn(j,n) {
            if(f[i][j]==1) k=j;
            L[i][j]=k;
        }
    }
    forn(i,n) {
        int k=n;
        dforn(j,n) {
            if(f[i][j]==1) k=j;
            R[i][j]=k;
        }
    }
    int ans=0;
    forn(i,n) {
        memset(dp,-1,sizeof dp);
        ans=max(ans,solve(0,n-1,i).fst);
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 5072 KB ok
5 Correct 1 ms 4956 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 15 ms 5468 KB ok
8 Correct 1092 ms 8352 KB ok
9 Runtime error 279 ms 64284 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 2 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 1 ms 4952 KB ok
9 Correct 2 ms 4952 KB ok
10 Correct 2 ms 4956 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 1 ms 4956 KB ok
13 Correct 1 ms 4956 KB ok

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 1 ms 4956 KB ok
9 Correct 1 ms 4952 KB ok
10 Correct 2 ms 4952 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 2 ms 4956 KB ok
13 Correct 1 ms 4956 KB ok
14 Correct 1 ms 4956 KB ok
15 Correct 1 ms 4952 KB ok
16 Correct 1 ms 4956 KB ok
17 Correct 2 ms 4956 KB ok
18 Correct 2 ms 4956 KB ok
19 Correct 1 ms 4956 KB ok
20 Correct 1 ms 4956 KB ok
21 Correct 1 ms 4956 KB ok
22 Correct 1 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 1 ms 5072 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4952 KB ok
12 Correct 2 ms 4952 KB ok
13 Correct 2 ms 4956 KB ok
14 Correct 2 ms 4956 KB ok
15 Correct 1 ms 4956 KB ok
16 Correct 1 ms 4956 KB ok
17 Correct 1 ms 4952 KB ok
18 Correct 1 ms 4956 KB ok
19 Correct 2 ms 4956 KB ok
20 Correct 2 ms 4956 KB ok
21 Correct 1 ms 4956 KB ok
22 Correct 1 ms 4956 KB ok
23 Correct 1 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok
27 Correct 2 ms 4956 KB ok
28 Correct 1 ms 4956 KB ok
29 Correct 2 ms 4956 KB ok
30 Correct 3 ms 5212 KB ok
31 Correct 3 ms 5212 KB ok
32 Correct 2 ms 5212 KB ok
33 Correct 3 ms 5212 KB ok
34 Correct 2 ms 5212 KB ok
35 Correct 3 ms 5212 KB ok
36 Correct 2 ms 5220 KB ok
37 Correct 2 ms 5212 KB ok
38 Correct 2 ms 5212 KB ok
39 Correct 2 ms 5212 KB ok
40 Correct 2 ms 5224 KB ok
41 Correct 2 ms 5224 KB ok

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 1 ms 5072 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4952 KB ok
12 Correct 2 ms 4952 KB ok
13 Correct 2 ms 4956 KB ok
14 Correct 2 ms 4956 KB ok
15 Correct 1 ms 4956 KB ok
16 Correct 1 ms 4956 KB ok
17 Correct 1 ms 4952 KB ok
18 Correct 1 ms 4956 KB ok
19 Correct 2 ms 4956 KB ok
20 Correct 2 ms 4956 KB ok
21 Correct 1 ms 4956 KB ok
22 Correct 1 ms 4956 KB ok
23 Correct 1 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok
27 Correct 2 ms 4956 KB ok
28 Correct 1 ms 4956 KB ok
29 Correct 2 ms 4956 KB ok
30 Correct 3 ms 5212 KB ok
31 Correct 3 ms 5212 KB ok
32 Correct 2 ms 5212 KB ok
33 Correct 3 ms 5212 KB ok
34 Correct 2 ms 5212 KB ok
35 Correct 3 ms 5212 KB ok
36 Correct 2 ms 5220 KB ok
37 Correct 2 ms 5212 KB ok
38 Correct 2 ms 5212 KB ok
39 Correct 2 ms 5212 KB ok
40 Correct 2 ms 5224 KB ok
41 Correct 2 ms 5224 KB ok
42 Correct 1507 ms 8360 KB ok
43 Correct 1512 ms 8352 KB ok
44 Correct 1137 ms 8352 KB ok
45 Correct 1506 ms 8348 KB ok
46 Correct 1162 ms 8352 KB ok
47 Correct 1105 ms 8348 KB ok
48 Correct 1136 ms 8348 KB ok
49 Correct 1107 ms 8344 KB ok
50 Correct 1163 ms 8352 KB ok
51 Correct 1129 ms 8348 KB ok
52 Correct 1507 ms 8356 KB ok
53 Correct 1179 ms 8348 KB ok
54 Correct 1128 ms 8348 KB ok
55 Correct 1471 ms 8348 KB ok
56 Correct 1468 ms 8356 KB ok
57 Correct 1465 ms 8348 KB ok
58 Correct 1466 ms 8284 KB ok
59 Correct 1469 ms 8528 KB ok

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB ok
2 Correct 1 ms 4956 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 1 ms 5072 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 15 ms 5468 KB ok
9 Correct 1092 ms 8352 KB ok
10 Runtime error 279 ms 64284 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -