Submission #1348114

#TimeUsernameProblemLanguageResultExecution timeMemory
1348114jahinahnaf나일강 (IOI24_nile)C++20
0 / 100
13 ms2608 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long int;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vpii = vector<pair<int,int>>;

#define pb push_back
#define endl '\n'
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
const ll MOD = 10e9;

vector<long long> calculate_costs(vi W, vi A, vi B, vi Q){
	ll n = W.size();
	vector<long long> result(Q.size());
	ll res = 0;
	if (n % 2 == 0){
	for (int i = 0; i < n; i++){
		res += B[i];
	}

	for (auto &x : result) x = res;
	return result;
}
	else {
		ll extra = *min_element(all(A));

		for (int i = 0; i < n; i++){
			if (A[i] == extra) continue;
			else res += B[i];
		}
		res += extra;
		for (auto &x : result) x = res;
		return result;
	}
}
#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...