Submission #1169481

#TimeUsernameProblemLanguageResultExecution timeMemory
1169481rayan_bdNile (IOI24_nile)C++20
0 / 100
18 ms3400 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long

vector<ll> calculate_costs(vector<int> W,vector<int> A,vector<int> B,vector<int> E){

	vector<ll> ans;

	int N = W.size(),mn_a=0;

	ll tot=0;

	for(int i=0;i<N;++i){
		if(A[mn_a]>A[i]) mn_a=i;
		tot+=B[i];
	}

	if(N&1^1) tot=A[mn_a]-B[mn_a];

	ans.resize(N,tot);

	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...