oj.uz

Submission #289320

# Submission time Handle Problem Language Result Execution time Memory
289320 2020-09-02T14:40:04 Z peti1234 Ancient Books (IOI17_books) C++17
50 / 100
 331 ms 48428 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=1000002;
bool v[c];
long long sum;
int n, t[c], kezd, veg, kis, nagy, bh=c, jh, mini[c], maxi[c], x[3], y[3];
vector<int> akt;
void dfs(int a) {
    if (v[a]) return;
    v[a]=true, akt.push_back(a);
    kis=min(kis, a), nagy=max(nagy, a);
    dfs(t[a]);
}
void le() {
    int pos=mini[kezd], d=kezd, db=0, v=maxi[kezd];
    //cout << "kezdes " << bh << " " << pos << " " << v << " " << veg << "\n";
    while(bh<pos && v<=veg) {
        while(d>pos) {
            d--;
            pos=min(pos, mini[d]);
            v=max(v, maxi[d]);
        }
        if (bh<pos && v<=veg) {
            db++;
            pos--, pos=mini[pos], v=max(v, maxi[pos]);
        }
    }
    x[0]=db;
    if (v>veg) x[1]=pos, x[2]=v;
    else x[1]=-1;
}
void fel() {
    int pos=maxi[veg], d=veg, db=0, k=mini[kezd];
    while(kezd<=k && pos<jh) {
        while(d<pos) {
            d++;
            pos=max(pos, maxi[d]);
            k=min(k, mini[d]);
        }
        if (k<=kezd && pos<jh) {
            db++;
            pos++, pos=maxi[pos], k=min(k, mini[pos]);
        }
    }
    y[0]=db;
}
long long minimum_walk(vector<int> p, int s) {
    n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
    for (int i=0; i<n; i++) {
        t[i]=p[i], sum+=abs(p[i]-i);
    }
    //cout << "sima " << sum << "\n";
    for (int i=0; i<n; i++) {
        if (t[i]!=i) {
            if (bh==c) bh=i;
            jh=i;
        }
        kis=n, nagy=0;
        dfs(i);
        for (int i=0; i<akt.size(); i++) mini[akt[i]]=kis, maxi[akt[i]]=nagy;
        akt.clear();
    }
    for (int i=0; i<n; i++) {
        //cout << mini[i] << " " << maxi[i] << "\n";
    }
    while(bh<kezd || veg<jh) {
        int p=mini[kezd], q=maxi[veg];
        while(p<kezd || veg<q) {
            p=min({p, mini[kezd], mini[veg]}), q=max({q, maxi[kezd], maxi[veg]});
            if (kezd>p) kezd--;
            if (veg<q) veg++;
        }
        //cout << kezd << " " << veg << endl;
        le(), fel();
        //cout << "ert " << x[0] << " " << y[0] << " " << x[1] << " " << x[2] << "\n";
        if (x[1]==-1) {
            sum+=2*(x[0]+y[0]);
            break;
        }
        sum+=2*min(x[0], y[0]);
        while(x[1]<kezd || veg<x[2]) {
            x[1]=min({x[1], mini[kezd], mini[veg]}), x[2]=max({x[2], maxi[kezd], maxi[veg]});
            if (kezd>x[1]) kezd--;
            if (veg<x[2]) veg++;
        }
    }
    return sum;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:49:51: warning: right operand of comma operator has no effect [-Wunused-value]
   49 |     n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
      |                                                   ^~
books.cpp:49:53: warning: right operand of comma operator has no effect [-Wunused-value]
   49 |     n=p.size(), kezd=s, veg=s, kis=s, nagy=s, bh, jh;
      |                                                     ^
books.cpp:61:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for (int i=0; i<akt.size(); i++) mini[akt[i]]=kis, maxi[akt[i]]=nagy;
      |                       ~^~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 296 ms 48428 KB Output is correct
31 Correct 331 ms 34536 KB Output is correct
32 Correct 170 ms 20812 KB Output is correct
33 Correct 183 ms 20856 KB Output is correct
34 Correct 187 ms 20924 KB Output is correct
35 Correct 190 ms 20856 KB Output is correct
36 Correct 179 ms 20856 KB Output is correct
37 Correct 178 ms 20856 KB Output is correct
38 Correct 186 ms 21116 KB Output is correct
39 Correct 185 ms 21112 KB Output is correct
40 Correct 194 ms 22388 KB Output is correct
41 Correct 235 ms 32872 KB Output is correct
42 Correct 219 ms 26476 KB Output is correct
43 Correct 183 ms 20856 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '5920', found: '6428'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 296 ms 48428 KB Output is correct
31 Correct 331 ms 34536 KB Output is correct
32 Correct 170 ms 20812 KB Output is correct
33 Correct 183 ms 20856 KB Output is correct
34 Correct 187 ms 20924 KB Output is correct
35 Correct 190 ms 20856 KB Output is correct
36 Correct 179 ms 20856 KB Output is correct
37 Correct 178 ms 20856 KB Output is correct
38 Correct 186 ms 21116 KB Output is correct
39 Correct 185 ms 21112 KB Output is correct
40 Correct 194 ms 22388 KB Output is correct
41 Correct 235 ms 32872 KB Output is correct
42 Correct 219 ms 26476 KB Output is correct
43 Correct 183 ms 20856 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '5920', found: '6428'
47 Halted 0 ms 0 KB -