제출 #935449

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
935449	2024-02-29 06:03:04	weakweakweak	Collecting Stamps 3 (JOI20_ho_t3)	C++14	100 / 100	68 ms	145556 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;
#define ll long long
int n, l, a[210], t[210]; 
ll inf = 1e13;
ll dp[210][210][210][2]; //dp[l][r][k][w]代表逆時針走過l，順時針走過r，共拿過k個郵票，現在在哪個端點(w=0是左)，所需的最短時間
int walk (int st, int ed) {
    if (st == ed) return 0;
    if (st > ed) swap(st, ed);
    return min((a[st] + l - a[ed]), a[ed] - a[st]);
}
signed main () {
    ios_base::sync_with_stdio(false); cin.tie(0);
    memset(dp, 63, sizeof(dp));
    dp[0][0][0][0] = dp[0][0][0][1] = 0;
    cin >> n >> l;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> t[i];
    a[0] = 0, a[n + 1] = l, t[0] = t[n + 1] = -1;
    int ans = 0;
    for (int l = 0; l <= n; l++) {
        for (int r = 0; r <= n and l + r <= n; r++) {
            for (int k = 0; k <= n; k++) {
                if (min(dp[l][r][k][1], dp[l][r][k][0]) < inf) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75