제출 #1239847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239847		nikulid	Catfish Farm (IOI22_fish)	C++20	6 / 100	48 ms	8008 KiB

fish

#include "fish.h"

#include <vector>

using namespace std;

#define ll long long

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	ll rightsum=0, leftsum=0;;
	vector<int> left(N, 0), right(N, 0); // v[0] = bottom, ...

	for(int i=0; i<M; i++){
		if(X[i]==0){
			left[Y[i]] = W[i];
			leftsum += W[i];
		} else{
			right[Y[i]] = W[i];
			rightsum += W[i];
		}
	}
	
	if(N==2) return max(leftsum,rightsum);
	// we could place a pier on the right (x=2 / third column)...
	ll cur_val = rightsum;
	ll answer = cur_val;
	for(int y=0; y<N; y++){
		// what if we built a pier on the 2nd column which has height y+1?
		cur_val -= right[y];
		cur_val += left[y];
		answer = max(answer, cur_val);
	}
	return answer;
}

• Subtask 1: 0 / 3
• Subtask 2: 6 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16