oj.uz

답안 #1057189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057189 2024-08-13T14:54:19 Z dozer 메기 농장 (IOI22_fish) C++17
67 / 100
 232 ms 70732 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define ll long long
#define LL node * 2
#define RR node * 2 + 1
#define MAXN 300005

const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;


ll start[MAXN], dp[2][MAXN];
ll pref[MAXN], suff[MAXN];

vector<pii> fish[MAXN];


long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	int n = N, m = M;
	vector<array<int, 3>> v;
	map<pii, int> done;
	for (int i = 0; i < m; i++) done[{X[i], Y[i]}] = 1;
	for (int i = 0; i < n; i++){
		if (done.count({i, 0}) == 0){
			X.pb(i), Y.pb(0), W.pb(0);
		}
	}

	m = X.size();
	for (int i = 0; i < m; i++) v.pb({X[i] + 1, Y[i], W[i]});
	sort(v.begin(), v.end());
    vector<int> x(m + 5), y(m + 5), w(m + 5);
    for (int i = 1; i <= m; i++) x[i] = v[i - 1][0], y[i] = v[i - 1][1], w[i] = v[i - 1][2];
    for (int i = 1; i <= m; i++) fish[x[i]].pb({y[i], i});

    vector<ll> pre(m + 5, 0);
	for (int i = 1; i <= m; i++) pre[i] = pre[i - 1] + w[i];

	for (int i = n; i >= 1; i--){
		start[i] = max(start[i + 1], start[i + 2] + pre[fish[i].back().nd] - pre[fish[i].front().nd - 1]);

		if (i == n) {
			for (auto j : fish[i]){
				int k = j.nd, b = j.st;
				pref[k] = -pre[k - 1];
				int tmp = lower_bound(fish[i - 1].begin(), fish[i - 1].end(), make_pair(b, 0)) - fish[i - 1].begin();
				tmp--;
				if (tmp >= 0){
					int to2 = fish[i - 1][tmp].nd;
					suff[k] = dp[1][k] + pre[to2];
				}

				for (int j = fish[i].front().nd + 1; j <= fish[i].back().nd; j++) pref[j] = max(pref[j - 1], pref[j]);
				for (int j = fish[i].back().nd - 1; j >= fish[i].front().nd; j--) suff[j] = max(suff[j], suff[j + 1]);
			}
			continue;
		}


		for (auto J = 0; J < fish[i].size(); J++){
			pii j = fish[i][J];
			int k = j.nd;
			int a = x[k], b = y[k];

			//todo : continue decreasing

			int to = lower_bound(fish[i + 1].begin(), fish[i + 1].end(), make_pair(b, 0)) - fish[i + 1].begin();
			to--;
			if (to >= 0){
				int to2 = fish[i + 1][to].nd;
				int gh = lower_bound(fish[i + 1].begin(), fish[i + 1].end(), make_pair(b + 1, 0)) - fish[i + 1].begin();
				gh--;
				if (gh >= 0){
					dp[0][k] = max(dp[0][k], pref[fish[i + 1][gh].nd] + pre[to2]);
				}
			}

			//todo : switch to increasing

			if (b == 0){
				dp[0][k] = max(dp[0][k], dp[1][fish[i + 1].front().nd]);
			}

			//////////////////////////////////////////

			//todo : continue increasing
			int gh = lower_bound(fish[i + 1].begin(), fish[i + 1].end(), make_pair(b, 0)) - fish[i + 1].begin();
			if (gh != fish[i + 1].size()){
				dp[1][k] = max(dp[1][k], suff[fish[i + 1][gh].nd] - pre[k - 1]);

			}

			//todo : connect to full column
			dp[1][k] = max(dp[1][k], start[i + 2] + pre[fish[i].back().nd] - pre[k - 1]);


			/////////////////////////////////////////
			pref[k] = dp[0][k] - pre[k - 1];
			int tmp = lower_bound(fish[i - 1].begin(), fish[i - 1].end(), make_pair(b, 0)) - fish[i - 1].begin();
			tmp--;
			if (tmp >= 0){
				int to2 = fish[i - 1][tmp].nd;
				suff[k] = dp[1][k] + pre[to2];
			}
		}
		

		for (int j = 0; j < fish[i].size(); j++){
			int curr = fish[i][j].nd;
			start[i] = max(start[i], dp[0][curr] + pre[fish[i].back().nd] - pre[curr - 1]);
		}

		for (int j = fish[i].front().nd + 1; j <= fish[i].back().nd; j++) pref[j] = max(pref[j - 1], pref[j]);
		for (int j = fish[i].back().nd - 1; j >= fish[i].front().nd; j--) suff[j] = max(suff[j], suff[j + 1]);
	}


	ll ans = start[2];
	for (int i = 1; i <= m; i++) {
		//cout<<i<<sp<<x[i]<<sp<<y[i]<<sp<<w[i]<<" : "<<dp[0][i]<<sp<<dp[1][i]<<endl;
		ans = max(ans, max(dp[0][i], dp[1][i]));
	}
	return ans;
}

