답안 #245639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245639	2020-07-07T02:33:30 Z	LittleFlowers__	고대 책들 (IOI17_books)	C++17	50 / 100	229 ms	21100 KB

books

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);

long long minimum_walk(vector<int> p, int s){
    long long tot=0;
    vector<int> dd(p.size());
    vector<ii> q;
    forinc(i,0,p.size()-1){
        if(!dd[i]){
            if(i && p[i]==i) continue;
            int j=i;
            int mi=i;
            int ma=i;
            do{
                tot+=abs(p[j]-j);
                j=p[j];
                dd[j]=1;
                mi=min(mi,j);
                ma=max(ma,j);
            } while(j!=i);
            q.push_back({mi,ma});
        }
    }

    sort(all(q));

    int j=0;
    forv(i,q){
        if(i.se<=j) continue;
        if(i.fi>j) tot+=abs(j-i.fi)*2;
        j=max(j,i.se);
    }
    return tot;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	256 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	4 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	4 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	4 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	229 ms	18808 KB	Output is correct
31	Correct	225 ms	18936 KB	Output is correct
32	Correct	144 ms	18936 KB	Output is correct
33	Correct	153 ms	20972 KB	Output is correct
34	Correct	158 ms	20972 KB	Output is correct
35	Correct	165 ms	21100 KB	Output is correct
36	Correct	158 ms	20972 KB	Output is correct
37	Correct	156 ms	19192 KB	Output is correct
38	Correct	160 ms	18936 KB	Output is correct
39	Correct	158 ms	18936 KB	Output is correct
40	Correct	167 ms	18808 KB	Output is correct
41	Correct	190 ms	18808 KB	Output is correct
42	Correct	184 ms	18868 KB	Output is correct
43	Correct	165 ms	21100 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	5 ms	384 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	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	256 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	4 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	4 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	4 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	229 ms	18808 KB	Output is correct
31	Correct	225 ms	18936 KB	Output is correct
32	Correct	144 ms	18936 KB	Output is correct
33	Correct	153 ms	20972 KB	Output is correct
34	Correct	158 ms	20972 KB	Output is correct
35	Correct	165 ms	21100 KB	Output is correct
36	Correct	158 ms	20972 KB	Output is correct
37	Correct	156 ms	19192 KB	Output is correct
38	Correct	160 ms	18936 KB	Output is correct
39	Correct	158 ms	18936 KB	Output is correct
40	Correct	167 ms	18808 KB	Output is correct
41	Correct	190 ms	18808 KB	Output is correct
42	Correct	184 ms	18868 KB	Output is correct
43	Correct	165 ms	21100 KB	Output is correct
44	Incorrect	5 ms	384 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #245639

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