제출 #750700

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
750700	2023-05-30 07:27:49	Sami_Massah	Collecting Stamps 3 (JOI20_ho_t3)	C++17	0 / 100	7 ms	11304 KiB

ho_t3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75