답안 #578461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578461	2022-06-17T03:08:24 Z	definitelynotmee	고대 책들 (IOI17_books)	C++	50 / 100	416 ms	104740 KB

books

#include<bits/stdc++.h>
#include "books.h"
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;
const int INF = 1e9;
long long minimum_walk(std::vector<int> p, int s) {
    int n = p.size();
    ll resp =0;

    for(int i = 0; i < n; i++){
        resp+=abs(i-p[i]);
    }
    vector<pii> crange(n);
    vector<int> cycle(n), check(n);
    auto dfs = [&](int id, int cid, auto dfs)->int{
        cycle[id] = cid;
        check[id] = 1;
        if(check[p[id]])
            return id;
        return max(id,dfs(p[id],cid,dfs));
    };
    vector<int> isgood(n);
    vector<pii> cycles;
    
    for(int i = 0; i < n; i++){
        if(!check[i]){
            int r = dfs(i,i,dfs);
            crange[i] = {i,r};
            isgood[i] = cycles.empty() || cycles.back().ss < r;
            if(r-i && isgood[i]){
                if(cycles.size() && cycles.back().ss > i){
                    int l = cycles.back().ff;
                    cycles.pop_back();
                    cycles.push_back({l,r});
                } else {
                    cycles.push_back({i,r});
                }
            }
        }
    }
    
    for(int i = 0; i < (int)cycles.size()-1; i++){
        resp+= 2*(cycles[i+1].ff-cycles[i].ss);
    }
    if(cycles.empty())
        return resp;
    if(s < cycles[0].ff || s > cycles.back().ss){
        resp+=max(cycles[0].ff-s, s-cycles.back().ss)*2;
        return resp;
    }
    
    matrix<pii> g(n);
    for(int i = 0; i < n-1; i++){
        int cur = cycle[i];
        g[cur].push_back({cycle[i+1],2});
        g[cycle[i+1]].push_back({cur,2});
    }
    vector<int> st;
    for(int i = 0; i < n; i++){
        if(st.empty()){
            st.push_back(i);
            goto END;
        }
        g[st.back()].push_back({cycle[i],0});
        if(cycle[i]!=i)
            goto END;
        if(crange[st.back()].ss < crange[i].ss)
            st.pop_back();
        st.push_back(i);

        END:
        if(i == crange[st.back()].ss)
            st.pop_back();
    }

    priority_queue<pii,vector<pii>,greater<pii>> pq;
    vector<int> dist(n,INF);
    pq.push({0,cycle[s]});
    dist[cycle[s]] = 0;

    while(!pq.empty()){
        int cur = pq.top().ss, curp = pq.top().ff;
        pq.pop();
        if(curp> dist[cur])
            continue;
        for(auto [viz,vizp] : g[cur]){
            if(dist[viz] > vizp+dist[cur]){
                dist[viz]= vizp+dist[cur];
                pq.push({dist[viz],viz});
            }
        }
    }
    
    int add = INF;
    for(int i = 0; i < n; i++){
        if(isgood[i])
            add = min(add,dist[i]);
    }
    resp+=add;

    return resp;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:93:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   93 |         for(auto [viz,vizp] : g[cur]){
      |                  ^

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	248 ms	104740 KB	Output is correct
31	Correct	271 ms	93872 KB	Output is correct
32	Correct	103 ms	27596 KB	Output is correct
33	Correct	110 ms	29792 KB	Output is correct
34	Correct	108 ms	29796 KB	Output is correct
35	Correct	279 ms	94180 KB	Output is correct
36	Correct	246 ms	92320 KB	Output is correct
37	Correct	209 ms	89848 KB	Output is correct
38	Correct	163 ms	86716 KB	Output is correct
39	Correct	183 ms	86124 KB	Output is correct
40	Correct	179 ms	83588 KB	Output is correct
41	Correct	206 ms	92252 KB	Output is correct
42	Correct	189 ms	87496 KB	Output is correct
43	Correct	416 ms	100524 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Incorrect	1 ms	340 KB	3rd lines differ - on the 1st token, expected: '17916', found: '17896'
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	248 ms	104740 KB	Output is correct
31	Correct	271 ms	93872 KB	Output is correct
32	Correct	103 ms	27596 KB	Output is correct
33	Correct	110 ms	29792 KB	Output is correct
34	Correct	108 ms	29796 KB	Output is correct
35	Correct	279 ms	94180 KB	Output is correct
36	Correct	246 ms	92320 KB	Output is correct
37	Correct	209 ms	89848 KB	Output is correct
38	Correct	163 ms	86716 KB	Output is correct
39	Correct	183 ms	86124 KB	Output is correct
40	Correct	179 ms	83588 KB	Output is correct
41	Correct	206 ms	92252 KB	Output is correct
42	Correct	189 ms	87496 KB	Output is correct
43	Correct	416 ms	100524 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Incorrect	1 ms	340 KB	3rd lines differ - on the 1st token, expected: '17916', found: '17896'
59	Halted	0 ms	0 KB	-