oj.uz

Submission #748469

# Submission time Handle Problem Language Result Execution time Memory
748469 2023-05-26T10:34:35 Z QwertyPi Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 1118544 KB 
#include "fish.h"
#include <bits/stdc++.h>

#define pii pair<int, int>
#define fi first
#define se second
using namespace std;

const int N_MAX = 1e5 + 11;
const int INC = 0;
const int DEC = 1;
const int ZERO = 2;

vector<pair<int, long long>> fish[N_MAX];
int N;

void chmax(long long& x, long long y){
	x = max(x, y);
}

map<long long, long long> MSG;

long long id(int x, int y){
	return ((long long) x << 32) + y;
}

long long g(int x, int y){ // [x, x] times [0, y)
	if(x < 0 || x >= N) return 0;
	if(MSG[id(x, y)]) return MSG[id(x, y)];
	auto ptr = lower_bound(fish[x].begin(), fish[x].end(), pair<int, long long>{y, -1LL});
	if(ptr == fish[x].begin()) return MSG[id(x, y)] = 0;
	return MSG[id(x, y)] = (--ptr)->se;
}

long long f(int x, int y0, int y1, int y2){ // (x - 1, y1) -> (x, y2) transition
	return g(x + 1, y2) + g(x - 1, y2) - g(x, min(y1, y2)) - g(x - 1, min(y2, max(y0, y1)));
}

long long dp[3][5001][5001];

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	::N = N;
	for(int i = 0; i < M; i++){
		fish[X[i]].push_back({Y[i], W[i]});
	}
	for(int i = 0; i < N; i++){
		sort(fish[i].begin(), fish[i].end());
		for(int j = 1; j < fish[i].size(); j++){
			fish[i][j].se += fish[i][j - 1].se;
		}
	}
	
	for(int i = 0; i <= N; i++){
		for(int j = 0; j <= N; j++){
			dp[0][i][j] = dp[1][i][j] = dp[2][i][j] = -(1LL << 60); 
		}
	}
	
	dp[ZERO][0][0] = 0;
	for(int x = 0; x < N; x++){
		// ZERO
		for(int y = 0; y <= N; y++){
			chmax(dp[ZERO][x + 1][y], dp[INC][x][y]);
			chmax(dp[ZERO][x + 1][y], dp[DEC][x][y]);
			chmax(dp[ZERO][x + 1][0], dp[ZERO][x][y]);
		}
		
		// INC
		for(int y1 = 0; y1 <= N; y1++){
			for(int y2 = y1; y2 <= N; y2++){
				chmax(dp[INC][x + 1][y2], dp[INC][x][y1] + g(x + 1, y2) - g(x, y1) + g(x - 1, y2) - g(x - 1, y1));
				chmax(dp[INC][x + 1][y2], dp[ZERO][x][y1] + g(x + 1, y2) + g(x - 1, y2) - g(x - 1, min(y2, y1)));
			}
		}
		
		// DEC
		for(int y1 = 0; y1 <= N; y1++){
			for(int y2 = 0; y2 <= y1; y2++){
				chmax(dp[DEC][x + 1][y2], dp[DEC][x][y1] + g(x + 1, y2) - g(x, y2));
				chmax(dp[DEC][x + 1][y2], dp[INC][x][y1] + g(x + 1, y2) - g(x, y2));
			}
		}
	}
	
	/*
	for(int k = 0; k < 3; k++){
		for(int x = 0; x <= N; x++){
			for(int y = 0; y <= N; y++){
				cout << dp[k][x][y] << ' ';
			}
			cout << endl;
		}
		cout << endl;
	}
	*/
	
	long long ans = 0;
	for(int k = 0; k < 3; k++){
		for(int y = 0; y <= N; y++){
			ans = max(ans, dp[k][N][y]);
		}
	}
	return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int j = 1; j < fish[i].size(); j++){
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 1118544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1114 ms 1117016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Execution timed out 1087 ms 5896 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Execution timed out 1087 ms 5896 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Execution timed out 1087 ms 5896 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1114 ms 1117016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 1118544 KB Time limit exceeded
2 Halted 0 ms 0 KB -