oj.uz

Submission #420292

# Submission time Handle Problem Language Result Execution time Memory
420292 2021-06-08T09:07:15 Z Andyvanh1 Ancient Books (IOI17_books) C++14
50 / 100
 164 ms 14936 KB 
#include <bits/stdc++.h>
#include "books.h"
 
using namespace std;
 
#define vt vector
#define INF 0x3f3f3f3f
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,x) for(int (i) = 0;(i) < (x); (i)++)
#define MOD 1000000007
 
typedef vt<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
ll minimum_walk(vi p, int s){
    for(int i = p.size()-1; i>=0; i--){
        if(p[i]==i)p.pop_back();
        else break;
    }
    ll ans = 0;
    int curlast = 0;
    int n = p.size();
    rep(i,n)ans+=1ll*(abs(p[i]-i));
    for(int i = 0; i < n; i++){
        if(i>curlast)ans+=2;
        curlast = max(curlast,p[i]);
    }
    return ans;
}

Compilation message

books.cpp: In function 'll minimum_walk(vi, int)':
books.cpp:10:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define rep(i,x) for(int (i) = 0;(i) < (x); (i)++)
      |                          ^
books.cpp:26:5: note: in expansion of macro 'rep'
   26 |     rep(i,n)ans+=1ll*(abs(p[i]-i));
      |     ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 296 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 136 ms 14816 KB Output is correct
31 Correct 119 ms 14936 KB Output is correct
32 Correct 115 ms 14820 KB Output is correct
33 Correct 117 ms 14820 KB Output is correct
34 Correct 136 ms 14788 KB Output is correct
35 Correct 124 ms 14936 KB Output is correct
36 Correct 123 ms 14816 KB Output is correct
37 Correct 123 ms 14820 KB Output is correct
38 Correct 164 ms 14820 KB Output is correct
39 Correct 125 ms 14780 KB Output is correct
40 Correct 118 ms 14816 KB Output is correct
41 Correct 120 ms 14808 KB Output is correct
42 Correct 153 ms 14936 KB Output is correct
43 Correct 116 ms 14804 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 136 ms 14816 KB Output is correct
31 Correct 119 ms 14936 KB Output is correct
32 Correct 115 ms 14820 KB Output is correct
33 Correct 117 ms 14820 KB Output is correct
34 Correct 136 ms 14788 KB Output is correct
35 Correct 124 ms 14936 KB Output is correct
36 Correct 123 ms 14816 KB Output is correct
37 Correct 123 ms 14820 KB Output is correct
38 Correct 164 ms 14820 KB Output is correct
39 Correct 125 ms 14780 KB Output is correct
40 Correct 118 ms 14816 KB Output is correct
41 Correct 120 ms 14808 KB Output is correct
42 Correct 153 ms 14936 KB Output is correct
43 Correct 116 ms 14804 KB Output is correct
44 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -