oj.uz

Submission #1057017

# Submission time Handle Problem Language Result Execution time Memory
1057017 2024-08-13T13:17:02 Z dozer Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 67916 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];
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);
		}
		if (done.count({i, N}) == 0){
			X.pb(i), Y.pb(N), W.pb(0);
		}
	}

	m = X.size();
	for (int i = 0; i < m; i++) v.pb({X[i] + 1, Y[i] + 1, 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] = start[i + 1];
		if (i + 2 <= n + 1) start[i] = max(start[i], start[i + 2] + pre[fish[i].back().nd] - pre[fish[i].front().nd - 1]);
		for (int j = 0; j < fish[i].size(); j++){
			int curr = fish[i][j].nd, h = fish[i][j].st;
			start[i] = max(start[i], dp[0][curr] + pre[fish[i].back().nd] - pre[curr - 1]);
		}

		if (i == n) continue; // hopefully??
		for (auto j : fish[i]){
			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;
				for (auto o : fish[i + 1]){
					if (o.st <= b){
						dp[0][k] = max(dp[0][k], pre[to2] - pre[o.nd - 1] + dp[0][o.nd]);
						assert(to2 >= o.nd - 1);
					}
				}
			}

			//todo : switch to increasing

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

			//todo : continue increasing
			for (auto o : fish[i + 1]){
				if (o.st >= b){
					int to = lower_bound(fish[i].begin(), fish[i].end(), make_pair(o.st, 0)) - fish[i].begin();
					to--;
					if (to >= 0){ 
						int to2 = fish[i][to].nd;
						dp[1][k] = max(dp[1][k], dp[1][o.nd] + pre[to2] - 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]);
		}
	}

	ll ans = start[1];
	for (int i = 1; i <= m; i++) {
		ans = max(ans, max(dp[0][i], dp[1][i]));
		//cout<<i<<sp<<x[i]<<sp<<y[i]<<sp<<w[i]<<" : "<<sp<<dp[0][i]<<sp<<dp[1][i]<<endl;
	}
	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:52: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]
   52 |   for (int j = 0; j < fish[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
fish.cpp:53:30: warning: unused variable 'h' [-Wunused-variable]
   53 |    int curr = fish[i][j].nd, h = fish[i][j].st;
      |                              ^
fish.cpp:60:8: warning: unused variable 'a' [-Wunused-variable]
   60 |    int a = x[k], b = y[k];
      |        ^

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 32820 KB Output is correct
2 Correct 91 ms 38404 KB Output is correct
3 Correct 19 ms 22972 KB Output is correct
4 Correct 19 ms 22936 KB Output is correct
5 Correct 235 ms 66784 KB Output is correct
6 Incorrect 290 ms 67916 KB 1st lines differ - on the 1st token, expected: '300000000000000', found: '300005000000000'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Execution timed out 1092 ms 45964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23740 KB Output is correct
2 Correct 23 ms 23016 KB Output is correct
3 Incorrect 55 ms 26908 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Incorrect 2 ms 8796 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '163629990745'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Incorrect 2 ms 8796 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '163629990745'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Incorrect 2 ms 8796 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '163629990745'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23740 KB Output is correct
2 Correct 23 ms 23016 KB Output is correct
3 Incorrect 55 ms 26908 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 32820 KB Output is correct
2 Correct 91 ms 38404 KB Output is correct
3 Correct 19 ms 22972 KB Output is correct
4 Correct 19 ms 22936 KB Output is correct
5 Correct 235 ms 66784 KB Output is correct
6 Incorrect 290 ms 67916 KB 1st lines differ - on the 1st token, expected: '300000000000000', found: '300005000000000'
7 Halted 0 ms 0 KB -