Submission #1222458

#TimeUsernameProblemLanguageResultExecution timeMemory
1222458chinesegenius69420Nile (IOI24_nile)C++20
6 / 100
17 ms2632 KiB
#include "nile.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
	int n = w.size();
	ll sumb = accumulate(b.begin(), b.end(), 0ll);
	if(n % 2){
		ll minans = LLONG_MAX;
		for(int i = 0; i < n; i++){
			minans = min(minans, sumb - b[i] + a[i]);
		}
		return vector<ll>(e.size(), minans);
	}
	return vector<ll>(e.size(), sumb);
}
#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...