oj.uz

답안 #750700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750700 2023-05-30T07:27:49 Z Sami_Massah Collecting Stamps 3 (JOI20_ho_t3) C++17
0 / 100
 7 ms 11304 KB 
#include <bits/stdc++.h>
using namespace std;



const int maxn = 100 + 12, inf = 1e9 + 12;
int n, L, dist[maxn], t[maxn], dp[maxn][maxn][maxn][2];
int get_dist(int a, int b){
    if(a == n - 1 && b == 0)
        return L - dist[a];
    return abs(dist[a] - dist[b]);

}
int find_ans(int a, int b, int c, int d){
    if(c < 0)
        return -1;
    if(dp[a][b][c][d] != -1)
        return dp[a][b][c][d];
    dp[a][b][c][d] = inf;
    //cout << a << ' ' << b << ' ' << c << ' ' << d << endl;
    if(d == 0){
        if(a != 0){
            dp[a][b][c][d] = min(dp[a][b][c][d], find_ans((a + 1) % n, b, c, d) + get_dist(a, a + 1));
            int x = find_ans((a + 1) % n, b, c - 1, d) + get_dist(a, a + 1);
            if(x <= t[a])
                dp[a][b][c][d] = min(dp[a][b][c][d], x);
        }
        if(a != 0){
            dp[a][b][c][d] = min(dp[a][b][c][d], find_ans((a + 1) % n, b, c, d ^ 1) + L - dist[a] + dist[b]);
            int x = find_ans((a + 1) % n, b, c - 1, d ^ 1) + L - dist[a] + dist[b];
            if(x <= t[a])
                dp[a][b][c][d] = min(dp[a][b][c][d], x);
        }
    }
    if(d == 1){
        if(b != 0){
            dp[a][b][c][d] = min(dp[a][b][c][d], find_ans(a, b - 1, c, d) + get_dist(b, b - 1));
            int x = find_ans(a, b - 1, c - 1, d) + get_dist(b, b - 1);
            if(x <= t[b])
                dp[a][b][c][d] = min(dp[a][b][c][d], x);
        }
        if(b != 0){
            dp[a][b][c][d] = min(dp[a][b][c][d], find_ans(a, b - 1, c, d ^ 1) + L - dist[a] + dist[b]);
            int x = find_ans(a, b - 1, c - 1, d ^ 1) + L - dist[a] + dist[b];
            if(x <= t[b])
                dp[a][b][c][d] = min(dp[a][b][c][d], x);
        }

    }
   // if(dp[a][b][c][d] != inf)
     //   cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << dp[a][b][c][d] << endl;
    return dp[a][b][c][d];



}

int main(){
    memset(dp, -1, sizeof dp);
    cin >> n >> L;
    for(int i = 1; i <= n; i++)
        cin >> dist[i];
    for(int i = 1; i <= n; i++)
        cin >> t[i];
    t[0] = 0;
    dist[0] = 0;
    n += 1;
    dp[0][0][0][0] = 0;
    dp[0][0][1][0] = 0;
    dp[0][0][0][1] = 0;
    dp[0][0][1][1] = 0;
    int ans = 0;

    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= n; j++)
            for(int c = 0; c <= n; c++)
                for(int d = 0; d < 2; d++){
                    find_ans(i, j, c, d);
                    if(dp[i][j][c][d] != inf)
                        ans = max(ans, c);
            }
        /*
    for(int j = 0; j <= n; j++)
        for(int c = 0; c <= n; c++)
            for(int d = 0; d < 2; d++){
                find_ans(0, j, c, d);
                if(dp[0][j][c][d] != inf)
                    ans = max(ans, c);
            }*/
    cout << ans - 1 << endl;

}

Compilation message

ho_t3.cpp: In function 'int _Z8find_ansiiii.part.0(int, int, int, int)':
ho_t3.cpp:10:26: warning: array subscript -1 is below array bounds of 'int [112]' [-Warray-bounds]
   10 |         return L - dist[a];
      |                    ~~~~~~^
ho_t3.cpp:7:11: note: while referencing 'dist'
    7 | int n, L, dist[maxn], t[maxn], dp[maxn][maxn][maxn][2];
      |           ^~~~
ho_t3.cpp:10:26: warning: array subscript -1 is below array bounds of 'int [112]' [-Warray-bounds]
   10 |         return L - dist[a];
      |                    ~~~~~~^
ho_t3.cpp:7:11: note: while referencing 'dist'
    7 | int n, L, dist[maxn], t[maxn], dp[maxn][maxn][maxn][2];
      |           ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 7 ms 11296 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11296 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11304 KB Output is correct
7 Incorrect 5 ms 11220 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 7 ms 11296 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11296 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11304 KB Output is correct
7 Incorrect 5 ms 11220 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 7 ms 11296 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11296 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11304 KB Output is correct
7 Incorrect 5 ms 11220 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 7 ms 11296 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11296 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11304 KB Output is correct
7 Incorrect 5 ms 11220 KB Output isn't correct
8 Halted 0 ms 0 KB -