Submission #657518

#	Time	Username	Problem	Language	Result	Execution time	Memory
657518		sentheta	Catfish Farm (IOI22_fish)	C++17	37 / 100	1096 ms	98252 KiB

fish

#include "fish.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

#define rand() (uniform_int_distribution<int>(0,1<<30)(rng))
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;

const Int N = 2e5+5;

Int n, m;
V<Int> x, y, w;

V<pii> g[N];
Int dp[N][10][10];

Int max_weights(int _n,int _m,V<int> _x,V<int> _y,V<int> _w){
	n = _n; m = _m;
	x = V<Int>(all(_x)); y = V<Int>(all(_y)); w = V<Int>(all(_w));

	rep(i,0,m){
		g[x[i]].push_back({y[i], w[i]});
		// dbg(x[i]);
		// c[x[i]] = w[i];
	}
	rep(i,0,n){
		sort(all(g[i]));
		g[i].push_back({n, 0});

		// dbg(i);
		// for(auto[j,k] : g[i]) cout << j _ k << nl;
	}
	// cout << nl;

	rep(i,1,n){
		// dbg(i);

		rep(p,0,i==1 ? 1:g[i-2].size()) rep(q,0,g[i-1].size())
		rep(r,0,g[i].size()){
			Int cost = dp[i-1][p][q];

			int pp = i==1 ? 0:g[i-2][p].ff;
			int qq = g[i-1][q].ff;
			int rr = g[i][r].ff;
			// dbg(pp); dbg(qq); dbg(rr);

			rep(j,q,g[i-1].size())
			if(pp-1<g[i-1][j].ff && g[i-1][j].ff<=rr-1){
				cost += g[i-1][j].ss;
			}

			rep(j,r,g[i].size())
			if(g[i][j].ff <= qq-1){
				cost += g[i][j].ss;
			}
			// dbg(cost);
			// cout << nl;

			dp[i][q][r] = max(dp[i][q][r], cost);
		}
	}

	// dbg(dp[1][0][0]);
	// dbg(dp[1][0][1]);
	// dbg(dp[1][1][0]);
	// dbg(dp[1][1][1]);

	Int ans = 0;
	rep(p,0,g[n-2].size()) rep(q,0,g[n-1].size()){
		ans = max(ans, dp[n-1][p][q]);
	}
	return ans;




	return 0;
}

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