oj.uz

답안 #582319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
582319 2022-06-23T16:16:23 Z wiwiho Uplifting Excursion (BOI22_vault) C++14
50 / 100
 1175 ms 4820 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 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 = 2147483647;

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

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int M;
int S;
ll L;
vector<ll> dp;

void waassert(bool t){
    return;
    if(t) return;
    cout << "OAO\n";
    exit(0);
}

void upd_pos(int sz, ll cnt, int t){
    if(cnt == 0) return;
    waassert(sz > 0 && cnt > 0);
    vector<deque<pll>> dq(sz);
    for(int i = 0; i <= 2 * S; i++){
        int id = i % sz;
        ll tmp = dp[i] - i / sz * t;
        while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
        dq[id].eb(mp(i, tmp));
        while(!dq[id].empty() && dq[id].front().F / sz < i / sz - cnt) dq[id].pof;
        dp[i] = max(dp[i], dq[id].front().S + i / sz * t);
    }
    /*cerr << "upd_pos " << sz << " " << cnt << "\n";
    printv(dp, cerr);*/
}

void upd_neg(int sz, ll cnt, int t){
    if(cnt == 0) return;
    waassert(sz > 0 && cnt > 0);
    vector<deque<pll>> dq(sz);
    for(int i = 2 * S; i >= 0; i--){
        int id = i % sz;
        ll tmp = dp[i] + i / sz * t;
        while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
        dq[id].eb(mp(i, tmp));
        while(!dq[id].empty() && dq[id].front().F / sz > i / sz + cnt) dq[id].pof;
        dp[i] = max(dp[i], dq[id].front().S - i / sz * t);
    }
    /*cerr << "upd_neg " << sz << " " << cnt << "\n";
    printv(dp, cerr);*/
}

