oj.uz

답안 #369170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369170 2021-02-20T16:00:59 Z wiwiho Collecting Stamps 3 (JOI20_ho_t3) C++14
100 / 100
 263 ms 130412 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 1LL << 60;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int n;
ll L;
vector<ll> x;

ll dis(int a, int b){
    if(a > b) swap(a, b);
    return min(x[b] - x[a], L - x[b] + x[a]);
}

int main(){
    StarBurstStream

    cin >> n >> L;
    x.resize(n + 1);
    for(int i = 1; i <= n; i++) cin >> x[i];
    vector<ll> t(n + 1);
    for(int i = 1; i <= n; i++) cin >> t[i];

    vector<vector<vector<ll>>> dpl(n + 1, vector<vector<ll>>(n + 1, vector<ll>(n + 1, MAX)));
    vector<vector<vector<ll>>> dpr(n + 1, vector<vector<ll>>(n + 1, vector<ll>(n + 1, MAX)));
    dpl[0][0][0] = 0;
    dpr[0][0][0] = 0;

    for(int len = 1; len <= n; len++){
        for(int l = 0; l <= n; l++){
            int r = (l + len) % (n + 1);
            if(l < r && l != 0) continue;

            int tl = (l + 1) % (n + 1);
            int tr = (r - 1 + n + 1) % (n + 1);
//            cerr << l << " "<< r << " " << tl << " " << tr << "\n";

            for(int k = 0; k <= n; k++){
                if(k && dpl[tl][r][k - 1] + dis(tl, l) <= t[l]) dpl[l][r][k] = min(dpl[l][r][k], dpl[tl][r][k - 1] + dis(tl, l));
                if(k && dpr[tl][r][k - 1] + dis(r, l) <= t[l]) dpl[l][r][k] = min(dpl[l][r][k], dpr[tl][r][k - 1] + dis(r, l));
                dpl[l][r][k] = min({dpl[l][r][k], dpl[tl][r][k] + dis(tl, l), dpr[tl][r][k] + dis(r, l)});

                if(k && dpl[l][tr][k - 1] + dis(l, r) <= t[r]) dpr[l][r][k] = min(dpr[l][r][k], dpl[l][tr][k - 1] + dis(l, r));
                if(k && dpr[l][tr][k - 1] + dis(tr, r) <= t[r]) dpr[l][r][k] = min(dpr[l][r][k], dpr[l][tr][k - 1] + dis(tr, r));
                dpr[l][r][k] = min({dpr[l][r][k], dpl[l][tr][k] + dis(l, r), dpr[l][tr][k] + dis(tr, r)});
            }
        }
    }

//    for(int i = 0; i <= n; i++){
//        for(int j = 0; j <= n; j++){
//            cerr << i << " " << j << "\n";
//            printv(dpl[i][j], cerr);
//            printv(dpr[i][j], cerr);
//        }
//    }

    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            for(int k = 0; k <= n; k++){
                if(dpl[j][k][i] < MAX || dpr[j][k][i] < MAX) ans = i;
            }
        }
    }
    cout << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 159 ms 94444 KB Output is correct
