제출 #1247562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247562		lovrot	Catfish Farm (IOI22_fish)	C++20	3 / 100	47 ms	8776 KiB

fish

#define db(...) fprintf(stderr, __VA_ARGS__)
#include "fish.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <vector>
#include <queue>

#define X first
#define Y second
#define PB push_back

using namespace std; 

typedef long long ll;
typedef pair<int, int> pii;

const int N = 1e5 + 10;
const ll OO = 1e18;

int n, m;
ll a[N];
ll dp[N];

ll max_weights(int nn, int mm, vector<int> xx, vector<int> yy, vector<int> ww) {
	n = nn;
	m = mm;

	for(int i = 0; i < m; ++i) { 
		a[xx[i]] += ww[i];
	}

	for(int i = n - 1; i >= 0; --i) { 
		dp[i] = dp[i + 2] + a[i + 1];
		if(i + 3 < n) { 
			dp[i] = max(dp[i + 2] + a[i + 1], dp[i + 3] + a[i + 1] + a[i + 2]);
		}
	}
	return max(dp[0], a[0] + dp[1]); 
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 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