제출 #1082080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082080		ArthuroWich	축구 경기장 (IOI23_soccer)	C++17	1.50 / 100	200 ms	32540 KiB

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int n, ans = 0;
vector<vector<pair<int, int>>> segs;
map<tuple<int, int, int>, int> dp1, dp2; 
int solveup(int i, int l, int r) {
    if (dp1.find({i, l, r}) != dp1.end()) {
        return dp1[{i, l, r}];
    }
    if (i == 0) {
        return r-l+1;
    }
    int v = 0;
    for (auto [x, y] : segs[i-1]) {
        if (max(l, x) >= min(r, y)) {
            continue;
        }
        v = max(v, solveup(i-1, max(l, x), min(r, y)));
    }
    dp1[{i, l, r}] = v+(r-l+1);
    return v+(r-l+1);
}
int solvedown(int i, int l, int r) {
    if (dp2.find({i, l, r}) != dp2.end()) {
        return dp2[{i, l, r}];
    }
    if (i == n-1) {
        return r-l+1;
    }
    int v = 0;
    for (auto [x, y] : segs[i+1]) {
        if (max(l, x) >= min(r, y)) {
            continue;
        }
        v = max(v, solvedown(i+1, max(l, x), min(r, y)));
    }
    dp2[{i, l, r}] = v+(r-l+1);
    return v+(r-l+1);
}
int biggest_stadium(int N, vector<vector<int>> f) {
    n = N;
    segs.resize(n);
    for (int i = 0; i < n; i++) {
        int l = -1, r = -1;
        for (int j = 0; j < n; j++) {
            if (f[i][j] == 0) {
                if (l == -1) {
                    l = j;
                }
                r = j;
            } else {
                if (l != -1) {
                    segs[i].push_back({l, r});
                }
                l = -1;
            }
        }
        if (l != -1) {
            segs[i].push_back({l, r});
        }
    }
    for (int i = 0; i < n; i++) {
        for (auto [x, y] : segs[i]) {
            ans = max(ans, solveup(i, x, y)+solvedown(i, x, y)-(y-x+1));
        }
    }
    return ans;
}

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