oj.uz

Submission #748447

# Submission time Handle Problem Language Result Execution time Memory
748447 2023-05-26T09:47:39 Z QwertyPi Catfish Farm (IOI22_fish) C++17
14 / 100
 130 ms 44572 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;

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

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

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

long long dp[501][501][501];

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 <= 10; j++){
			for(int k = 0; k <= 10; k++){
				dp[i][j][k] = -(1LL << 60);
			}
		}
	}
	
	dp[0][0][0] = 0;
	for(int x = 0; x < N; x++){
		for(int y1 = 0; y1 <= 10; y1++){
			for(int y2 = 0; y2 <= 10; y2++){
				for(int y3 = 0; y3 <= 10; y3++){
					dp[x + 1][y2][y3] = max(dp[x + 1][y2][y3], dp[x][y1][y2] + f(x, y1, y2, y3));
				}
			}
		}
	}
	
	long long ans = 0;
	for(int y1 = 0; y1 <= 10; y1++){
		for(int y2 = 0; y2 <= 10; y2++){
			ans = max(ans, dp[N][y1][y2]);
		}
	}
	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:40: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]
   40 |   for(int j = 1; j < fish[i].size(); j++){
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 69 ms 41352 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Runtime error 130 ms 44572 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 38076 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 2756 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2724 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 12 ms 9788 KB Output is correct
10 Correct 23 ms 16852 KB Output is correct
11 Correct 13 ms 9812 KB Output is correct
12 Correct 23 ms 16820 KB Output is correct
13 Correct 5 ms 6228 KB Output is correct
14 Correct 16 ms 16852 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 2756 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2724 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 12 ms 9788 KB Output is correct
10 Correct 23 ms 16852 KB Output is correct
11 Correct 13 ms 9812 KB Output is correct
12 Correct 23 ms 16820 KB Output is correct
13 Correct 5 ms 6228 KB Output is correct
14 Correct 16 ms 16852 KB Output is correct
15 Incorrect 15 ms 16724 KB 1st lines differ - on the 1st token, expected: '299', found: '10'
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 2756 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2724 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 12 ms 9788 KB Output is correct
10 Correct 23 ms 16852 KB Output is correct
11 Correct 13 ms 9812 KB Output is correct
12 Correct 23 ms 16820 KB Output is correct
13 Correct 5 ms 6228 KB Output is correct
14 Correct 16 ms 16852 KB Output is correct
15 Incorrect 15 ms 16724 KB 1st lines differ - on the 1st token, expected: '299', found: '10'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 38076 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 69 ms 41352 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -