답안 #666696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
666696	2022-11-29T11:28:18 Z	flappybird	메기 농장 (IOI22_fish)	C++17	18 / 100	160 ms	21928 KB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define MAX 302020
typedef long long ll;
typedef pair<int, int> pii;

ll tdp[MAX]; // full dp
ll bdp[MAX]; // zero dp

vector<pii> locs[MAX];

struct bit {
	int N;
	bool rev;
	vector<ll> tree;
	bit(int N, bool rev) :N(N + 2), rev(rev) { tree = vector<ll>(N + 3, -1e18); }
	void upd(int i, ll v) {
		if (!(0 <= i && i < N)) return;
		if (rev) i = N - i - 1;
		i++;
		while (i <= N) {
			tree[i] = max(tree[i], v);
			i += i & -i;
		}
	}
	ll get(int i) {
		if (!(0 <= i && i < N)) return -1e18;
		if (rev) i = N - i - 1;
		i++;
		ll ans = -1e18;
		while (i) {
			ans = max(ans, tree[i]);
			i -= i & -i;
		}
		return ans;
	}
};

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	int i;
	for (auto& v : X) v++;
	for (auto& v : Y) v++;
	for (i = 0; i < M; i++) locs[X[i]].emplace_back(Y[i], W[i]);
	for (i = 0; i < N; i++) if (locs[i].size()) sort(locs[i].begin(), locs[i].end());
	bit fenu(N + 1, false), fend(N + 1, true);
	fenu.upd(0, 0);
	for (i = 1; i <= N; i++) {
		if (i > 2) fend.upd(N + 1, tdp[i - 2]);
		if (i > 1) fenu.upd(0, bdp[i - 1]);
		if (i > 1) fend.upd(N + 1, 0);
		for (auto& [y, w] : locs[i]) fenu.upd(y, fenu.get(y - 1) + w);
		tdp[i] = fenu.get(N);
		for (int j = locs[i].size() - 1; j >= 0; j--) {
			ll y = locs[i][j].first;
			ll w = locs[i][j].second;
			fend.upd(y, fend.get(y + 1) + w);
		}
		bdp[i] = fend.get(1);
		ll sum = 0;
		for (auto& v : locs[i]) sum += v.second;
		tdp[i] = max(tdp[i], sum + tdp[i - 2]);
	}
	ll ans = fend.get(1);
	for (i = 1; i < N; i++) ans = max(ans, tdp[i]);
	return ans;
}

Subtask #1
3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	12764 KB	Output is correct
2	Correct	68 ms	13692 KB	Output is correct
3	Correct	18 ms	10452 KB	Output is correct
4	Correct	17 ms	10504 KB	Output is correct
5	Correct	145 ms	20108 KB	Output is correct
6	Correct	160 ms	21928 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	7364 KB	Output is correct
2	Correct	90 ms	18152 KB	Output is correct
3	Correct	111 ms	20476 KB	Output is correct
4	Correct	61 ms	14216 KB	Output is correct
5	Correct	59 ms	15476 KB	Output is correct
6	Correct	4 ms	7508 KB	Output is correct
7	Correct	6 ms	7408 KB	Output is correct
8	Correct	4 ms	7404 KB	Output is correct
9	Correct	5 ms	7380 KB	Output is correct
10	Correct	18 ms	10480 KB	Output is correct
11	Correct	20 ms	10448 KB	Output is correct
12	Correct	51 ms	14312 KB	Output is correct
13	Correct	64 ms	15460 KB	Output is correct
14	Correct	54 ms	14228 KB	Output is correct
15	Correct	58 ms	15096 KB	Output is correct
16	Correct	55 ms	14340 KB	Output is correct
17	Correct	59 ms	15096 KB	Output is correct

Subtask #3
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	10520 KB	Output is correct
2	Correct	18 ms	10512 KB	Output is correct
3	Correct	38 ms	13116 KB	Output is correct
4	Correct	34 ms	12480 KB	Output is correct
5	Correct	75 ms	16136 KB	Output is correct
6	Correct	58 ms	16140 KB	Output is correct
7	Correct	69 ms	16000 KB	Output is correct
8	Correct	68 ms	16008 KB	Output is correct

