oj.uz

답안 #244950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244950 2020-07-05T09:57:46 Z vioalbert Collecting Stamps 3 (JOI20_ho_t3) C++14
15 / 100
 2000 ms 152392 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];
	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;
		}
	}
	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(u.l > u.r) {
			// cerr << u.l << ' ' << u.r << ' ' << u.cnt << ' ' << u.dir << '\n';
			// cerr << dist[u.l][u.r][u.cnt][u.dir] << '\n';
			ans = max(ans, u.cnt);
			continue;
		}

		// cerr << u.l << ' ' << u.r << ' ' << u.cnt << ' ' << u.dir << '\n';
		// cerr << dist[u.l][u.r][u.cnt][u.dir] << '\n';

		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:38: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

# 결과 실행 시간 메모리 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 4 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 5 ms 384 KB Output is correct
9 Correct 4 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 4 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

# 결과 실행 시간 메모리 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 4 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 5 ms 384 KB Output is correct
9 Correct 4 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 4 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 384 KB Output is correct
22 Correct 4 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 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 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 4 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 5 ms 384 KB Output is correct
9 Correct 4 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 4 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 1161 ms 105560 KB Output is correct
19 Correct 487 ms 50532 KB Output is correct
20 Correct 144 ms 20712 KB Output is correct
21 Correct 375 ms 46820 KB Output is correct
22 Correct 811 ms 72280 KB Output is correct
23 Correct 142 ms 17000 KB Output is correct
24 Correct 42 ms 11256 KB Output is correct
25 Correct 120 ms 16488 KB Output is correct
26 Correct 20 ms 3904 KB Output is correct
27 Correct 138 ms 17384 KB Output is correct
28 Correct 37 ms 10360 KB Output is correct
29 Correct 118 ms 17900 KB Output is correct
30 Correct 47 ms 12028 KB Output is correct
31 Correct 117 ms 16616 KB Output is correct
32 Correct 37 ms 6140 KB Output is correct
33 Correct 98 ms 14960 KB Output is correct
34 Correct 17 ms 3964 KB Output is correct
35 Correct 31 ms 13504 KB Output is correct
36 Correct 21 ms 5372 KB Output is correct
37 Correct 38 ms 15092 KB Output is correct
38 Correct 36 ms 6908 KB Output is correct
39 Correct 42 ms 15996 KB Output is correct
40 Correct 27 ms 7932 KB Output is correct
41 Execution timed out 2094 ms 152392 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 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 4 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 5 ms 384 KB Output is correct
9 Correct 4 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 4 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 384 KB Output is correct
22 Correct 4 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 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 1161 ms 105560 KB Output is correct
37 Correct 487 ms 50532 KB Output is correct
38 Correct 144 ms 20712 KB Output is correct
39 Correct 375 ms 46820 KB Output is correct
40 Correct 811 ms 72280 KB Output is correct
41 Correct 142 ms 17000 KB Output is correct
42 Correct 42 ms 11256 KB Output is correct
43 Correct 120 ms 16488 KB Output is correct
44 Correct 20 ms 3904 KB Output is correct
45 Correct 138 ms 17384 KB Output is correct
46 Correct 37 ms 10360 KB Output is correct
47 Correct 118 ms 17900 KB Output is correct
48 Correct 47 ms 12028 KB Output is correct
49 Correct 117 ms 16616 KB Output is correct
50 Correct 37 ms 6140 KB Output is correct
51 Correct 98 ms 14960 KB Output is correct
52 Correct 17 ms 3964 KB Output is correct
53 Correct 31 ms 13504 KB Output is correct
54 Correct 21 ms 5372 KB Output is correct
55 Correct 38 ms 15092 KB Output is correct
56 Correct 36 ms 6908 KB Output is correct
57 Correct 42 ms 15996 KB Output is correct
58 Correct 27 ms 7932 KB Output is correct
59 Execution timed out 2094 ms 152392 KB Time limit exceeded
60 Halted 0 ms 0 KB -