답안 #98463 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98463	2019-02-23T18:11:18 Z	bogdan10bos	고대 책들 (IOI17_books)	C++14	12 / 100	3 ms	512 KB

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std;

typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pii> p3i;

LL minimum_walk(vector<int> p, int s)
{
	LL ans = 0LL;
	int N = p.size();
	for(int i = 0; i < N; i++)
        ans += abs(i - p[i]);

    vector<int> f;
    f.resize(N);
    for(int i = 0; i < N; i++)  f[i] = i;
    function<int(int)> F = [&](int x) -> int { if(x == f[x]) return x; return f[x] = F(f[x]); } ;

    for(int i = 0; i < N; i++)
    {
        int fx = F(i), fy = F(p[i]);
        if(fx == fy)    continue;
        f[fy] = fx;
    }

    vector<int> nodes;
    vector<p3i> edges;
    for(int i = 0; i < N; i++)
        if(p[i] != i)
            nodes.push_back(i);
    for(int i = 0; i < nodes.size(); i++)
    {
        int nod = nodes[i];
        edges.push_back({abs(s - nod), {s, nod}});
        if(i > 0)
        {
            int lst = nodes[i - 1];
            edges.push_back({abs(nod - lst) + abs(lst - p[nod]) - abs(nod - p[nod]), {nod, lst}});
        }
    }

    sort(begin(edges), end(edges));

    for(auto &e: edges)
    {
        int cst = e.first, x = e.second.first, y = e.second.second;

        int fx = F(x), fy = F(y);
        if(fx == fy)    continue;

        ans += 2LL * cst;
        f[fy] = fx;
    }

    return ans;
}

Compilation message

books.cpp: In function 'LL minimum_walk(std::vector<int>, int)':
books.cpp:34:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < nodes.size(); i++)
                    ~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	352 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	512 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '3388'
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	352 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	512 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '3388'
23	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '3304', found: '5300'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	3 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	352 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	512 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '3388'
23	Halted	0 ms	0 KB	-

답안 #98463

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0