제출 #748447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
748447		QwertyPi	Catfish Farm (IOI22_fish)	C++17	14 / 100	130 ms	44572 KiB

fish

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 14 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16