Submission #700021

#TimeUsernameProblemLanguageResultExecution timeMemory
700021n1k메기 농장 (IOI22_fish)C++17
3 / 100
93 ms15568 KiB
#include <bits/stdc++.h>

#define ll long long
#define vt vector
#define pb push_back
#define ar array
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size()

using namespace std;

/*
 1. simplify
 2. add new elements
 3. brute force solution
 4. optimize
*/

// --- templates ---

// --- code ---


ll max_weights(int n, int m, vt<int> X, vt<int> Y, vt<int> W){
	vt<ll> a(n);
	ll s = 0;
	for(int i = 0; i < m; i++){
		a[X[i]] += W[i];
		s += W[i];
	}
	vt<ll> dp(n);
	for(int i = 0; i < n; i++){
		dp[i] = max((i ? a[i - 1] : 0) + (i >= 2 ? dp[i - 2] : 0) + (i == n - 2 ? a[i + 1] : 0), 
					(i ? dp[i - 1] : 0));
	} 
	return s;
}
#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...