oj.uz

Submission #245038

# Submission time Handle Problem Language Result Execution time Memory
245038 2020-07-05T11:18:12 Z vioalbert Collecting Stamps 3 (JOI20_ho_t3) C++14
25 / 100
 2000 ms 179044 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];

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];
	}
	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];
	memset(dist, -1, sizeof dist);
	int ans = 0;
	pq.push({0, {1, n, 0, 0}});
	dist[1][n][0][0] = 0;
	while(!pq.empty()) {
		ll d = pq.top().first; state u = pq.top().second; pq.pop();
		if(dist[u.l][u.r][u.cnt][u.dir] == d) {
			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 = d + cost;
				ll& nxt1 = dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0];
				if(nxt1 == -1 || nxt1 > total) {
					nxt1 = total;
					pq.push({nxt1, {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 = d + cost;
				ll& nxt2 = dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1];
				if(nxt2 == -1 || nxt2 > total) {
					nxt2 = total;
					pq.push({nxt2, {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 = d + cost;
				ll& nxt1 = dist[u.l][u.r-1][u.cnt + (total <= t[u.r])][1];
				if(nxt1 == -1 || nxt1 > total) {
					nxt1 = total;
					pq.push({nxt1, {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 = d + cost;
				ll& nxt2 = dist[u.l+1][u.r][u.cnt + (total <= t[u.l])][0];
				if(nxt2 == -1 || nxt2 > total) {
					nxt2 = total;
					pq.push({nxt2, {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:32: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 5 ms 384 KB Output is correct
2 Correct 4 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 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 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 512 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 5 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 512 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 1037 ms 105640 KB Output is correct
19 Correct 455 ms 50532 KB Output is correct
20 Correct 129 ms 20712 KB Output is correct
21 Correct 381 ms 46924 KB Output is correct
22 Correct 678 ms 72292 KB Output is correct
23 Correct 137 ms 17000 KB Output is correct
24 Correct 41 ms 11256 KB Output is correct
25 Correct 114 ms 16488 KB Output is correct
26 Correct 19 ms 3904 KB Output is correct
27 Correct 143 ms 17384 KB Output is correct
28 Correct 43 ms 10360 KB Output is correct
29 Correct 112 ms 17900 KB Output is correct
30 Correct 46 ms 12024 KB Output is correct
31 Correct 110 ms 16668 KB Output is correct
32 Correct 35 ms 6140 KB Output is correct
33 Correct 95 ms 14960 KB Output is correct
34 Correct 17 ms 3964 KB Output is correct
35 Correct 32 ms 13504 KB Output is correct
36 Correct 20 ms 5372 KB Output is correct
37 Correct 38 ms 15092 KB Output is correct
38 Correct 35 ms 6908 KB Output is correct
39 Correct 39 ms 15996 KB Output is correct
40 Correct 29 ms 7804 KB Output is correct
41 Correct 1837 ms 152332 KB Output is correct
42 Correct 77 ms 71224 KB Output is correct
43 Correct 1865 ms 152396 KB Output is correct
44 Correct 51 ms 69688 KB Output is correct
45 Correct 1782 ms 152244 KB Output is correct
46 Correct 49 ms 71224 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 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 512 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 5 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 512 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 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 1037 ms 105640 KB Output is correct
37 Correct 455 ms 50532 KB Output is correct
38 Correct 129 ms 20712 KB Output is correct
39 Correct 381 ms 46924 KB Output is correct
40 Correct 678 ms 72292 KB Output is correct
41 Correct 137 ms 17000 KB Output is correct
42 Correct 41 ms 11256 KB Output is correct
43 Correct 114 ms 16488 KB Output is correct
44 Correct 19 ms 3904 KB Output is correct
45 Correct 143 ms 17384 KB Output is correct
46 Correct 43 ms 10360 KB Output is correct
47 Correct 112 ms 17900 KB Output is correct
48 Correct 46 ms 12024 KB Output is correct
49 Correct 110 ms 16668 KB Output is correct
50 Correct 35 ms 6140 KB Output is correct
51 Correct 95 ms 14960 KB Output is correct
52 Correct 17 ms 3964 KB Output is correct
53 Correct 32 ms 13504 KB Output is correct
54 Correct 20 ms 5372 KB Output is correct
55 Correct 38 ms 15092 KB Output is correct
56 Correct 35 ms 6908 KB Output is correct
57 Correct 39 ms 15996 KB Output is correct
58 Correct 29 ms 7804 KB Output is correct
59 Correct 1837 ms 152332 KB Output is correct
60 Correct 77 ms 71224 KB Output is correct
61 Correct 1865 ms 152396 KB Output is correct
62 Correct 51 ms 69688 KB Output is correct
63 Correct 1782 ms 152244 KB Output is correct
64 Correct 49 ms 71224 KB Output is correct
65 Correct 1473 ms 134216 KB Output is correct
66 Correct 1213 ms 121200 KB Output is correct
67 Correct 1047 ms 102520 KB Output is correct
68 Correct 788 ms 92504 KB Output is correct
69 Correct 1382 ms 132552 KB Output is correct
70 Correct 1281 ms 126004 KB Output is correct
71 Correct 1038 ms 127564 KB Output is correct
72 Correct 1492 ms 129384 KB Output is correct
73 Correct 520 ms 105684 KB Output is correct
74 Correct 1113 ms 96784 KB Output is correct
75 Correct 1061 ms 122748 KB Output is correct
76 Correct 1436 ms 144848 KB Output is correct
77 Correct 1351 ms 145132 KB Output is correct
78 Correct 814 ms 93984 KB Output is correct
79 Correct 1097 ms 110512 KB Output is correct
80 Correct 1466 ms 141244 KB Output is correct
81 Correct 952 ms 111944 KB Output is correct
82 Correct 526 ms 107224 KB Output is correct
83 Correct 1510 ms 152280 KB Output is correct
84 Correct 547 ms 113496 KB Output is correct
85 Correct 894 ms 139528 KB Output is correct
86 Correct 646 ms 123788 KB Output is correct
87 Correct 1418 ms 122780 KB Output is correct
88 Execution timed out 2095 ms 179044 KB Time limit exceeded
89 Halted 0 ms 0 KB -