oj.uz

Submission #109596

# Submission time Handle Problem Language Result Execution time Memory
109596 2019-05-07T07:26:51 Z JustasZ Ancient Books (IOI17_books) C++14
70 / 100
 2000 ms 117368 KB 
#include "books.h"
#include <bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int n, s, val[maxn], nxt, L[maxn], R[maxn], fr, to;
ll base, add;
vector<int>p;
map<pii, int>dp;
ll solve(int l, int r)
{
    if(dp.count(pii(l, r)))
        return dp[pii(l, r)];
    int cur_l = l, cur_r = r;
    int i = l, j = r;
    while(i >= cur_l || j <= cur_r)
    {
        if(i >= cur_l)
        {
            cur_l = min(cur_l, L[val[i]]);
            cur_r = max(cur_r, R[val[i]]);
            --i;
        }
        if(j <= cur_r)
        {
            cur_l = min(cur_l, L[val[j]]);
            cur_r = max(cur_r, R[val[j]]);
            j++;
        }
    }
    if(cur_l <= fr && cur_r >= to)
        return 0;
    ll ret = 1e18;
    if(cur_l > fr)
        ret = min(ret, solve(cur_l - 1, cur_r));
    if(cur_r < to)
        ret = min(ret, solve(cur_l, cur_r + 1));
    return dp[pii(l, r)] = 2 + ret;
}
ll minimum_walk(vector<int>perm, int S)
{
    p = perm;
    s = S;
    n = sz(p);
    for(int i = 1; i <= n; i++)
        L[i] = mod, R[i] = -mod;
    to = n - 1, fr = 0;
    while(to >= 0 && p[to] == to)
        --to;
    while(fr < n && p[fr] == fr)
        ++fr;
    if(fr > to)
        return 0;
    for(int i = 0; i < n; i++)
    {
        if(val[i] == 0)
        {
            int col = ++nxt, cur = i;
            while(val[cur] == 0)
            {
                val[cur] = col;
                L[col] = min(L[col], cur);
                R[col] = max(R[col], cur);
                base += abs(p[cur] - cur);
                cur = p[cur];
            }
        }
    }
    return base + solve(s, s);
}
/*int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0);
    vector<int>perm;
    ifstream fin("in.txt");
    int n, s;
    fin >> n >> s;
    perm.resize(n);
    for(int i = 0; i < n; i++)
        fin >> perm[i];
    cout << minimum_walk(perm, s) << endl;
    return 0;
}*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 275 ms 27768 KB Output is correct
31 Correct 295 ms 27128 KB Output is correct
32 Correct 170 ms 23288 KB Output is correct
33 Correct 439 ms 117368 KB Output is correct
34 Correct 419 ms 117112 KB Output is correct
35 Correct 324 ms 91272 KB Output is correct
36 Correct 194 ms 46108 KB Output is correct
37 Correct 188 ms 28044 KB Output is correct
38 Correct 163 ms 27320 KB Output is correct
39 Correct 169 ms 27188 KB Output is correct
40 Correct 185 ms 27128 KB Output is correct
41 Correct 251 ms 27196 KB Output is correct
42 Correct 196 ms 27004 KB Output is correct
43 Correct 155 ms 27000 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 9976 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 30 ms 4216 KB Output is correct
4 Correct 67 ms 9672 KB Output is correct
5 Correct 65 ms 9820 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 7 ms 1280 KB Output is correct
12 Correct 8 ms 1280 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 640 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 275 ms 27768 KB Output is correct
31 Correct 295 ms 27128 KB Output is correct
32 Correct 170 ms 23288 KB Output is correct
33 Correct 439 ms 117368 KB Output is correct
34 Correct 419 ms 117112 KB Output is correct
35 Correct 324 ms 91272 KB Output is correct
36 Correct 194 ms 46108 KB Output is correct
37 Correct 188 ms 28044 KB Output is correct
38 Correct 163 ms 27320 KB Output is correct
39 Correct 169 ms 27188 KB Output is correct
40 Correct 185 ms 27128 KB Output is correct
41 Correct 251 ms 27196 KB Output is correct
42 Correct 196 ms 27004 KB Output is correct
43 Correct 155 ms 27000 KB Output is correct
44 Correct 84 ms 9976 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 30 ms 4216 KB Output is correct
47 Correct 67 ms 9672 KB Output is correct
48 Correct 65 ms 9820 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 3 ms 384 KB Output is correct
54 Correct 7 ms 1280 KB Output is correct
55 Correct 8 ms 1280 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 4 ms 512 KB Output is correct
61 Correct 4 ms 640 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 2 ms 384 KB Output is correct
64 Execution timed out 2043 ms 30952 KB Time limit exceeded
65 Halted 0 ms 0 KB -