oj.uz

Submission #915923

# Submission time Handle Problem Language Result Execution time Memory
915923 2024-01-24T22:27:58 Z biank Soccer Stadium (IOI23_soccer) C++17
65.5 / 100
 1489 ms 55824 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;
    }
    
    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 biggest_stadium(int N, vector<vector<int>> F) {
    n=N;
    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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok

Subtask #1
1.5 / 6.0

# Verdict Execution time Memory 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 2 ms 4952 KB ok
5 Correct 1 ms 4952 KB ok
6 Correct 2 ms 4952 KB ok
7 Correct 12 ms 5468 KB ok
8 Correct 1095 ms 8348 KB ok
9 Partially correct 264 ms 47400 KB partial

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory 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 4952 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 1 ms 4956 KB ok
9 Correct 1 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4956 KB ok
12 Correct 2 ms 4952 KB ok
13 Correct 1 ms 4952 KB ok

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4952 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 1 ms 4956 KB ok
6 Correct 1 ms 4952 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 1 ms 4956 KB ok
9 Correct 1 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4956 KB ok
12 Correct 1 ms 4956 KB ok
13 Correct 2 ms 4952 KB ok
14 Correct 1 ms 4952 KB ok
15 Correct 2 ms 5208 KB ok
16 Correct 2 ms 4956 KB ok
17 Correct 1 ms 4956 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 2 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 1 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4952 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 2 ms 4952 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 1 ms 4952 KB ok
9 Correct 1 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4956 KB ok
12 Correct 1 ms 4956 KB ok
13 Correct 1 ms 4956 KB ok
14 Correct 1 ms 4956 KB ok
15 Correct 2 ms 4952 KB ok
16 Correct 1 ms 4952 KB ok
17 Correct 2 ms 5208 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 2 ms 4956 KB ok
22 Correct 2 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 1 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok
27 Correct 1 ms 4956 KB ok
28 Correct 1 ms 4956 KB ok
29 Correct 1 ms 4956 KB ok
30 Correct 2 ms 5212 KB ok
31 Correct 2 ms 5212 KB ok
32 Correct 2 ms 5212 KB ok
33 Correct 2 ms 5212 KB ok
34 Correct 2 ms 5212 KB ok
35 Correct 2 ms 5208 KB ok
36 Correct 2 ms 5212 KB ok
37 Correct 3 ms 5212 KB ok
38 Correct 2 ms 5212 KB ok
39 Correct 2 ms 5212 KB ok
40 Correct 2 ms 5212 KB ok
41 Correct 2 ms 5212 KB ok

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4952 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 2 ms 4952 KB ok
6 Correct 1 ms 4956 KB ok
7 Correct 1 ms 4956 KB ok
8 Correct 1 ms 4952 KB ok
9 Correct 1 ms 4956 KB ok
10 Correct 1 ms 4956 KB ok
11 Correct 1 ms 4956 KB ok
12 Correct 1 ms 4956 KB ok
13 Correct 1 ms 4956 KB ok
14 Correct 1 ms 4956 KB ok
15 Correct 2 ms 4952 KB ok
16 Correct 1 ms 4952 KB ok
17 Correct 2 ms 5208 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 2 ms 4956 KB ok
22 Correct 2 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 1 ms 4956 KB ok
26 Correct 1 ms 4956 KB ok
27 Correct 1 ms 4956 KB ok
28 Correct 1 ms 4956 KB ok
29 Correct 1 ms 4956 KB ok
30 Correct 2 ms 5212 KB ok
31 Correct 2 ms 5212 KB ok
32 Correct 2 ms 5212 KB ok
33 Correct 2 ms 5212 KB ok
34 Correct 2 ms 5212 KB ok
35 Correct 2 ms 5208 KB ok
36 Correct 2 ms 5212 KB ok
37 Correct 3 ms 5212 KB ok
38 Correct 2 ms 5212 KB ok
39 Correct 2 ms 5212 KB ok
40 Correct 2 ms 5212 KB ok
41 Correct 2 ms 5212 KB ok
42 Correct 1182 ms 8348 KB ok
43 Correct 1489 ms 8348 KB ok
44 Correct 1476 ms 8344 KB ok
45 Correct 1460 ms 8344 KB ok
46 Correct 1116 ms 8344 KB ok
47 Correct 1460 ms 8344 KB ok
48 Correct 1080 ms 8348 KB ok
49 Correct 1096 ms 8344 KB ok
50 Correct 1121 ms 8344 KB ok
51 Correct 1472 ms 8348 KB ok
52 Correct 1473 ms 8348 KB ok
53 Correct 1117 ms 8348 KB ok
54 Correct 1124 ms 8344 KB ok
55 Correct 1470 ms 8348 KB ok
56 Correct 1068 ms 8532 KB ok
57 Correct 1079 ms 8348 KB ok
58 Correct 1101 ms 8284 KB ok
59 Correct 1461 ms 8532 KB ok

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB ok
2 Correct 1 ms 4952 KB ok
3 Correct 1 ms 4956 KB ok
4 Correct 1 ms 4956 KB ok
5 Correct 2 ms 4952 KB ok
6 Correct 1 ms 4952 KB ok
7 Correct 2 ms 4952 KB ok
8 Correct 12 ms 5468 KB ok
9 Correct 1095 ms 8348 KB ok
10 Partially correct 264 ms 47400 KB partial
11 Correct 1 ms 4956 KB ok
12 Correct 1 ms 4956 KB ok
13 Correct 1 ms 4952 KB ok
14 Correct 1 ms 4956 KB ok
15 Correct 1 ms 4956 KB ok
16 Correct 1 ms 4956 KB ok
17 Correct 1 ms 4956 KB ok
18 Correct 1 ms 4956 KB ok
19 Correct 1 ms 4956 KB ok
20 Correct 2 ms 4952 KB ok
21 Correct 1 ms 4952 KB ok
22 Correct 2 ms 5208 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 1 ms 4956 KB ok
25 Correct 1 ms 4956 KB ok
26 Correct 2 ms 4956 KB ok
27 Correct 2 ms 4956 KB ok
28 Correct 2 ms 4956 KB ok
29 Correct 1 ms 4956 KB ok
30 Correct 1 ms 4956 KB ok
31 Correct 1 ms 4956 KB ok
32 Correct 1 ms 4956 KB ok
33 Correct 1 ms 4956 KB ok
34 Correct 1 ms 4956 KB ok
35 Correct 2 ms 5212 KB ok
36 Correct 2 ms 5212 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 5208 KB ok
41 Correct 2 ms 5212 KB ok
42 Correct 3 ms 5212 KB ok
43 Correct 2 ms 5212 KB ok
44 Correct 2 ms 5212 KB ok
45 Correct 2 ms 5212 KB ok
46 Correct 2 ms 5212 KB ok
47 Correct 1182 ms 8348 KB ok
48 Correct 1489 ms 8348 KB ok
49 Correct 1476 ms 8344 KB ok
50 Correct 1460 ms 8344 KB ok
51 Correct 1116 ms 8344 KB ok
52 Correct 1460 ms 8344 KB ok
53 Correct 1080 ms 8348 KB ok
54 Correct 1096 ms 8344 KB ok
55 Correct 1121 ms 8344 KB ok
56 Correct 1472 ms 8348 KB ok
57 Correct 1473 ms 8348 KB ok
58 Correct 1117 ms 8348 KB ok
59 Correct 1124 ms 8344 KB ok
60 Correct 1470 ms 8348 KB ok
61 Correct 1068 ms 8532 KB ok
62 Correct 1079 ms 8348 KB ok
63 Correct 1101 ms 8284 KB ok
64 Correct 1461 ms 8532 KB ok
65 Partially correct 276 ms 47448 KB partial
66 Partially correct 276 ms 47444 KB partial
67 Partially correct 277 ms 47388 KB partial
68 Partially correct 264 ms 47388 KB partial
69 Partially correct 264 ms 47444 KB partial
70 Partially correct 266 ms 47412 KB partial
71 Partially correct 273 ms 47440 KB partial
72 Partially correct 270 ms 47384 KB partial
73 Correct 277 ms 47384 KB ok
74 Correct 273 ms 55324 KB ok
75 Partially correct 272 ms 55376 KB partial
76 Partially correct 270 ms 55448 KB partial
77 Partially correct 267 ms 55376 KB partial
78 Partially correct 286 ms 55456 KB partial
79 Partially correct 265 ms 55376 KB partial
80 Partially correct 285 ms 55824 KB partial
81 Partially correct 265 ms 55448 KB partial
82 Partially correct 260 ms 55380 KB partial
83 Partially correct 278 ms 55460 KB partial
84 Incorrect 267 ms 55320 KB wrong
85 Halted 0 ms 0 KB -