/*

int main() {
	fileio();
	int N, M;
	assert(2 == scanf("%d %d", &N, &M));

	std::vector<int> X(M), Y(M), W(M);
	for (int i = 0; i < M; ++i) {
		assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
	}

	long long result = max_weights(N, M, X, Y, W);
	printf("%lld\n", result);
	return 0;
}*/

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for (auto J = 0; J < fish[i].size(); J++){
      |                    ~~^~~~~~~~~~~~~~~~
fish.cpp:97:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |    if (gh != fish[i + 1].size()){
      |        ~~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:72:8: warning: unused variable 'a' [-Wunused-variable]
   72 |    int a = x[k], b = y[k];
      |        ^
fish.cpp:117:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |   for (int j = 0; j < fish[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 32536 KB Output is correct
2 Correct 67 ms 36664 KB Output is correct
3 Correct 12 ms 20552 KB Output is correct
4 Correct 12 ms 20552 KB Output is correct
5 Correct 213 ms 69748 KB Output is correct
6 Correct 229 ms 70732 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10840 KB Output is correct
2 Correct 114 ms 42640 KB Output is correct
3 Correct 148 ms 54420 KB Output is correct
4 Correct 58 ms 32516 KB Output is correct
5 Correct 68 ms 36660 KB Output is correct
6 Correct 2 ms 10840 KB Output is correct
7 Correct 1 ms 10844 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 1 ms 10844 KB Output is correct
10 Correct 11 ms 20600 KB Output is correct
11 Correct 12 ms 20548 KB Output is correct
12 Correct 54 ms 32816 KB Output is correct
13 Correct 70 ms 37272 KB Output is correct
14 Correct 58 ms 32624 KB Output is correct
15 Correct 67 ms 35104 KB Output is correct
16 Correct 58 ms 33816 KB Output is correct
17 Correct 63 ms 35116 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 20552 KB Output is correct
2 Correct 12 ms 20648 KB Output is correct
3 Correct 40 ms 24400 KB Output is correct
4 Correct 31 ms 23820 KB Output is correct
5 Correct 59 ms 29640 KB Output is correct
6 Correct 57 ms 28872 KB Output is correct
7 Correct 66 ms 29640 KB Output is correct
8 Correct 59 ms 29636 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 1 ms 10844 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 1 ms 10844 KB Output is correct
8 Correct 1 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 1 ms 10844 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 1 ms 10844 KB Output is correct
8 Correct 1 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10840 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 31 ms 18024 KB Output is correct
18 Correct 28 ms 18240 KB Output is correct
19 Correct 26 ms 18180 KB Output is correct
20 Correct 27 ms 18084 KB Output is correct
21 Correct 25 ms 18136 KB Output is correct
22 Correct 53 ms 25544 KB Output is correct
23 Correct 6 ms 12340 KB Output is correct
24 Correct 18 ms 15768 KB Output is correct
25 Correct 2 ms 11100 KB Output is correct
26 Correct 6 ms 12084 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 1 ms 10844 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 1 ms 10844 KB Output is correct
8 Correct 1 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10840 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 31 ms 18024 KB Output is correct
18 Correct 28 ms 18240 KB Output is correct
19 Correct 26 ms 18180 KB Output is correct
20 Correct 27 ms 18084 KB Output is correct
21 Correct 25 ms 18136 KB Output is correct
22 Correct 53 ms 25544 KB Output is correct
23 Correct 6 ms 12340 KB Output is correct
24 Correct 18 ms 15768 KB Output is correct
25 Correct 2 ms 11100 KB Output is correct
26 Correct 6 ms 12084 KB Output is correct
27 Correct 3 ms 11608 KB Output is correct
28 Correct 159 ms 46820 KB Output is correct
29 Correct 232 ms 62860 KB Output is correct
30 Incorrect 214 ms 61832 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102441475659060'
31 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 20552 KB Output is correct
2 Correct 12 ms 20648 KB Output is correct
3 Correct 40 ms 24400 KB Output is correct
4 Correct 31 ms 23820 KB Output is correct
5 Correct 59 ms 29640 KB Output is correct
6 Correct 57 ms 28872 KB Output is correct
7 Correct 66 ms 29640 KB Output is correct
8 Correct 59 ms 29636 KB Output is correct
9 Correct 84 ms 36148 KB Output is correct
10 Correct 62 ms 27848 KB Output is correct
11 Correct 135 ms 45764 KB Output is correct
12 Correct 1 ms 10844 KB Output is correct
13 Correct 1 ms 10868 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 1 ms 10844 KB Output is correct
16 Correct 1 ms 10844 KB Output is correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 12 ms 20552 KB Output is correct
19 Correct 11 ms 20704 KB Output is correct
20 Correct 11 ms 20568 KB Output is correct
21 Correct 11 ms 20552 KB Output is correct
22 Correct 88 ms 36972 KB Output is correct
23 Correct 149 ms 54172 KB Output is correct
24 Correct 147 ms 54168 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 32536 KB Output is correct
2 Correct 67 ms 36664 KB Output is correct
3 Correct 12 ms 20552 KB Output is correct
4 Correct 12 ms 20552 KB Output is correct
5 Correct 213 ms 69748 KB Output is correct
6 Correct 229 ms 70732 KB Output is correct
7 Correct 1 ms 10840 KB Output is correct
8 Correct 114 ms 42640 KB Output is correct
9 Correct 148 ms 54420 KB Output is correct
10 Correct 58 ms 32516 KB Output is correct
11 Correct 68 ms 36660 KB Output is correct
12 Correct 2 ms 10840 KB Output is correct
13 Correct 1 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 1 ms 10844 KB Output is correct
16 Correct 11 ms 20600 KB Output is correct
17 Correct 12 ms 20548 KB Output is correct
18 Correct 54 ms 32816 KB Output is correct
19 Correct 70 ms 37272 KB Output is correct
20 Correct 58 ms 32624 KB Output is correct
21 Correct 67 ms 35104 KB Output is correct
22 Correct 58 ms 33816 KB Output is correct
23 Correct 63 ms 35116 KB Output is correct
24 Correct 14 ms 20552 KB Output is correct
25 Correct 12 ms 20648 KB Output is correct
26 Correct 40 ms 24400 KB Output is correct
27 Correct 31 ms 23820 KB Output is correct
28 Correct 59 ms 29640 KB Output is correct
29 Correct 57 ms 28872 KB Output is correct
30 Correct 66 ms 29640 KB Output is correct
31 Correct 59 ms 29636 KB Output is correct
32 Correct 2 ms 10844 KB Output is correct
33 Correct 1 ms 10844 KB Output is correct
34 Correct 1 ms 10844 KB Output is correct
35 Correct 1 ms 10844 KB Output is correct
36 Correct 1 ms 10844 KB Output is correct
37 Correct 1 ms 10844 KB Output is correct
38 Correct 1 ms 10844 KB Output is correct
39 Correct 1 ms 10844 KB Output is correct
40 Correct 2 ms 10844 KB Output is correct
41 Correct 2 ms 11100 KB Output is correct
42 Correct 2 ms 10844 KB Output is correct
43 Correct 2 ms 11100 KB Output is correct
44 Correct 2 ms 10844 KB Output is correct
45 Correct 2 ms 10844 KB Output is correct
46 Correct 2 ms 10840 KB Output is correct
47 Correct 2 ms 11100 KB Output is correct
48 Correct 31 ms 18024 KB Output is correct
49 Correct 28 ms 18240 KB Output is correct
50 Correct 26 ms 18180 KB Output is correct
51 Correct 27 ms 18084 KB Output is correct
52 Correct 25 ms 18136 KB Output is correct
53 Correct 53 ms 25544 KB Output is correct
54 Correct 6 ms 12340 KB Output is correct
55 Correct 18 ms 15768 KB Output is correct
56 Correct 2 ms 11100 KB Output is correct
57 Correct 6 ms 12084 KB Output is correct
58 Correct 3 ms 11608 KB Output is correct
59 Correct 159 ms 46820 KB Output is correct
60 Correct 232 ms 62860 KB Output is correct
61 Incorrect 214 ms 61832 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102441475659060'
62 Halted 0 ms 0 KB -