답안 #165277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165277	2019-11-26T10:36:23 Z	Segtree	고대 책들 (IOI17_books)	C++14	50 / 100	267 ms	20252 KB

books

#include<iostream>
#include<algorithm>
#include<vector>
#include"books.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 1000010
ll minimum_walk(vector<int> p,int s){
    int n=p.size();
    ll sum=0;
    for(int i=0;i<n;i++)sum+=abs(i-p[i]);
    bool vis[N];
    for(int i=0;i<n;i++)vis[i]=0;
    vector<pair<ll,ll> >v;
    for(int i=0;i<n;i++){
	if(vis[i])continue;
	ll x=i;
	ll mi=1e17,ma=-1e17;
	while(1){
	    chmin(mi,x);
	    chmax(ma,x);
	    vis[x]=1;
	    x=p[x];
	    if(x==i)break;
	}
	if(mi!=ma){
	    v.push_back(make_pair(mi,ma));
	}
    }
    sort(v.begin(),v.end());
    ll rnd=0;
    for(int i=0;i<v.size();i++){
	if(rnd<v[i].first)sum+=2*(v[i].first-rnd);
	chmax(rnd,v[i].second);
    }
    return sum;
}

Compilation message

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

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	252 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	248 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	11 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	248 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	380 KB	Output is correct
30	Correct	185 ms	15940 KB	Output is correct
31	Correct	186 ms	15804 KB	Output is correct
32	Correct	136 ms	15820 KB	Output is correct
33	Correct	151 ms	20200 KB	Output is correct
34	Correct	151 ms	20136 KB	Output is correct
35	Correct	160 ms	20072 KB	Output is correct
36	Correct	157 ms	20252 KB	Output is correct
37	Correct	147 ms	16712 KB	Output is correct
38	Correct	152 ms	16188 KB	Output is correct
39	Correct	152 ms	16120 KB	Output is correct
40	Correct	158 ms	15964 KB	Output is correct
41	Correct	267 ms	15840 KB	Output is correct
42	Correct	185 ms	16008 KB	Output is correct
43	Correct	159 ms	20072 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	252 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	248 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	11 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	248 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	380 KB	Output is correct
30	Correct	185 ms	15940 KB	Output is correct
31	Correct	186 ms	15804 KB	Output is correct
32	Correct	136 ms	15820 KB	Output is correct
33	Correct	151 ms	20200 KB	Output is correct
34	Correct	151 ms	20136 KB	Output is correct
35	Correct	160 ms	20072 KB	Output is correct
36	Correct	157 ms	20252 KB	Output is correct
37	Correct	147 ms	16712 KB	Output is correct
38	Correct	152 ms	16188 KB	Output is correct
39	Correct	152 ms	16120 KB	Output is correct
40	Correct	158 ms	15964 KB	Output is correct
41	Correct	267 ms	15840 KB	Output is correct
42	Correct	185 ms	16008 KB	Output is correct
43	Correct	159 ms	20072 KB	Output is correct
44	Incorrect	2 ms	376 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #165277

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0