Submission #1348203

#TimeUsernameProblemLanguageResultExecution timeMemory
1348203jahinahnafNile (IOI24_nile)C++20
13 / 100
23 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());
	for (int k = 0; k < Q.size(); k++){
		ll res = 0;
		for (int i = 0; i < n; i++){
				res += B[i];
			}
		if (n % 2 == 0){
			result[k] = res;
			continue;
		}
		else if (Q[k] > 1) {
			ll extra = 1e18;
			for (int i = 0; i < n; i++){
				extra = min(extra, 1LL*A[i]-B[i]);
			}
			res += extra;
		}
		else if (Q[k] == 1) {
			ll extra = 1e18;
			for (int i = 0; i < n; i += 2){
				extra = min(extra, 1LL*(A[i]-B[i]));
			}
			res += extra;
		}
		result[k] = 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...