답안 #921094

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921094	2024-02-03T10:01:55 Z	salmon	고대 책들 (IOI17_books)	C++14	22 / 100	93 ms	9196 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){            soom += 2;        }         fre = max(fre,i);        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);        }    }     for(int i = N - 1; i > 0; i--){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:4:121: warning: unused variable 'un' [-Wunused-variable]
    4 | 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){            soom += 2;        }         fre = max(fre,i);        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);        }    }     for(int i = N - 1; i > 0; i--){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}
      |                                                                                                                         ^~
books.cpp:4:154: warning: unused variable 'i' [-Wunused-variable]
    4 | 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){            soom += 2;        }         fre = max(fre,i);        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);        }    }     for(int i = N - 1; i > 0; i--){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}
      |                                                                                                                                                          ^

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1368 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	1368 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	1372 KB	Output is correct
9	Correct	1 ms	1412 KB	Output is correct
10	Correct	1 ms	1368 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	1368 KB	Output is correct
16	Correct	1 ms	1368 KB	Output is correct
17	Correct	1 ms	1372 KB	Output is correct
18	Correct	1 ms	1372 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1368 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	1368 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	1372 KB	Output is correct
9	Correct	1 ms	1412 KB	Output is correct
10	Correct	1 ms	1368 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	1368 KB	Output is correct
16	Correct	1 ms	1368 KB	Output is correct
17	Correct	1 ms	1372 KB	Output is correct
18	Correct	1 ms	1372 KB	Output is correct
19	Correct	1 ms	1372 KB	Output is correct
20	Correct	1 ms	1372 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	1 ms	1372 KB	Output is correct
23	Correct	1 ms	1372 KB	Output is correct
24	Correct	1 ms	1372 KB	Output is correct
25	Correct	1 ms	1368 KB	Output is correct
26	Correct	1 ms	1372 KB	Output is correct
27	Correct	1 ms	1372 KB	Output is correct
28	Correct	1 ms	1372 KB	Output is correct
29	Correct	1 ms	1372 KB	Output is correct

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1368 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	1368 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	1372 KB	Output is correct
9	Correct	1 ms	1412 KB	Output is correct
10	Correct	1 ms	1368 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	1368 KB	Output is correct
16	Correct	1 ms	1368 KB	Output is correct
17	Correct	1 ms	1372 KB	Output is correct
18	Correct	1 ms	1372 KB	Output is correct
19	Correct	1 ms	1372 KB	Output is correct
20	Correct	1 ms	1372 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	1 ms	1372 KB	Output is correct
23	Correct	1 ms	1372 KB	Output is correct
24	Correct	1 ms	1372 KB	Output is correct
25	Correct	1 ms	1368 KB	Output is correct
26	Correct	1 ms	1372 KB	Output is correct
27	Correct	1 ms	1372 KB	Output is correct
28	Correct	1 ms	1372 KB	Output is correct
29	Correct	1 ms	1372 KB	Output is correct
30	Incorrect	93 ms	9196 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	1628 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	1368 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	1368 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	1372 KB	Output is correct
9	Correct	1 ms	1412 KB	Output is correct
10	Correct	1 ms	1368 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	1368 KB	Output is correct
16	Correct	1 ms	1368 KB	Output is correct
17	Correct	1 ms	1372 KB	Output is correct
18	Correct	1 ms	1372 KB	Output is correct
19	Correct	1 ms	1372 KB	Output is correct
20	Correct	1 ms	1372 KB	Output is correct
21	Correct	1 ms	1372 KB	Output is correct
22	Correct	1 ms	1372 KB	Output is correct
23	Correct	1 ms	1372 KB	Output is correct
24	Correct	1 ms	1372 KB	Output is correct
25	Correct	1 ms	1368 KB	Output is correct
26	Correct	1 ms	1372 KB	Output is correct
27	Correct	1 ms	1372 KB	Output is correct
28	Correct	1 ms	1372 KB	Output is correct
29	Correct	1 ms	1372 KB	Output is correct
30	Incorrect	93 ms	9196 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-

답안 #921094

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.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
10.0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0