19 Correct 71 ms 45036 KB Output is correct
20 Correct 26 ms 17900 KB Output is correct
21 Correct 66 ms 41324 KB Output is correct
22 Correct 94 ms 60524 KB Output is correct
23 Correct 24 ms 14060 KB Output is correct
24 Correct 16 ms 9708 KB Output is correct
25 Correct 22 ms 13548 KB Output is correct
26 Correct 5 ms 3436 KB Output is correct
27 Correct 27 ms 14444 KB Output is correct
28 Correct 13 ms 8940 KB Output is correct
29 Correct 23 ms 14956 KB Output is correct
30 Correct 16 ms 10496 KB Output is correct
31 Correct 21 ms 13548 KB Output is correct
32 Correct 7 ms 5356 KB Output is correct
33 Correct 21 ms 13548 KB Output is correct
34 Correct 5 ms 3180 KB Output is correct
35 Correct 20 ms 13292 KB Output is correct
36 Correct 6 ms 4716 KB Output is correct
37 Correct 21 ms 14444 KB Output is correct
38 Correct 9 ms 6124 KB Output is correct
39 Correct 26 ms 15340 KB Output is correct
40 Correct 11 ms 7148 KB Output is correct
41 Correct 237 ms 129004 KB Output is correct
42 Correct 120 ms 71660 KB Output is correct
43 Correct 229 ms 129132 KB Output is correct
44 Correct 124 ms 69996 KB Output is correct
45 Correct 229 ms 129132 KB Output is correct
46 Correct 117 ms 71788 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 159 ms 94444 KB Output is correct
37 Correct 71 ms 45036 KB Output is correct
38 Correct 26 ms 17900 KB Output is correct
39 Correct 66 ms 41324 KB Output is correct
40 Correct 94 ms 60524 KB Output is correct
41 Correct 24 ms 14060 KB Output is correct
42 Correct 16 ms 9708 KB Output is correct
43 Correct 22 ms 13548 KB Output is correct
44 Correct 5 ms 3436 KB Output is correct
45 Correct 27 ms 14444 KB Output is correct
46 Correct 13 ms 8940 KB Output is correct
47 Correct 23 ms 14956 KB Output is correct
48 Correct 16 ms 10496 KB Output is correct
49 Correct 21 ms 13548 KB Output is correct
50 Correct 7 ms 5356 KB Output is correct
51 Correct 21 ms 13548 KB Output is correct
52 Correct 5 ms 3180 KB Output is correct
53 Correct 20 ms 13292 KB Output is correct
54 Correct 6 ms 4716 KB Output is correct
55 Correct 21 ms 14444 KB Output is correct
56 Correct 9 ms 6124 KB Output is correct
57 Correct 26 ms 15340 KB Output is correct
58 Correct 11 ms 7148 KB Output is correct
59 Correct 237 ms 129004 KB Output is correct
60 Correct 120 ms 71660 KB Output is correct
61 Correct 229 ms 129132 KB Output is correct
62 Correct 124 ms 69996 KB Output is correct
63 Correct 229 ms 129132 KB Output is correct
64 Correct 117 ms 71788 KB Output is correct
65 Correct 190 ms 110956 KB Output is correct
66 Correct 168 ms 97644 KB Output is correct
67 Correct 150 ms 91372 KB Output is correct
68 Correct 132 ms 80748 KB Output is correct
69 Correct 186 ms 108524 KB Output is correct
70 Correct 189 ms 101868 KB Output is correct
71 Correct 178 ms 104044 KB Output is correct
72 Correct 194 ms 105324 KB Output is correct
73 Correct 169 ms 94444 KB Output is correct
74 Correct 152 ms 85484 KB Output is correct
75 Correct 172 ms 98796 KB Output is correct
76 Correct 226 ms 121580 KB Output is correct
77 Correct 220 ms 121580 KB Output is correct
78 Correct 142 ms 82668 KB Output is correct
79 Correct 144 ms 86380 KB Output is correct
80 Correct 211 ms 117972 KB Output is correct
81 Correct 145 ms 88428 KB Output is correct
82 Correct 161 ms 95564 KB Output is correct
83 Correct 239 ms 129004 KB Output is correct
84 Correct 177 ms 101868 KB Output is correct
85 Correct 215 ms 115692 KB Output is correct
86 Correct 198 ms 111980 KB Output is correct
87 Correct 164 ms 98668 KB Output is correct
88 Correct 237 ms 130284 KB Output is correct
89 Correct 241 ms 130284 KB Output is correct
90 Correct 187 ms 100972 KB Output is correct
91 Correct 239 ms 130412 KB Output is correct
92 Correct 247 ms 130284 KB Output is correct
93 Correct 263 ms 126700 KB Output is correct