oj.uz

Submission #255888

# Submission time Handle Problem Language Result Execution time Memory
255888 2020-08-02T04:05:30 Z KoD New Home (APIO18_new_home) C++17
12 / 100
 2069 ms 10488 KB 
#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <tuple>
#include <set>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 19 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

struct query_t {
  i32 idx;
  i32 type; // 0: add store, 1: answer query, 2: remove store
  bool operator < (const query_t &q) const {
    return type < q.type;
  }
};

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  i32 N, K, Q;
  std::cin >> N >> K >> Q;
  assert(K <= 400);
  std::vector<i32> X(N), T(N), A(N), B(N);
  std::vector<std::pair<i32, query_t>> query;
  query.reserve(N * 2 + Q);

  for (auto i: range(0, N)) {
    std::cin >> X[i] >> T[i] >> A[i] >> B[i];
    --T[i];
    query.emplace_back(A[i], query_t{ i, 0 });
    query.emplace_back(B[i], query_t{ i, 2 });
  }
  std::vector<i32> L(Q), Y(Q);
  for (auto i: range(0, Q)) {
    std::cin >> L[i] >> Y[i];
    query.emplace_back(Y[i], query_t{ i, 1 });
  }
  std::sort(query.begin(), query.end());
  std::vector<std::multiset<i32>> store(K);
  std::vector<i32> ans(Q);
  for (auto [ignore, q]: query) {
    auto [i, t] = q;
    if (t == 0) {
      store[T[i]].insert(X[i]);
    }
    else if (t == 2) {
      store[T[i]].erase(store[T[i]].find(X[i]));
    }
    else {
      for (auto k: range(0, K)) {
        auto itr = store[k].lower_bound(L[i]);
        i32 tmp = inf32;
        if (itr != store[k].end()) {
          chmin(tmp, *itr - L[i]);
        }
        if (itr != store[k].begin()) {
          chmin(tmp, L[i] - *std::prev(itr));
        }
        chmax(ans[i], tmp);
      }
    }
  }
  for (auto i: range(0, Q)) {
    std::cout << (ans[i] == inf32 ? -1 : ans[i]) << '\n';
  }
  return 0;
}

Compilation message

main.cpp: In function 'int main()':
main.cpp:49:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:50:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:55:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:60:23: warning: unused variable 'ignore' [-Wunused-variable]

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2069 ms 10488 KB Output is correct
32 Correct 94 ms 6392 KB Output is correct
33 Correct 190 ms 8400 KB Output is correct
34 Correct 1645 ms 8824 KB Output is correct
35 Correct 937 ms 10376 KB Output is correct
36 Correct 219 ms 10364 KB Output is correct
37 Correct 172 ms 7672 KB Output is correct
38 Correct 109 ms 7544 KB Output is correct
39 Correct 100 ms 7416 KB Output is correct
40 Correct 93 ms 7288 KB Output is correct
41 Correct 274 ms 7672 KB Output is correct
42 Correct 366 ms 7672 KB Output is correct
43 Correct 250 ms 9980 KB Output is correct
44 Correct 242 ms 7672 KB Output is correct
45 Correct 141 ms 7672 KB Output is correct
46 Correct 85 ms 7544 KB Output is correct
47 Correct 83 ms 7032 KB Output is correct
48 Correct 73 ms 7032 KB Output is correct
49 Correct 89 ms 7288 KB Output is correct
50 Correct 214 ms 7416 KB Output is correct
51 Correct 82 ms 7288 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2069 ms 10488 KB Output is correct
32 Correct 94 ms 6392 KB Output is correct
33 Correct 190 ms 8400 KB Output is correct
34 Correct 1645 ms 8824 KB Output is correct
35 Correct 937 ms 10376 KB Output is correct
36 Correct 219 ms 10364 KB Output is correct
37 Correct 172 ms 7672 KB Output is correct
38 Correct 109 ms 7544 KB Output is correct
39 Correct 100 ms 7416 KB Output is correct
40 Correct 93 ms 7288 KB Output is correct
41 Correct 274 ms 7672 KB Output is correct
42 Correct 366 ms 7672 KB Output is correct
43 Correct 250 ms 9980 KB Output is correct
44 Correct 242 ms 7672 KB Output is correct
45 Correct 141 ms 7672 KB Output is correct
46 Correct 85 ms 7544 KB Output is correct
47 Correct 83 ms 7032 KB Output is correct
48 Correct 73 ms 7032 KB Output is correct
49 Correct 89 ms 7288 KB Output is correct
50 Correct 214 ms 7416 KB Output is correct
51 Correct 82 ms 7288 KB Output is correct
52 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2069 ms 10488 KB Output is correct
32 Correct 94 ms 6392 KB Output is correct
33 Correct 190 ms 8400 KB Output is correct
34 Correct 1645 ms 8824 KB Output is correct
35 Correct 937 ms 10376 KB Output is correct
36 Correct 219 ms 10364 KB Output is correct
37 Correct 172 ms 7672 KB Output is correct
38 Correct 109 ms 7544 KB Output is correct
39 Correct 100 ms 7416 KB Output is correct
40 Correct 93 ms 7288 KB Output is correct
41 Correct 274 ms 7672 KB Output is correct
42 Correct 366 ms 7672 KB Output is correct
43 Correct 250 ms 9980 KB Output is correct
44 Correct 242 ms 7672 KB Output is correct
45 Correct 141 ms 7672 KB Output is correct
46 Correct 85 ms 7544 KB Output is correct
47 Correct 83 ms 7032 KB Output is correct
48 Correct 73 ms 7032 KB Output is correct
49 Correct 89 ms 7288 KB Output is correct
50 Correct 214 ms 7416 KB Output is correct
51 Correct 82 ms 7288 KB Output is correct
52 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -