답안 #749227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
749227	2023-05-27T14:59:12 Z	Desh03	Collecting Stamps 3 (JOI20_ho_t3)	C++17	15 / 100	22 ms	2356 KB

ho_t3

#include <bits/stdc++.h>
using namespace std;

map<int, int> mp;
set<int> x;
multiset<int> y;
int l;
vector<vector<vector<vector<vector<int>>>>> dp;

int recurse(int cur, int t, bool q, bool w, bool s, int ll, int rr) {
    if (x.empty() || *--y.end() < t) return 0;
    if (dp[q][w][s][ll][rr] != -1) return dp[q][w][s][ll][rr];
    auto it = x.upper_bound(cur);
    bool k = 0;
    if (it == x.begin()) k = 1, it = --x.end();
    else --it;
    int p = *it;
    x.erase(p);
    y.erase(y.find(mp[p]));
    int cost = (k ? cur + l - p : cur - p);
    int g = (t + cost <= mp[p]) + recurse(p, t + cost, w, s, 0, ll + 1, rr);
    x.insert(p);
    y.insert(mp[p]);
    it = x.upper_bound(cur);
    k = 0;
    if (it == x.end()) k = 1, it = x.begin();
    p = *it;
    cost = (k ? l - cur + p : p - cur);
    x.erase(p);
    y.erase(y.find(mp[p]));
    g = max(g, (t + cost <= mp[p]) + recurse(p, t + cost, w, s, 1, ll, rr + 1));
    x.insert(p);
    y.insert(mp[p]);
    return dp[q][w][s][ll][rr] = g;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n >> l;
    for (int i = 0; i < n; i++) {
        int k;
        cin >> k;
        x.insert(k);
    }
    dp = vector (2, vector (2, vector (2, vector (n, vector<int> (n, -1)))));
    for (auto k : x) cin >> mp[k], y.insert(mp[k]);
    cout << recurse(0, 0, 0, 0, 0, 0, 0) << '\n';
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	320 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	320 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	320 KB	Output is correct

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	22 ms	2356 KB	Output is correct
19	Correct	11 ms	1472 KB	Output is correct
20	Incorrect	9 ms	980 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #4

0 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	320 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	320 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	320 KB	Output is correct
36	Correct	22 ms	2356 KB	Output is correct
37	Correct	11 ms	1472 KB	Output is correct
38	Incorrect	9 ms	980 KB	Output isn't correct
39	Halted	0 ms	0 KB	-