oj.uz

답안 #991207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991207 2024-06-01T15:07:39 Z yoav_s Tortoise (CEOI21_tortoise) C++17
8 / 100
 97 ms 15396 KB 
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef vector<vvv> vvvv;
typedef pair<ll, ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define setmax(a, b) a = (a > b? a : b)

const ll INF = 1e18;
const ll mod = 1e9 + 7;

ll solve(ll N, v &a, ll firstPos, ll secondPos, ll lastEaten, ll state, map<pair<p,p>,ll> &dp, v &firstParkLeft, v &firstParkRight){
    if (firstPos >= 2 * N || lastEaten >= N) return 0;
    if (dp.count({{firstPos, secondPos},{lastEaten, state}}) > 0) return dp[{{firstPos, secondPos},{lastEaten, state}}];
    if (state == 0)
    {
        ll res = solve(N, a, firstPos, secondPos, lastEaten + 1, state, dp, firstParkLeft, firstParkRight);
        if (a[lastEaten] == 1)
        {
            ll distance = abs(secondPos - lastEaten);
            if ((firstPos + distance) / 2 <= lastEaten)
            {
                setmax(res, solve(N, a, firstPos + distance, lastEaten, lastEaten + 1, 1, dp, firstParkLeft, firstParkRight) + 1);
            }
        }
        dp[{{firstPos, secondPos},{lastEaten, state}}] = res;
        return res;
    }
    ll res = 0;
    if (firstParkLeft[secondPos] > -1)
    {
        ll distance = abs(secondPos - firstParkLeft[secondPos]);
        if (firstPos + distance < 2 * N)
            setmax(res, solve(N, a, firstPos + distance, firstParkLeft[secondPos], lastEaten,0, dp, firstParkLeft, firstParkRight));
    }
    if (firstParkRight[secondPos] < N)
    {
        ll distance = abs(secondPos - firstParkRight[secondPos]);
        if (firstPos + distance < 2 * N)
            setmax(res, solve(N, a, firstPos + distance, firstParkRight[secondPos], lastEaten,0, dp, firstParkLeft, firstParkRight));
    }
    dp[{{firstPos, secondPos},{lastEaten, state}}] = res;
    return res;
}


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll N;
    cin >> N;
    v a(N);
    for (ll i = 0; i < N; i++) cin >> a[i];
    v firstParkLeft(N, -1), firstParkRight(N, N);
    ll lastPark = -1;
    for (ll i = 0; i < N; i++)
    {
        if (a[i] == -1) lastPark = i;
        firstParkLeft[i] = lastPark;
    }
    lastPark = N;
    for (ll i = N - 1; i >= 0; i--)
    {
        if (a[i] == -1) lastPark = i;
        firstParkRight[i] = lastPark;
    }
    map<pair<p, p>, ll> dp;
    ll res = solve(N, a, 0, 0, 0, 0, dp, firstParkLeft, firstParkRight);
    ll sum = 0;
    for (auto x : a) if (x > 0) sum += x;
    cout << sum - res << "\n";
    return 0;
}

Compilation message

tortoise.cpp:29:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   29 | const ll INF = 1e18;
      |                ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 372 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 372 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 97 ms 15396 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 372 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 97 ms 15396 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 372 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 97 ms 15396 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 616 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 372 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 97 ms 15396 KB Output isn't correct
28 Halted 0 ms 0 KB -