Submission #1244344

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244344		cpdreamer	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	4590 ms	6212 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long INF = 1e18+1;
typedef long long ll;
const ll MOD =  1e9+7;
#define P pair
#define S second
#define pb push_back
#define all(v) v.begin(), v.end()
#define V vector
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;

int dpd[2][500][500];
int dpi[2][500][500];
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    int n=N;
    for (int i=0;i<2;i++) {
        for (int j=0;j<n;j++) {
            for (int g=0;g<n;g++) {
                dpd[i][j][g]=-1e8;
                dpi[i][j][g]=-1e8;
            }
        }
    }
    for (int i=0;i<n;i++) {
        for (int j=i;j<n;j++) {
            if (F[i][j])break;
            dpd[0][i][j]=j-i+1;
            dpi[0][i][j]=j-i+1;
        }
    }
    for (int i=1;i<n;i++) {
        for (int l=0;l<n;l++) {
            for (int r=l;r<n;r++) {
                if (F[i][r])break;
                for (int a=l;a<=r;a++) {
                    for (int b=a;b<=r;b++) {
                        dpi[i%2][l][r]=max(dpi[i%2][l][r],dpi[1-i%2][a][b]+r-l+1);
                    }
                }
                for (int a=0;a<=l;a++) {
                    for (int b=r;b<n;b++) {
                        dpd[i%2][l][r]=max(dpd[i%2][l][r],max(dpd[1-i%2][a][b],dpi[1-i%2][a][b])+r-l+1);
                    }
                }
            }
        }
    }
    int ans=0;
    for (int i=0;i<n;i++) {
        for (int j=i;j<n;j++) {
            ans=max(ans,max(dpi[(n-1)%2][i][j],dpd[(n-1)%2][i][j]));
        }
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30