oj.uz

답안 #1115593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115593 2024-11-20T16:41:35 Z staszic_ojuz Collecting Stamps 3 (JOI20_ho_t3) C++17
15 / 100
 2000 ms 131708 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr ll INF = 1e13 + 7;
constexpr int MAXN = 211;
ll dp[MAXN][MAXN][MAXN][2];

int main()
{
    int n, p;
    cin >> n >> p;
    vector<int> r;
    vector<int> l;
    vector<int> t;
    r.push_back(0);
    r.push_back(0);
    l.push_back(0);
    l.push_back(0);
    t.push_back(0);
    for(int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        r.push_back(a);
    }
    for(int i = n+1; i >= 2; --i)
        l.push_back(p-r[i]);
    for(int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        t.push_back(a);
    }
    t.push_back(0);
    for(int i = 0; i <= n+1; ++i)
    {
        for(int j = 0; j <= n+1; ++j)
        {
            for(int k = 0; k <= n; ++k)
            {
                dp[i][j][k][0] = INF;
                dp[i][j][k][1] = INF;
            }
        }
    }
    dp[1][1][0][0] = 0;
    dp[1][1][0][1] = 0;
    dp[0][1][0][0] = 0;
    dp[0][1][0][1] = 0;
    dp[1][0][0][0] = 0;
    dp[1][0][0][1] = 0;
    for(int i = 1; i <= n+1; ++i)
    {
        for(int j = 1; j <= n+1; ++j)
        {
            if(j+i > n+2)
                continue;
            for(int k = 0; k <= (i == 1 && j == 1 ? 0 : i+j-2); ++k)
            {
                if(k > 0)
                    dp[i][j][k][0] = min(dp[i-1][j][k-1][0] + l[i]-l[i-1], dp[i-1][j][k-1][1] + l[i]+r[j]);
                if(dp[i][j][k][0] > t[n-i+2])
                    dp[i][j][k][0] = min(dp[i-1][j][k][0] + l[i]-l[i-1], dp[i-1][j][k][1] + l[i]+r[j]);
                dp[i][j][k][0] = min(dp[i][j][k][0], INF);

                if(k > 0)
                    dp[i][j][k][1] = min(dp[i][j-1][k-1][1] + r[j]-r[j-1], dp[i][j-1][k-1][0] + l[i]+r[j]);
                if(dp[i][j][k][1] > t[j-1])
                    dp[i][j][k][1] = min(dp[i][j-1][k][1] + r[j]-r[j-1], dp[i][j-1][k][0] + l[i]+r[j]);
                dp[i][j][k][1] = min(dp[i][j][k][1], INF);

                cerr << i << " " << j << " " << k << ": " << dp[i][j][k][0] << " " << dp[i][j][k][1] << "\n";
            }
        }
    }
    int odp = 0;
    for(int i = 1; i <= n+1; ++i)
    {
        for(int j = 1; j <= n+1; ++j)
        {
            for(int k = 1; k <= n; ++k)
            {
                for(int zj = 0; zj < 2; ++zj)
                {   
                    if(dp[i][j][k][zj] < INF)
                        odp = max(odp, k);
                }
            }
        }
    }
    cout << odp;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 6 ms 8528 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 4 ms 6480 KB Output is correct
6 Correct 12 ms 10576 KB Output is correct
7 Correct 5 ms 6480 KB Output is correct
8 Correct 8 ms 8528 KB Output is correct
9 Correct 12 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 13 ms 10752 KB Output is correct
13 Correct 13 ms 10576 KB Output is correct
14 Correct 6 ms 6480 KB Output is correct
15 Correct 5 ms 6480 KB Output is correct
16 Correct 13 ms 10576 KB Output is correct
17 Correct 13 ms 10756 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 6 ms 8528 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 4 ms 6480 KB Output is correct
6 Correct 12 ms 10576 KB Output is correct
7 Correct 5 ms 6480 KB Output is correct
8 Correct 8 ms 8528 KB Output is correct
9 Correct 12 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 13 ms 10752 KB Output is correct
13 Correct 13 ms 10576 KB Output is correct
14 Correct 6 ms 6480 KB Output is correct
15 Correct 5 ms 6480 KB Output is correct
16 Correct 13 ms 10576 KB Output is correct
17 Correct 13 ms 10756 KB Output is correct
18 Correct 19 ms 12624 KB Output is correct
19 Correct 8 ms 8528 KB Output is correct
20 Correct 13 ms 10576 KB Output is correct
21 Correct 20 ms 12856 KB Output is correct
22 Correct 7 ms 8528 KB Output is correct
23 Correct 23 ms 12832 KB Output is correct
24 Correct 16 ms 10576 KB Output is correct
25 Correct 20 ms 12624 KB Output is correct
26 Correct 19 ms 12624 KB Output is correct
27 Correct 5 ms 6480 KB Output is correct
28 Correct 8 ms 8528 KB Output is correct
29 Correct 25 ms 12624 KB Output is correct
30 Correct 23 ms 12832 KB Output is correct
31 Correct 19 ms 12624 KB Output is correct
32 Correct 15 ms 10752 KB Output is correct
33 Correct 24 ms 12624 KB Output is correct
34 Correct 24 ms 12624 KB Output is correct
35 Correct 23 ms 12624 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 6 ms 8528 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 4 ms 6480 KB Output is correct
6 Correct 12 ms 10576 KB Output is correct
7 Correct 5 ms 6480 KB Output is correct
8 Correct 8 ms 8528 KB Output is correct
9 Correct 12 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 13 ms 10752 KB Output is correct
13 Correct 13 ms 10576 KB Output is correct
14 Correct 6 ms 6480 KB Output is correct
15 Correct 5 ms 6480 KB Output is correct
16 Correct 13 ms 10576 KB Output is correct
17 Correct 13 ms 10756 KB Output is correct
18 Execution timed out 2069 ms 131708 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 6 ms 8528 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 4 ms 6480 KB Output is correct
6 Correct 12 ms 10576 KB Output is correct
7 Correct 5 ms 6480 KB Output is correct
8 Correct 8 ms 8528 KB Output is correct
9 Correct 12 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 13 ms 10752 KB Output is correct
13 Correct 13 ms 10576 KB Output is correct
14 Correct 6 ms 6480 KB Output is correct
15 Correct 5 ms 6480 KB Output is correct
16 Correct 13 ms 10576 KB Output is correct
17 Correct 13 ms 10756 KB Output is correct
18 Correct 19 ms 12624 KB Output is correct
19 Correct 8 ms 8528 KB Output is correct
20 Correct 13 ms 10576 KB Output is correct
21 Correct 20 ms 12856 KB Output is correct
22 Correct 7 ms 8528 KB Output is correct
23 Correct 23 ms 12832 KB Output is correct
24 Correct 16 ms 10576 KB Output is correct
25 Correct 20 ms 12624 KB Output is correct
26 Correct 19 ms 12624 KB Output is correct
27 Correct 5 ms 6480 KB Output is correct
28 Correct 8 ms 8528 KB Output is correct
29 Correct 25 ms 12624 KB Output is correct
30 Correct 23 ms 12832 KB Output is correct
31 Correct 19 ms 12624 KB Output is correct
32 Correct 15 ms 10752 KB Output is correct
33 Correct 24 ms 12624 KB Output is correct
34 Correct 24 ms 12624 KB Output is correct
35 Correct 23 ms 12624 KB Output is correct
36 Execution timed out 2069 ms 131708 KB Time limit exceeded
37 Halted 0 ms 0 KB -