# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1172204 | ntcnng_ | 나일강 (IOI24_nile) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5,
oo = 1e16;
int n, q;
int w[N], a[N], b[N];
vector<int> calculate_costs(
vector<int> W, vector<int> A,
vector<int> B, vector<int> E) {
for(int i = 1; i <= n; ++i) w[i] = W[i - 1], a[i] = A[i - 1], b[i] = B[i - 1];
vector<int> ans;
for(auto D : E) {
int res = 0;
for(int i = 1; i <= n; ++i) res += b[i];
if(n & 1) {
int sub = -oo;
for(int i = 1; i <= n; ++i) sub = max(sub, a[i] - b[i]);
res -= sub;
}
ans.push_back(res);
}
return ans;
}
#ifdef LaFlame
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if(fopen("v.inp", "r")) {
freopen("v.inp", "r", stdin);
freopen("v.out", "w", stdout);
}
vector<int> W, A, B, E;
cin >> n;
for(int i = 1; i <= n; ++i) {
int w, a, b; cin >> w >> a >> b;
W.push_back(w); A.push_back(a); B.push_back(b);
}
cin >> q;
for(int i = 1; i <= q; ++i) {
int D; cin >> D;
E.push_back(D);
}
vector<int> ans = calculate_costs(W, A, B, E);
for(auto x : ans) cout << x << '\n';
}
#endif