int main(){
    StarBurstStream

    cin >> M;
    cin >> L;
    
    ll sum = 0;
    vector<ll> _a(2 * M + 1), _b(2 * M + 1);
    function<ll&(int)> a = [&](int x) -> ll&{
        waassert(M + x >= 0 && M + x <= 2 * M);
        return _a[M + x];
    };
    function<ll&(int)> b = [&](int x) -> ll&{
        waassert(M + x >= 0 && M + x <= 2 * M);
        return _b[M + x];
    };
    for(int i = -M; i <= M; i++){
        cin >> a(i);
        sum += a(i) * i;
    }

    if(sum <= L){
        for(int i = -M; i < 0; i++){
            swap(a(i), a(-i));
        }
        L = -L;
    }

    int p = -M - 1;
    sum = 0;
    for(int i = -M; i <= M; i++){
        sum += a(i) * i;
        if(sum <= L) p = i;
    }
    sum = 0;
    ll total = 0;
    for(int i = -M; i <= p; i++){
        sum += a(i) * i;
        b(i) = a(i);
        total += b(i);
    }
    if(p < M){
        b(p + 1) = (L - sum) / (p + 1);
        sum += b(p + 1) * (p + 1);
        total += b(p + 1);
    }
    //total = a(0);

    /*cerr << "test " << sum << " " << L << " " << L - sum << "\n";
    printv(_a, cerr);
    printv(_b, cerr);*/

    S = max(M * M, 10000);;
    dp.resize(2 * S + 1, -(1LL << 60));
    dp[S] = 0;

    //printv(dp, cerr);
    for(int i = -M; i <= M; i++){
        if(i == 0) continue;
        if(i < 0){
            upd_pos(-i, b(i), -1);
            upd_neg(-i, a(i) - b(i), 1);
        }
        else{
            upd_pos(i, a(i) - b(i), 1);
            upd_neg(i, b(i), -1);
        }
    }

    ll ans = L - sum > S ? -(1LL << 60) : dp[S + L - sum];
    if(ans < -1e9) cout << "impossible\n";
    else cout << total + ans << "\n";

    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Incorrect 55 ms 528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Incorrect 55 ms 528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 15 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 15 ms 656 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 11 ms 468 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 15 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 15 ms 656 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 11 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 6 ms 468 KB Output is correct
15 Correct 15 ms 468 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 16 ms 596 KB Output is correct
18 Correct 16 ms 664 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 10 ms 596 KB Output is correct
23 Correct 11 ms 468 KB Output is correct
24 Correct 29 ms 508 KB Output is correct
25 Correct 12 ms 636 KB Output is correct
26 Correct 28 ms 636 KB Output is correct
27 Correct 28 ms 628 KB Output is correct
28 Correct 27 ms 640 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 15 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 15 ms 656 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 11 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 16 ms 556 KB Output is correct
13 Correct 5 ms 496 KB Output is correct
14 Correct 16 ms 596 KB Output is correct
15 Correct 15 ms 652 KB Output is correct
16 Correct 15 ms 596 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 11 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 24 ms 596 KB Output is correct
24 Correct 11 ms 596 KB Output is correct
25 Correct 25 ms 660 KB Output is correct
26 Correct 25 ms 628 KB Output is correct
27 Correct 23 ms 596 KB Output is correct
28 Correct 18 ms 596 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Incorrect 55 ms 528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 15 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 15 ms 656 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 11 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 16 ms 556 KB Output is correct
13 Correct 5 ms 496 KB Output is correct
14 Correct 16 ms 596 KB Output is correct
15 Correct 15 ms 652 KB Output is correct
16 Correct 15 ms 596 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 11 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 24 ms 596 KB Output is correct
24 Correct 11 ms 596 KB Output is correct
25 Correct 25 ms 660 KB Output is correct
26 Correct 25 ms 628 KB Output is correct
27 Correct 23 ms 596 KB Output is correct
28 Correct 18 ms 596 KB Output is correct
29 Correct 7 ms 468 KB Output is correct
30 Correct 16 ms 564 KB Output is correct
31 Correct 5 ms 524 KB Output is correct
32 Correct 16 ms 596 KB Output is correct
33 Correct 16 ms 596 KB Output is correct
34 Correct 16 ms 596 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 11 ms 596 KB Output is correct
38 Correct 10 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 24 ms 596 KB Output is correct
42 Correct 11 ms 596 KB Output is correct
43 Correct 24 ms 596 KB Output is correct
44 Correct 25 ms 596 KB Output is correct
45 Correct 25 ms 596 KB Output is correct
46 Correct 18 ms 556 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 42 ms 640 KB Output is correct
50 Correct 18 ms 556 KB Output is correct
51 Correct 46 ms 648 KB Output is correct
52 Correct 49 ms 656 KB Output is correct
53 Correct 48 ms 596 KB Output is correct
54 Correct 37 ms 604 KB Output is correct

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Incorrect 55 ms 528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 15 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 15 ms 656 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 11 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 16 ms 556 KB Output is correct
13 Correct 5 ms 496 KB Output is correct
14 Correct 16 ms 596 KB Output is correct
15 Correct 15 ms 652 KB Output is correct
16 Correct 15 ms 596 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 11 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 24 ms 596 KB Output is correct
24 Correct 11 ms 596 KB Output is correct
25 Correct 25 ms 660 KB Output is correct
26 Correct 25 ms 628 KB Output is correct
27 Correct 23 ms 596 KB Output is correct
28 Correct 18 ms 596 KB Output is correct
29 Correct 7 ms 468 KB Output is correct
30 Correct 16 ms 564 KB Output is correct
31 Correct 5 ms 524 KB Output is correct
32 Correct 16 ms 596 KB Output is correct
33 Correct 16 ms 596 KB Output is correct
34 Correct 16 ms 596 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 11 ms 596 KB Output is correct
38 Correct 10 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 24 ms 596 KB Output is correct
42 Correct 11 ms 596 KB Output is correct
43 Correct 24 ms 596 KB Output is correct
44 Correct 25 ms 596 KB Output is correct
45 Correct 25 ms 596 KB Output is correct
46 Correct 18 ms 556 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 42 ms 640 KB Output is correct
50 Correct 18 ms 556 KB Output is correct
51 Correct 46 ms 648 KB Output is correct
52 Correct 49 ms 656 KB Output is correct
53 Correct 48 ms 596 KB Output is correct
54 Correct 37 ms 604 KB Output is correct
55 Correct 5 ms 468 KB Output is correct
56 Correct 15 ms 468 KB Output is correct
57 Correct 6 ms 492 KB Output is correct
58 Correct 14 ms 596 KB Output is correct
59 Correct 15 ms 648 KB Output is correct
60 Correct 15 ms 596 KB Output is correct
61 Correct 2 ms 724 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 10 ms 596 KB Output is correct
64 Correct 11 ms 596 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 3 ms 468 KB Output is correct
67 Correct 23 ms 564 KB Output is correct
68 Correct 11 ms 596 KB Output is correct
69 Correct 22 ms 660 KB Output is correct
70 Correct 23 ms 628 KB Output is correct
71 Correct 22 ms 596 KB Output is correct
72 Correct 17 ms 556 KB Output is correct
73 Correct 2 ms 596 KB Output is correct
74 Correct 4 ms 596 KB Output is correct
75 Correct 44 ms 656 KB Output is correct
76 Correct 18 ms 468 KB Output is correct
77 Correct 43 ms 656 KB Output is correct
78 Correct 45 ms 644 KB Output is correct
79 Correct 42 ms 596 KB Output is correct
80 Correct 38 ms 584 KB Output is correct
81 Correct 1128 ms 3332 KB Output is correct
82 Correct 515 ms 2260 KB Output is correct
83 Correct 1147 ms 3280 KB Output is correct
84 Correct 1175 ms 3276 KB Output is correct
85 Correct 14 ms 4820 KB Output is correct
86 Correct 26 ms 4056 KB Output is correct
87 Correct 976 ms 3076 KB Output is correct

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 6 ms 468 KB Output is correct
5 Incorrect 55 ms 528 KB Output isn't correct
6 Halted 0 ms 0 KB -