oj.uz

답안 #1049679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049679 2024-08-09T03:53:21 Z QuangBui Meteors (POI11_met) C++17
74 / 100
 949 ms 32416 KB 
// QuangBuiCP
// https://oj.uz/problem/view/POI11_met
#include "bits/stdc++.h"
using namespace std;

int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif // LOCAL

  int n, m;
  cin >> n >> m;
  vector<vector<int>> properties(n);
  for (int i = 0; i < m; ++i) {
    int who;
    cin >> who;
    properties[--who].push_back(i);
  }
  vector<int64_t> target(n);
  for (int64_t& it : target) {
    cin >> it;
  }
  int events;
  cin >> events;
  vector<tuple<int, int, int64_t>> event(events);
  for (auto& [l, r, collectable] : event) {
    cin >> l >> r >> collectable;
    l--, r--;
  }

  vector<vector<int>> candidates(events + 1);
  vector<int> L(n, 0), R(n, events - 1);
  vector<int> answer(n, -1);
  for (int step = 0; step < 20; ++step) {
    for (int i = 0; i < n; ++i) {
      if (L[i] > R[i]) {
        continue;
      }
      int mid = (L[i] + R[i]) / 2;
      candidates[mid].push_back(i);
    }
    vector<int64_t> fenw(m + 1, 0);
    auto Update = [&fenw, &m](int x, int64_t val) {
      while (x <= m) {
        fenw[x] += val;
        x |= x + 1;
      }
    };
    auto UpdateRange = [&fenw, &m, &Update](int l, int r, int64_t val) {
      Update(l, val);
      Update(r + 1, -val);
    };
    auto Query = [&fenw](int x) {
      int64_t res = 0;
      while (x >= 0) {
        res += fenw[x];
        x &= x + 1;
        x--;
      }
      return res;
    };
    for (int mid = 0; mid < events; ++mid) {
      auto [l, r, collectable] = event[mid];
      if (l <= r) {
        UpdateRange(l, r, collectable);
      } else {
        UpdateRange(l, m - 1, collectable);
        UpdateRange(0, r, collectable);
      }
      for (int who : candidates[mid]) {
        int64_t sum = 0;
        for (int land : properties[who]) {
          sum += Query(land);
        }
        if (sum >= target[who]) {
          answer[who] = mid;
          R[who] = mid - 1;
        } else {
          L[who] = mid + 1;
        }
      }
      candidates[mid].clear();
    }
  }

  for (int x : answer) {
    if (x == -1) {
      cout << "NIE\n";
    } else {
      cout << x + 1 << '\n';
    }
  }

  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 3788 KB Output is correct
2 Correct 97 ms 6636 KB Output is correct
3 Correct 68 ms 5628 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 4772 KB Output is correct
2 Correct 76 ms 4896 KB Output is correct
3 Correct 98 ms 6696 KB Output is correct
4 Correct 16 ms 3280 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 4012 KB Output is correct
2 Correct 59 ms 7112 KB Output is correct
3 Correct 30 ms 2392 KB Output is correct
4 Correct 64 ms 6092 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 3136 KB Output is correct
2 Correct 80 ms 4796 KB Output is correct
3 Correct 53 ms 3280 KB Output is correct
4 Correct 91 ms 7680 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 949 ms 32416 KB Output is correct
2 Incorrect 544 ms 15724 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 940 ms 31132 KB Output is correct
2 Incorrect 569 ms 15800 KB Output isn't correct
3 Halted 0 ms 0 KB -