oj.uz

Submission #244958

# Submission time Handle Problem Language Result Execution time Memory
244958 2020-07-05T10:03:55 Z vioalbert Collecting Stamps 3 (JOI20_ho_t3) C++14
15 / 100
 2000 ms 168128 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll N = 205;
ll n, l;
ll cl[N], ccl[N], t[N], idx[N];

void read() {
	cin >> n >> l;
	cl[0] = ccl[0] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> cl[i];
		ccl[i] = l - cl[i];
		idx[i] = i;
	}
	for(int i = 1; i <= n; i++)
		cin >> t[i];
}

struct state {
	int l, r, cnt; bool dir;
	bool operator<(const state& ot) const {
		return cnt < ot.cnt;
	}
};

void solve() {
	priority_queue<pair<ll, state>, vector<pair<ll, state>>, greater<pair<ll, state>>> pq;
	ll dist[n+2][n+2][n+2][2];
	bool vis[n+2][n+2][n+2][2];
	for(int i = 0; i <= n+1; i++) {
		for(int j = 0; j <= n+1; j++) {
			for(int k = 0; k <= n+1; k++) {
				dist[i][j][k][0] = dist[i][j][k][1] = 1e15;
				vis[i][j][k][0] = vis[i][j][k][1] = 0;
			}
		}
	}
	int ans = 0;
	pq.push({0, {1, n, 0, 0}});
	dist[1][n][0][0] = 0;
	while(!pq.empty()) {
		state u = pq.top().second; pq.pop();
		if(!vis[u.l][u.r][u.cnt][u.dir]) {
			vis[u.l][u.r][u.cnt][u.dir] = 1;
			// cerr << u.l << ' ' << u.r << ' ' << u.cnt << ' ' << u.dir << '\n';
			// cerr << dist[u.l][u.r][u.cnt][u.dir] << '\n';
			if(u.l > u.r) {
				ans = max(ans, u.cnt);
				continue;
			}

			ll cost, total;
			if(u.dir == 0) {
				cost = ((u.l==1)?0:-cl[u.l-1]) + cl[u.l];
				total = dist[u.l][u.r][u.cnt][u.dir] + cost;
				if(dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0] > total) {
					dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0] = total;
					pq.push({dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0], {u.l+1, u.r, u.cnt + (total <= t[u.l]), 0}});
				}

				cost = ((u.l==1)?0:cl[u.l-1]) + ccl[u.r];
				total = dist[u.l][u.r][u.cnt][u.dir] + cost;
				if(dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1] > total) {
					dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1] = total;
					pq.push({dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1], {u.l, u.r-1, u.cnt + (total <= t[u.r]), 1}});
				}
			} else {
				cost = ((u.r==n)?0:-ccl[u.r+1]) + ccl[u.r];
				total = dist[u.l][u.r][u.cnt][u.dir] + cost;
				if(dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1] > total) {
					dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1] = total;
					pq.push({dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1], {u.l, u.r-1, u.cnt + (total <= t[u.r]), 1}});
				}

				cost = ((u.r==n)?0:ccl[u.r+1]) + cl[u.l];
				total = dist[u.l][u.r][u.cnt][u.dir] + cost;
				if(dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0] > total) {
					dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0] = total;
					pq.push({dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0], {u.l+1, u.r, u.cnt + (total <= t[u.l]), 0}});
				}
			}
		}
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	read();
	solve();
	return 0;
}

Compilation message

ho_t3.cpp: In function 'void solve()':
ho_t3.cpp:41:27: warning: narrowing conversion of 'n' from 'll {aka long long int}' to 'int' inside { } [-Wnarrowing]
  pq.push({0, {1, n, 0, 0}});
                           ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 1209 ms 117336 KB Output is correct
19 Correct 676 ms 56032 KB Output is correct
20 Correct 136 ms 22764 KB Output is correct
21 Correct 372 ms 51936 KB Output is correct
22 Correct 736 ms 79884 KB Output is correct
23 Correct 144 ms 18796 KB Output is correct
24 Correct 45 ms 12408 KB Output is correct
25 Correct 123 ms 18152 KB Output is correct
26 Correct 19 ms 4288 KB Output is correct
27 Correct 145 ms 19176 KB Output is correct
28 Correct 39 ms 11384 KB Output is correct
29 Correct 125 ms 19688 KB Output is correct
30 Correct 47 ms 13176 KB Output is correct
31 Correct 120 ms 18152 KB Output is correct
32 Correct 39 ms 6908 KB Output is correct
33 Correct 123 ms 16624 KB Output is correct
34 Correct 17 ms 4348 KB Output is correct
35 Correct 34 ms 15040 KB Output is correct
36 Correct 21 ms 5884 KB Output is correct
37 Correct 41 ms 16756 KB Output is correct
38 Correct 38 ms 7548 KB Output is correct
39 Correct 44 ms 17780 KB Output is correct
40 Correct 29 ms 8700 KB Output is correct
41 Execution timed out 2013 ms 168128 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 1209 ms 117336 KB Output is correct
37 Correct 676 ms 56032 KB Output is correct
38 Correct 136 ms 22764 KB Output is correct
39 Correct 372 ms 51936 KB Output is correct
40 Correct 736 ms 79884 KB Output is correct
41 Correct 144 ms 18796 KB Output is correct
42 Correct 45 ms 12408 KB Output is correct
43 Correct 123 ms 18152 KB Output is correct
44 Correct 19 ms 4288 KB Output is correct
45 Correct 145 ms 19176 KB Output is correct
46 Correct 39 ms 11384 KB Output is correct
47 Correct 125 ms 19688 KB Output is correct
48 Correct 47 ms 13176 KB Output is correct
49 Correct 120 ms 18152 KB Output is correct
50 Correct 39 ms 6908 KB Output is correct
51 Correct 123 ms 16624 KB Output is correct
52 Correct 17 ms 4348 KB Output is correct
53 Correct 34 ms 15040 KB Output is correct
54 Correct 21 ms 5884 KB Output is correct
55 Correct 41 ms 16756 KB Output is correct
56 Correct 38 ms 7548 KB Output is correct
57 Correct 44 ms 17780 KB Output is correct
58 Correct 29 ms 8700 KB Output is correct
59 Execution timed out 2013 ms 168128 KB Time limit exceeded
60 Halted 0 ms 0 KB -