oj.uz

답안 #921097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921097 2024-02-03T10:07:49 Z salmon 고대 책들 (IOI17_books) C++14
50 / 100
 89 ms 9324 KB 
#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;   long long 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 > s; i--){        if(p[i] != i){            break;        }        soom -= 2;    }for(int i = 0; i < s; 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:2:121: warning: unused variable 'un' [-Wunused-variable]
    2 | using namespace std; long long minimum_walk(vector<int> p, int s) {    bool done[1100100];    int N = p.size();     int un = N;   long long 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 > s; i--){        if(p[i] != i){            break;        }        soom -= 2;    }for(int i = 0; i < s; i++){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}
      |                                                                                                                         ^~
books.cpp:2:163: warning: unused variable 'i' [-Wunused-variable]
    2 | using namespace std; long long minimum_walk(vector<int> p, int s) {    bool done[1100100];    int N = p.size();     int un = N;   long long 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 > s; i--){        if(p[i] != i){            break;        }        soom -= 2;    }for(int i = 0; i < s; i++){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}
      |                                                                                                                                                                   ^

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 1368 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1364 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 1372 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 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1368 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1364 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 1372 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 1368 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 1304 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 1 ms 1368 KB Output is correct
28 Correct 1 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct

Subtask #3
28.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 1368 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1364 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 1372 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 1368 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 1304 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 1 ms 1368 KB Output is correct
28 Correct 1 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Correct 89 ms 9324 KB Output is correct
31 Correct 87 ms 9296 KB Output is correct
32 Correct 72 ms 9200 KB Output is correct
33 Correct 75 ms 9296 KB Output is correct
34 Correct 82 ms 9216 KB Output is correct
35 Correct 79 ms 9204 KB Output is correct
36 Correct 75 ms 9204 KB Output is correct
37 Correct 73 ms 9300 KB Output is correct
38 Correct 81 ms 9212 KB Output is correct
39 Correct 74 ms 9196 KB Output is correct
40 Correct 75 ms 9296 KB Output is correct
41 Correct 84 ms 9136 KB Output is correct
42 Correct 88 ms 9296 KB Output is correct
43 Correct 77 ms 9200 KB Output is correct

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 1368 KB Output is correct
4 Correct 1 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1364 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 1372 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 1368 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 1304 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 1 ms 1372 KB Output is correct
27 Correct 1 ms 1368 KB Output is correct
28 Correct 1 ms 1372 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Correct 89 ms 9324 KB Output is correct
31 Correct 87 ms 9296 KB Output is correct
32 Correct 72 ms 9200 KB Output is correct
33 Correct 75 ms 9296 KB Output is correct
34 Correct 82 ms 9216 KB Output is correct
35 Correct 79 ms 9204 KB Output is correct
36 Correct 75 ms 9204 KB Output is correct
37 Correct 73 ms 9300 KB Output is correct
38 Correct 81 ms 9212 KB Output is correct
39 Correct 74 ms 9196 KB Output is correct
40 Correct 75 ms 9296 KB Output is correct
41 Correct 84 ms 9136 KB Output is correct
42 Correct 88 ms 9296 KB Output is correct
43 Correct 77 ms 9200 KB Output is correct
44 Incorrect 1 ms 1372 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -