Submission #1172261

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172261		_ncng.nyr	Nile (IOI24_nile)	C++20	6 / 100	20 ms	4936 KiB

nile

#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
const long long oo = 1e16;

int n, q;
long long a[N], b[N], w[N];

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

    n = W.size();
    for(int i = 1; i <= n; ++i) w[i] = W[i - 1], a[i] = A[i - 1], b[i] = B[i - 1];
    vector<long long> ans;

    for(auto D : E) {
      long long res = 0;
      for(int i = 1; i <= n; ++i) res += b[i];

      if(n & 1) {
        long long sub = oo;
        for(int i = 1; i <= n; ++i) sub = min(sub, a[i] - b[i]);
        res += sub;
      }

      ans.push_back(res);
    }

  return ans;
}

//#define ntc
#ifdef ntc
int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if(fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  if(fopen("NILE.inp", "r")) {
    freopen("NILE.inp", "r", stdin);
    freopen("NILE.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<long long> ans = calculate_costs(W, A, B, E);
  for(auto x : ans) cout << x << '\n';
}
#endif

• 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