제출 #1156065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156065		nickolasarapidis	Nile (IOI24_nile)	C++20	0 / 100	19 ms	3908 KiB

nile

#include "nile.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

long N, Q;
ll ans = 0;

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

	for(long i = 0; i < N; i++){
		ans += B[i];
	}

	if(N%2 == 0){
		return vector<ll>(Q, ans);
	}
	else{
		long m = 1000000007;
		long x;
		for(long i = 0; i < N; i++){
			if(A[i] - B[i] < m){
				m = A[i] - B[i];
			}
		}
		ans += m;
		return vector<ll>(Q, ans);
	}
}

vector<ll> solve2(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
	return vector<ll>(Q, (ll)0);
}

vector<ll> solve3(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
	return vector<ll>(Q, (ll)0);
}

vector<ll> solve(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
	return vector<ll>(Q, (ll)0);
}

vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
	N = W.size(); Q = E.size();
	bool sub1 = true, sub2 = true, sub3 = true;
	for(long i = 0; i < N; i++){
		ans += B[i];
		if(W[i] != 1) sub1 = false;
		if(W[i] != i + 1) sub2 = false;
		if(A[i] != 2 or B[i] != 1) sub3 = false;
	}

	if(sub1) return solve1(W, A, B, E);
	else if(sub2) return solve2(W, A, B, E);
	else if(sub3) return solve3(W, A, B, E);
	else return solve(W, A, B, E);
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18