oj.uz

답안 #1049682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049682 2024-08-09T03:56:40 Z QuangBui Meteors (POI11_met) C++17
87 / 100
 894 ms 50992 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<int> target(n);
  for (int& it : target) {
    cin >> it;
  }
  int events;
  cin >> events;
  vector<tuple<int, int, int>> 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<int> fenw(m + 1, 0);
    auto Update = [&fenw, &m](int x, int val) {
      while (x <= m) {
        fenw[x] += val;
        x |= x + 1;
      }
    };
    auto UpdateRange = [&fenw, &m, &Update](int l, int r, int val) {
      Update(l, val);
      Update(r + 1, -val);
    };
    auto Query = [&fenw](int x) {
      int 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]) {
        int sum = 0;
        for (int land : properties[who]) {
          sum += Query(land);
          if (sum >= target[who]) {
            break;
          }
        }
        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 35 ms 3224 KB Output is correct
2 Correct 71 ms 6200 KB Output is correct
3 Correct 61 ms 4988 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 4496 KB Output is correct
2 Correct 59 ms 4496 KB Output is correct
3 Correct 70 ms 6128 KB Output is correct
4 Correct 15 ms 3072 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 3724 KB Output is correct
2 Correct 46 ms 6540 KB Output is correct
3 Correct 26 ms 2140 KB Output is correct
4 Correct 56 ms 5500 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 2752 KB Output is correct
2 Correct 62 ms 4364 KB Output is correct
3 Correct 39 ms 2964 KB Output is correct
4 Correct 71 ms 7220 KB Output is correct

Subtask #7
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 703 ms 29748 KB Output is correct
2 Correct 457 ms 13480 KB Output is correct
3 Correct 125 ms 9312 KB Output is correct
4 Correct 894 ms 50992 KB Output is correct

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 693 ms 28468 KB Output is correct
2 Correct 399 ms 13268 KB Output is correct
3 Incorrect 123 ms 7444 KB Output isn't correct
4 Halted 0 ms 0 KB -