제출 #1229824

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1229824		santi3223	나일강 (IOI24_nile)	C++20	6 / 100	22 ms	2632 KiB

nile

#include <bits/stdc++.h>
#include "nile.h"
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 998244353;

vl calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e){
	ll n = w.size();
	ll suma = 0;
	ff(i, 0, n){
	    suma += b[i];
	}
	ll suma2 = LLONG_MAX;
	ff(i, 0, n){
	    ll cur = suma-b[i]+a[i];
	    if(cur < suma2){
	        suma2 = cur;
	    }
	}
	ll ans = suma2;
	if(n % 2 == 0){
	    ans = suma;
	}
	vl x(e.size(), ans);
	return x;
}
/*
int main(){
	ll n, q;
	cin >> n;
	vector<int> a(n), b(n), c(n);
	ff(i, 0, n){
	    cin >> a[i] >> b[i] >> c[i];
	}
	cin >> q;
	vector<int> d(q);
	ff(i, 0, n){
	    cin >> d[i];
	}
	vl x = calculate_costs(a, b, c, d);
	ff(i, 0, n){
	    cout << x[i] << " ";
	}
}
*/

• Subtask 0: 0 / 0
• Subtask 1: 6 / 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