Submission #1305483

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305483		vtnoo	메기 농장 (IOI22_fish)	C++20	0 / 100	12 ms	2112 KiB

fish

#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,pao=b;i<pao;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
const int MAXN=300,MAXY=8+1;
int dp[MAXN][MAXY],pref[MAXN][MAXY];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
	int lim=*max_element(ALL(Y))+1;
	fore(i,0,M){
		pref[X[i]][Y[i]+1]=W[i];
	}
	fore(i,0,N){
		fore(j,1,lim+1){
			pref[i][j]+=pref[i][j-1];
		}
	}
	fore(i,1,N){
		fore(a,0,lim+1){
			fore(b,0,lim+1){
				fore(c,0,lim+1){
					if(a>b)dp[i][a]=max(dp[i][a],dp[i-1][b]+pref[i][a]-pref[i][b]);
					else dp[i][a]=max(dp[i][a],dp[i-1][b]+pref[i][lim]-pref[i][a]);
					if(i!=1){
						int mx=max(c,a);
						if(b<mx)dp[i][a]=max(dp[i][a],dp[i-2][c]+(pref[i-1][mx]-pref[i-1][b]));
					}
				}
			}
		}
	}
	return *max_element(dp[N-1],dp[N-1]+MAXN);
}

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