답안 #921014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921014	2024-02-03T08:55:26 Z	salmon	고대 책들 (IOI17_books)	C++14	12 / 100	1 ms	1372 KB

books

#include <cstdio>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

long long minimum_walk(vector<int> p, int s) {
    bool done[1100100];
    int N = p.size();

    int un = N;
    int soom = 0;

    int i = 0;

    /*while(un != 0){
        if(start )
    }*/
    int fre = 0;


    for(int i = 0; i < N; i++){
        if(done[i]) continue;

        if(i > fre && i != p[i]){
            soom += 2;
        }

        int j = p[i];
        soom += abs(j - i);
        while(j != i){
            int temp = j;
            fre = max(fre,j);
            done[j] = true;
            j = p[j];
            soom += abs(temp - j);
        }
    }


    return soom;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:12:9: warning: unused variable 'un' [-Wunused-variable]
   12 |     int un = N;
      |         ^~
books.cpp:15:9: warning: unused variable 'i' [-Wunused-variable]
   15 |     int i = 0;
      |         ^

Subtask #1

12.0 / 12.0

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

Subtask #2

0 / 10.0

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

Subtask #3

0 / 28.0

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

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	1372 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	1 ms	1372 KB	Output is correct
2	Correct	1 ms	1372 KB	Output is correct
3	Correct	1 ms	1372 KB	Output is correct
4	Correct	1 ms	1372 KB	Output is correct
5	Correct	1 ms	1372 KB	Output is correct
6	Correct	1 ms	1372 KB	Output is correct
7	Correct	1 ms	1372 KB	Output is correct
8	Correct	1 ms	1368 KB	Output is correct
9	Correct	1 ms	1368 KB	Output is correct
10	Correct	1 ms	1372 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	1 ms	1372 KB	Output is correct
13	Correct	1 ms	1372 KB	Output is correct
14	Correct	1 ms	1372 KB	Output is correct
15	Correct	1 ms	1340 KB	Output is correct
16	Correct	1 ms	1372 KB	Output is correct
17	Correct	1 ms	1372 KB	Output is correct
18	Correct	1 ms	1368 KB	Output is correct
19	Correct	1 ms	1368 KB	Output is correct
20	Correct	1 ms	1368 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Incorrect	1 ms	1372 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-