oj.uz

답안 #750759

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



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

}
long long find_ans(int a, int b, int c, int d){
    if(c < 0)
        return inf;
    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));
            long long 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]);
            long long 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));
            long long 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]);
            long long 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);
        }

    }

    return dp[a][b][c][d];



}

int main(){
  //  while(1){
    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);
            }

    cout << ans - 1 << endl;

}

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 22260 KB Output is correct
2 Correct 10 ms 22300 KB Output is correct
3 Correct 9 ms 22228 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 10 ms 22296 KB Output is correct
6 Correct 13 ms 22292 KB Output is correct
7 Correct 10 ms 22228 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22300 KB Output is correct
10 Correct 10 ms 22296 KB Output is correct
11 Correct 11 ms 22284 KB Output is correct
12 Correct 10 ms 22228 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22300 KB Output is correct
15 Correct 10 ms 22300 KB Output is correct
16 Incorrect 10 ms 22296 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 22260 KB Output is correct
2 Correct 10 ms 22300 KB Output is correct
3 Correct 9 ms 22228 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 10 ms 22296 KB Output is correct
6 Correct 13 ms 22292 KB Output is correct
7 Correct 10 ms 22228 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22300 KB Output is correct
10 Correct 10 ms 22296 KB Output is correct
11 Correct 11 ms 22284 KB Output is correct
12 Correct 10 ms 22228 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22300 KB Output is correct
15 Correct 10 ms 22300 KB Output is correct
16 Incorrect 10 ms 22296 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 22260 KB Output is correct
2 Correct 10 ms 22300 KB Output is correct
3 Correct 9 ms 22228 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 10 ms 22296 KB Output is correct
6 Correct 13 ms 22292 KB Output is correct
7 Correct 10 ms 22228 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22300 KB Output is correct
10 Correct 10 ms 22296 KB Output is correct
11 Correct 11 ms 22284 KB Output is correct
12 Correct 10 ms 22228 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22300 KB Output is correct
15 Correct 10 ms 22300 KB Output is correct
16 Incorrect 10 ms 22296 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 22260 KB Output is correct
2 Correct 10 ms 22300 KB Output is correct
3 Correct 9 ms 22228 KB Output is correct
4 Correct 9 ms 22228 KB Output is correct
5 Correct 10 ms 22296 KB Output is correct
6 Correct 13 ms 22292 KB Output is correct
7 Correct 10 ms 22228 KB Output is correct
8 Correct 10 ms 22228 KB Output is correct
9 Correct 10 ms 22300 KB Output is correct
10 Correct 10 ms 22296 KB Output is correct
11 Correct 11 ms 22284 KB Output is correct
12 Correct 10 ms 22228 KB Output is correct
13 Correct 10 ms 22228 KB Output is correct
14 Correct 10 ms 22300 KB Output is correct
15 Correct 10 ms 22300 KB Output is correct
16 Incorrect 10 ms 22296 KB Output isn't correct
17 Halted 0 ms 0 KB -