Submission #348754

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
348754	2021-01-15T16:11:48 Z	ryansee	Ancient Books (IOI17_books)	C++14	50 / 100	142 ms	15980 KB

books

#include "books.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
// inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (1000006)

ll n, ans;
ll co[MAXN], cur;
int l, e;

long long minimum_walk(std::vector<int> p, int s) {
	n = siz(p), ans = 0, mmst(co, 0), cur = 0, l = 0;
	FOR(i,0,n-1) if(p[i] ^ i) l = i;
	DEC(i,n-1,0) if(p[i] ^ i) e = i;
	FOR(i,min(e + 1, s),l - 1) {
		if(p[i] > i) ++ co[i], -- co[p[i]];
		cur += co[i];
		ans += max(cur, 1ll) * 2;
	}
	
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	8172 KB	Output is correct
2	Correct	5 ms	8172 KB	Output is correct
3	Correct	5 ms	8172 KB	Output is correct
4	Correct	5 ms	8172 KB	Output is correct
5	Correct	5 ms	8172 KB	Output is correct
6	Correct	5 ms	8172 KB	Output is correct
7	Correct	5 ms	8172 KB	Output is correct
8	Correct	5 ms	8172 KB	Output is correct
9	Correct	5 ms	8172 KB	Output is correct
10	Correct	5 ms	8172 KB	Output is correct
11	Correct	5 ms	8172 KB	Output is correct
12	Correct	5 ms	8172 KB	Output is correct
13	Correct	5 ms	8172 KB	Output is correct
14	Correct	5 ms	8172 KB	Output is correct
15	Correct	5 ms	8172 KB	Output is correct
16	Correct	5 ms	8172 KB	Output is correct
17	Correct	5 ms	8172 KB	Output is correct
18	Correct	5 ms	8172 KB	Output is correct
19	Correct	5 ms	8172 KB	Output is correct
20	Correct	5 ms	8172 KB	Output is correct
21	Correct	5 ms	8172 KB	Output is correct
22	Correct	5 ms	8172 KB	Output is correct
23	Correct	5 ms	8172 KB	Output is correct
24	Correct	5 ms	8172 KB	Output is correct
25	Correct	5 ms	8172 KB	Output is correct
26	Correct	5 ms	8172 KB	Output is correct
27	Correct	5 ms	8172 KB	Output is correct
28	Correct	5 ms	8172 KB	Output is correct
29	Correct	5 ms	8172 KB	Output is correct
30	Correct	131 ms	15980 KB	Output is correct
31	Correct	142 ms	15980 KB	Output is correct
32	Correct	126 ms	15980 KB	Output is correct
33	Correct	134 ms	15980 KB	Output is correct
34	Correct	132 ms	15980 KB	Output is correct
35	Correct	134 ms	15980 KB	Output is correct
36	Correct	127 ms	15980 KB	Output is correct
37	Correct	130 ms	15980 KB	Output is correct
38	Correct	126 ms	15980 KB	Output is correct
39	Correct	126 ms	15980 KB	Output is correct
40	Correct	129 ms	15980 KB	Output is correct
41	Correct	132 ms	15980 KB	Output is correct
42	Correct	129 ms	15980 KB	Output is correct
43	Correct	136 ms	15980 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	8172 KB	Output is correct
2	Correct	5 ms	8172 KB	Output is correct
3	Correct	5 ms	8172 KB	Output is correct
4	Correct	5 ms	8172 KB	Output is correct
5	Correct	5 ms	8172 KB	Output is correct
6	Correct	5 ms	8172 KB	Output is correct
7	Correct	5 ms	8172 KB	Output is correct
8	Correct	5 ms	8172 KB	Output is correct
9	Correct	5 ms	8172 KB	Output is correct
10	Correct	5 ms	8172 KB	Output is correct
11	Correct	5 ms	8172 KB	Output is correct
12	Correct	5 ms	8172 KB	Output is correct
13	Correct	5 ms	8172 KB	Output is correct
14	Correct	5 ms	8172 KB	Output is correct
15	Correct	5 ms	8172 KB	Output is correct
16	Correct	5 ms	8172 KB	Output is correct
17	Correct	5 ms	8172 KB	Output is correct
18	Correct	5 ms	8172 KB	Output is correct
19	Correct	5 ms	8172 KB	Output is correct
20	Correct	5 ms	8172 KB	Output is correct
21	Correct	5 ms	8172 KB	Output is correct
22	Correct	5 ms	8172 KB	Output is correct
23	Correct	5 ms	8172 KB	Output is correct
24	Correct	5 ms	8172 KB	Output is correct
25	Correct	5 ms	8172 KB	Output is correct
26	Correct	5 ms	8172 KB	Output is correct
27	Correct	5 ms	8172 KB	Output is correct
28	Correct	5 ms	8172 KB	Output is correct
29	Correct	5 ms	8172 KB	Output is correct
30	Correct	131 ms	15980 KB	Output is correct
31	Correct	142 ms	15980 KB	Output is correct
32	Correct	126 ms	15980 KB	Output is correct
33	Correct	134 ms	15980 KB	Output is correct
34	Correct	132 ms	15980 KB	Output is correct
35	Correct	134 ms	15980 KB	Output is correct
36	Correct	127 ms	15980 KB	Output is correct
37	Correct	130 ms	15980 KB	Output is correct
38	Correct	126 ms	15980 KB	Output is correct
39	Correct	126 ms	15980 KB	Output is correct
40	Correct	129 ms	15980 KB	Output is correct
41	Correct	132 ms	15980 KB	Output is correct
42	Correct	129 ms	15980 KB	Output is correct
43	Correct	136 ms	15980 KB	Output is correct
44	Incorrect	5 ms	8172 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2742'
45	Halted	0 ms	0 KB	-

Submission #348754

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