Submission #296103

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
296103	2020-09-10T09:19:34 Z	ToMmyDong	Ancient Books (IOI17_books)	C++17	50 / 100	262 ms	21352 KB

books

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define SZ(i) int(i.size())
#define ALL(i) i.begin(), i.end()
#define MEM(i,a) memset(i, (a), sizeof(i))
#define X first
#define Y second
#define eb emplace_back
#define pb push_back
#ifdef tmd
#define debug(...) fprintf(stderr,"#%d-(%s)=",__LINE__,#__VA_ARGS__);_do(__VA_ARGS__);
template<typename T> void _do (T &&x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y) {cerr<<x<<", ";_do(y...);}
template<typename IT> ostream& __printRng (ostream &os, IT bg, IT ed) {
    for (IT it=bg; it!=ed; it++) {
        if (it!=bg) os << "," << *it;
        else os << "{" << *it;
    }
    return os << "}";
}
template<typename T> ostream &operator << (ostream &os, const pair<T,T> &v) {
    return os << "{" << v.X << "," <<v.Y << "}";
}
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) {
    return __printRng(os, ALL(v));
}
template<typename T> ostream &operator << (ostream &os, const set<T> &v) {
    return __printRng(os, ALL(v));
}
#define IOS()
#else
#define debug(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif
#include "books.h"


int n, mn, mx;
ll sum;
vector<int> vis, p;

void dfs (int nd) {
    mn = min(nd, mn);
    mx = max(nd, mx);
    vis[nd] = true;
    sum += abs(nd-p[nd]);
    if (!vis[p[nd]]) {
        dfs(p[nd]);
    }
}

ll minimum_walk(std::vector<int> P, int s) {
    p = P;
    n = SZ(p);
    vis.clear();
    vis.resize(n, 0);
    sum = 0;

    vector<pii> rng;
    for (int i=0; i<n; i++) {
        if (!vis[i] && p[i] != i) {
            mn = i;
            mx = i;
            dfs(i);
            rng.eb(mn, mx);
        }
    }

    sort(ALL(rng));
    vector<pii> nrng;

    int lst = -1;
    int L = -1;
    for (pii r : rng) {
        if (r.X > lst) {
            if (L != -1) {
                nrng.eb(L, lst);
            }
            L = r.X;
            lst = r.Y;
        } else {
            lst = max(lst, r.Y);
        }
    }
    if (L==-1) return 0;
    nrng.eb(L, lst);

    debug(nrng);
    debug(sum);



    for (int i=1; i<SZ(nrng); i++) {
        sum += 2 * (nrng[i].X - nrng[i-1].Y);
    }
    if (s <= nrng[0].X) {
        sum += 2 * (nrng[0].X - s);
    } else if (s >= nrng.back().Y) {
        sum += 2 * (s - nrng.back().Y);
    } else {
        pii bg;
        for (auto v : nrng) {
            if (v.Y >= s) {
                bg = v;
                break;
            }
        }
        
        if (bg.X < s) {
            int sz = bg.Y - bg.X + 1;
            set<int> alive;
            deque<int> bfs;
            vector<int> dis(n, 0x3f3f3f3f);
            for (int i=bg.X; i<=bg.Y; i++) {
                alive.insert(i);
            }
            alive.erase(s);
            bfs.emplace_back(s);

            dis[s] = 0;
            while (bfs.size()) {
                int nd = bfs.front();
                bfs.pop_front();

                int l = nd, r = p[nd];
                if (l > r) swap(l, r);

                while (l < r) {
                    auto ptr = alive.lower_bound(l);
                    debug(*ptr);
                    if (ptr == alive.end() || *ptr > r) {
                        break;
                    }
                    bfs.emplace_front(*ptr);
                    dis[*ptr] = dis[nd];
                    l = *ptr;
                    alive.erase(ptr);
                }

                if (alive.count(nd+1)) {
                    dis[nd+1] = dis[nd] + 1;
                    alive.erase(nd+1);
                    bfs.emplace_back(nd + 1);
                }
                if (alive.count(nd-1)) {
                    dis[nd-1] = dis[nd] + 1;
                    alive.erase(nd-1);
                    bfs.emplace_back(nd + 1);
                }
            }

            sum += min(dis[bg.X], dis[bg.Y]) * 2;
        }
    }

	return sum;
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:114:17: warning: unused variable 'sz' [-Wunused-variable]
  114 |             int sz = bg.Y - bg.X + 1;
      |                 ^~

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 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	404 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	372 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	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 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	404 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	372 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	262 ms	16504 KB	Output is correct
31	Correct	251 ms	16504 KB	Output is correct
32	Correct	154 ms	16504 KB	Output is correct
33	Correct	172 ms	21096 KB	Output is correct
34	Correct	171 ms	21096 KB	Output is correct
35	Correct	181 ms	21352 KB	Output is correct
36	Correct	176 ms	19432 KB	Output is correct
37	Correct	164 ms	16940 KB	Output is correct
38	Correct	174 ms	16764 KB	Output is correct
39	Correct	171 ms	16560 KB	Output is correct
40	Correct	179 ms	16504 KB	Output is correct
41	Correct	198 ms	16504 KB	Output is correct
42	Correct	189 ms	16464 KB	Output is correct
43	Correct	174 ms	18668 KB	Output is correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	376 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3530'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 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	404 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	372 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	262 ms	16504 KB	Output is correct
31	Correct	251 ms	16504 KB	Output is correct
32	Correct	154 ms	16504 KB	Output is correct
33	Correct	172 ms	21096 KB	Output is correct
34	Correct	171 ms	21096 KB	Output is correct
35	Correct	181 ms	21352 KB	Output is correct
36	Correct	176 ms	19432 KB	Output is correct
37	Correct	164 ms	16940 KB	Output is correct
38	Correct	174 ms	16764 KB	Output is correct
39	Correct	171 ms	16560 KB	Output is correct
40	Correct	179 ms	16504 KB	Output is correct
41	Correct	198 ms	16504 KB	Output is correct
42	Correct	189 ms	16464 KB	Output is correct
43	Correct	174 ms	18668 KB	Output is correct
44	Incorrect	1 ms	376 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3530'
45	Halted	0 ms	0 KB	-