oj.uz

Submission #1082084

# Submission time Handle Problem Language Result Execution time Memory
1082084 2024-08-30T16:55:45 Z ArthuroWich Soccer Stadium (IOI23_soccer) C++17
6 / 100
 196 ms 32596 KB 
#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 (r < x || y < l) {
            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 (r < x || y < l) {
            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 / 0.0

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 360 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 344 KB ok
8 Correct 17 ms 2456 KB ok
9 Correct 196 ms 32596 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Incorrect 1 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Incorrect 1 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 360 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 360 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 360 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 344 KB ok
9 Correct 17 ms 2456 KB ok
10 Correct 196 ms 32596 KB ok
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Incorrect 1 ms 348 KB wrong
14 Halted 0 ms 0 KB -