Subtask #4
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	7380 KB	Output is correct
2	Correct	4 ms	7380 KB	Output is correct
3	Correct	4 ms	7380 KB	Output is correct
4	Correct	4 ms	7380 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	5 ms	7380 KB	Output is correct
7	Correct	4 ms	7380 KB	Output is correct
8	Correct	4 ms	7316 KB	Output is correct
9	Incorrect	5 ms	7380 KB	1st lines differ - on the 1st token, expected: '216624184325', found: '216366270048'
10	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	7380 KB	Output is correct
2	Correct	4 ms	7380 KB	Output is correct
3	Correct	4 ms	7380 KB	Output is correct
4	Correct	4 ms	7380 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	5 ms	7380 KB	Output is correct
7	Correct	4 ms	7380 KB	Output is correct
8	Correct	4 ms	7316 KB	Output is correct
9	Incorrect	5 ms	7380 KB	1st lines differ - on the 1st token, expected: '216624184325', found: '216366270048'
10	Halted	0 ms	0 KB	-

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	7380 KB	Output is correct
2	Correct	4 ms	7380 KB	Output is correct
3	Correct	4 ms	7380 KB	Output is correct
4	Correct	4 ms	7380 KB	Output is correct
5	Correct	4 ms	7380 KB	Output is correct
6	Correct	5 ms	7380 KB	Output is correct
7	Correct	4 ms	7380 KB	Output is correct
8	Correct	4 ms	7316 KB	Output is correct
9	Incorrect	5 ms	7380 KB	1st lines differ - on the 1st token, expected: '216624184325', found: '216366270048'
10	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	10520 KB	Output is correct
2	Correct	18 ms	10512 KB	Output is correct
3	Correct	38 ms	13116 KB	Output is correct
4	Correct	34 ms	12480 KB	Output is correct
5	Correct	75 ms	16136 KB	Output is correct
6	Correct	58 ms	16140 KB	Output is correct
7	Correct	69 ms	16000 KB	Output is correct
8	Correct	68 ms	16008 KB	Output is correct
9	Correct	71 ms	15952 KB	Output is correct
10	Correct	70 ms	14532 KB	Output is correct
11	Correct	106 ms	21840 KB	Output is correct
12	Correct	5 ms	7404 KB	Output is correct
13	Correct	5 ms	7380 KB	Output is correct
14	Correct	4 ms	7316 KB	Output is correct
15	Correct	4 ms	7412 KB	Output is correct
16	Correct	5 ms	7380 KB	Output is correct
17	Correct	4 ms	7380 KB	Output is correct
18	Correct	17 ms	10476 KB	Output is correct
19	Correct	17 ms	10500 KB	Output is correct
20	Correct	17 ms	10484 KB	Output is correct
21	Correct	17 ms	10452 KB	Output is correct
22	Incorrect	67 ms	17012 KB	1st lines differ - on the 1st token, expected: '45561826463480', found: '45561636063706'
23	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	12764 KB	Output is correct
2	Correct	68 ms	13692 KB	Output is correct
3	Correct	18 ms	10452 KB	Output is correct
4	Correct	17 ms	10504 KB	Output is correct
5	Correct	145 ms	20108 KB	Output is correct
6	Correct	160 ms	21928 KB	Output is correct
7	Correct	5 ms	7364 KB	Output is correct
8	Correct	90 ms	18152 KB	Output is correct
9	Correct	111 ms	20476 KB	Output is correct
10	Correct	61 ms	14216 KB	Output is correct
11	Correct	59 ms	15476 KB	Output is correct
12	Correct	4 ms	7508 KB	Output is correct
13	Correct	6 ms	7408 KB	Output is correct
14	Correct	4 ms	7404 KB	Output is correct
15	Correct	5 ms	7380 KB	Output is correct
16	Correct	18 ms	10480 KB	Output is correct
17	Correct	20 ms	10448 KB	Output is correct
18	Correct	51 ms	14312 KB	Output is correct
19	Correct	64 ms	15460 KB	Output is correct
20	Correct	54 ms	14228 KB	Output is correct
21	Correct	58 ms	15096 KB	Output is correct
22	Correct	55 ms	14340 KB	Output is correct
23	Correct	59 ms	15096 KB	Output is correct
24	Correct	18 ms	10520 KB	Output is correct
25	Correct	18 ms	10512 KB	Output is correct
26	Correct	38 ms	13116 KB	Output is correct
27	Correct	34 ms	12480 KB	Output is correct
28	Correct	75 ms	16136 KB	Output is correct
29	Correct	58 ms	16140 KB	Output is correct
30	Correct	69 ms	16000 KB	Output is correct
31	Correct	68 ms	16008 KB	Output is correct
32	Correct	4 ms	7380 KB	Output is correct
33	Correct	4 ms	7380 KB	Output is correct
34	Correct	4 ms	7380 KB	Output is correct
35	Correct	4 ms	7380 KB	Output is correct
36	Correct	4 ms	7380 KB	Output is correct
37	Correct	5 ms	7380 KB	Output is correct
38	Correct	4 ms	7380 KB	Output is correct
39	Correct	4 ms	7316 KB	Output is correct
40	Incorrect	5 ms	7380 KB	1st lines differ - on the 1st token, expected: '216624184325', found: '216366270048'
41	Halted	0 ms	0 KB	-

답안 #666696

Compilation message