# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1229823 | santi3223 | Nile (IOI24_nile) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.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 biggest_stadium(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 = biggest_stadium(a, b, c, d);
ff(i, 0, n){
cout << x[i] << " ";
}
}
*/