Submission #21101186

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll N; cin >> N;
  vector<ll> A(N), T(N);
  for (ll i = 0; i < N; i++) {
    cin >> A[i] >> T[i];
  }

  ll Q; cin >> Q;
  ll low = 1e10, high = -1e10;
  vector<ll> X(Q);
  for (ll i = 0; i < Q; i++) {
    cin >> X[i];
    if (low  > X[i]) low  = X[i];
    if (high < X[i]) high = X[i];
  }

  ll real_low = low, real_high = high, temp_low = low, temp_high = high;
  ll sum = 0;
  for (ll i = 0; i < N; i++) {
    if (T[i] == 1) {
      real_low += A[i];
      temp_low += A[i];
      real_high += A[i];
      temp_high += A[i];
      sum += A[i];

    } else if (T[i] == 2) {
      real_low = max(real_low, A[i]);
      real_high = max(real_high, A[i]);
    } else {
      real_low = min(real_low, A[i]);
      real_high = min(real_high, A[i]);
    }
  // cout <<'\n';
  // cout << real_low << '\n';
  // cout << real_high << '\n';
  // cout <<'\n';
  }

  ll low_cut = low + (real_low - temp_low);
  ll high_cut = high - (temp_high - real_high);
  for (ll i = 0; i < Q; i++) {
    if (X[i] < low_cut) {
      cout << real_low << '\n';
    } else if (X[i] > high_cut) {
      cout << real_high << '\n';
    } else {
      cout << (X[i] + sum) << '\n';
    }
  }
  return 0;
}

Submission Info

Judge Result