제출 #1336066

#제출 시각아이디문제언어결과실행 시간메모리
1336066YSH2020메기 농장 (IOI22_fish)C++20
0 / 100
49 ms9012 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	long long pref[2][N+1];
	memset(pref,0,sizeof(pref));
	for (int i = 0; i < M; i++) {
		pref[X[i]][Y[i]+1]+=W[i];
	}
	for (int i = 1; i <= N; i++) {
		pref[0][i]+=pref[0][i-1];
		pref[1][i]+=pref[1][i-1];
	}
	if (N<3) return max(pref[0][N], pref[1][N]);
	long long ans=max(pref[0][N], pref[1][N]);
	for (int i = 1; i <= N; i++) {
		ans=max(ans,pref[0][i]+pref[1][N]-pref[1][i-1]);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...