oj.uz

답안 #906011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906011 2024-01-13T09:23:16 Z nguyentunglam 새 집 (APIO18_new_home) C++17
0 / 100
 4867 ms 315580 KB 
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

const int N = 3e5 + 10;

int n, k, q, sz;

int x[N * 3], t[N], a[N], b[N], cost[N], c[N], y[N], ans[N];

int pre[N * 3], nxt[N * 3];

vector<int> rrh, open[N * 3], close[N * 3], event[N * 3];

set<pair<int, int> > s[N];

bool alive[N * 3];

bool bug;

priority_queue<pair<int, int> > bit0[N], bit1[N];

void add0 (int pos, pair<int, int> tmp) {
  while (pos) {
    bit0[pos].push(tmp);
    pos -= pos & -pos;
  }
}

int get0(int pos, int _pos) {
  int ret = 0;
  while (pos <= sz) {
    while (!bit0[pos].empty()) {
      int i = bit0[pos].top().second;
      int j = nxt[i];
      if (alive[i] == 0 || x[i] == x[j] || abs(x[i] - _pos) > abs(x[j] - _pos)) bit0[pos].pop();
      else {
        ret = max(ret, abs(x[i] - _pos));
        break;
      }
    }
    pos += pos & -pos;
  }
  return ret;
}

void add1 (int pos, pair<int, int> tmp) {
  while (pos <= sz) {
    bit1[pos].push(tmp);
    pos += pos & -pos;
  }
}

int get1(int pos, int _pos) {
  int ret = 0;
  while (pos) {
    while (!bit1[pos].empty()) {
      int i = bit1[pos].top().second;
      int j = pre[i];
      if (alive[i] == 0 || x[i] == x[j] || abs(x[i] - _pos) > abs(x[j] - _pos)) bit1[pos].pop();
      else {
        ret = max(ret, abs(x[i] - _pos));
        break;
      }
    }
    pos -= pos & -pos;
  }
  return ret;
}

void compress () {
  sort(all(rrh));
  rrh.resize(unique(all(rrh)) - rrh.begin());
}

int id (int x) {
  return upper_bound(all(rrh), x) - rrh.begin();
}

int32_t main() {
  #define task ""

  cin.tie(0) -> sync_with_stdio(0);

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

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

  cin >> n >> k >> q;

  for(int i = 1; i <= n; i++) cin >> x[i] >> t[i] >> a[i] >> b[i];

  for(int i = 1; i <= q; i++) cin >> c[i] >> y[i];

  for(int i = 1; i <= n; i++) {
    rrh.push_back(a[i]);
    rrh.push_back(b[i]);
  }
  for(int i = 1; i <= q; i++) rrh.push_back(y[i]);

  compress();

  for(int i = 1; i <= n; i++) {
    a[i] = id(a[i]);
    b[i] = id(b[i]);
    open[a[i]].push_back(i);
    close[b[i]].push_back(i);
  }

  for(int i = 1; i <= q; i++) {
    y[i] = id(y[i]);
    event[y[i]].push_back(i);
  }

  int m = rrh.size();

  rrh.clear();
  for(int i = 1; i <= q; i++) rrh.push_back(c[i]);
  compress();

  int cnt = n;
  sz = rrh.size();

  for(int i = 1; i <= k; i++) {
    x[cnt + 1] = -1e9;
    x[cnt + 2] = 1e9;
    alive[cnt + 1] = alive[cnt + 2] = 1;
    s[i].insert({x[cnt + 1], cnt + 1});
    s[i].insert({x[cnt + 2], cnt + 2});
    add1(1, make_pair(x[cnt + 2], cnt + 2));
    nxt[cnt + 1] = cnt + 2;
    pre[cnt + 2] = cnt + 1;
    cnt += 2;
  }

  for(int cur = 1; cur <= m; cur++) {
    for(int &j : open[cur]) {
      auto iter = s[t[j]].lower_bound(make_pair(x[j], j));
      int to = iter -> second;
      --iter;
      int from = iter -> second;
      int middle;
      middle = id(x[from] + x[j] >> 1);

      add0(middle, make_pair(-x[from], from));
      add1(middle + 1, make_pair(x[j], j));

      middle = id(x[j] + x[to] >> 1);

      add0(middle, make_pair(-x[j], j));
      add1(middle + 1, make_pair(x[to], to));

      nxt[from] = j;
      pre[j] = from;
      nxt[j] = to;
      pre[to] = j;
      s[t[j]].insert({x[j], j});
      alive[j] = 1;
    }
    for(int &j : event[cur]) {
      int tmp = id(c[j]);
      int cost1 = get0(tmp, c[j]);
      int cost2 = get1(tmp, c[j]);
      ans[j] = max(cost1, cost2);
    }
    for(int &j : close[cur]) {
      auto iter = s[t[j]].find(make_pair(x[j], j));
      ++iter;
      int to = iter -> second;
      --iter; --iter;
      int from = iter -> second;

      int middle = id(x[from] + x[to] >> 1);
      add0(middle, make_pair(-x[from], from));
      add1(middle + 1, make_pair(x[to], to));

      nxt[from] = to;
      pre[to] = from;
      s[t[j]].erase(s[t[j]].find(make_pair(x[j], j)));
      alive[j] = 0;
    }
  }

  cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;

  for(int i = 1; i <= q; i++) {
    if (ans[i] > 1e8) ans[i] = -1;
    cout << ans[i] << endl;
  }

}

Compilation message

new_home.cpp: In function 'int32_t main()':
new_home.cpp:150:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  150 |       middle = id(x[from] + x[j] >> 1);
      |                   ~~~~~~~~^~~~~~
new_home.cpp:155:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  155 |       middle = id(x[j] + x[to] >> 1);
      |                   ~~~~~^~~~~~~
new_home.cpp:180:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  180 |       int middle = id(x[from] + x[to] >> 1);
      |                       ~~~~~~~~^~~~~~~
new_home.cpp:87:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |     freopen("task.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen("task.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:92:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     freopen (task".inp", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:93:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |     freopen (task".out", "w", stdout);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 111188 KB Output is correct
2 Correct 34 ms 111184 KB Output is correct
3 Correct 33 ms 111184 KB Output is correct
4 Correct 34 ms 111184 KB Output is correct
5 Incorrect 33 ms 111392 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 111188 KB Output is correct
2 Correct 34 ms 111184 KB Output is correct
3 Correct 33 ms 111184 KB Output is correct
4 Correct 34 ms 111184 KB Output is correct
5 Incorrect 33 ms 111392 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3374 ms 313684 KB Output is correct
2 Incorrect 4662 ms 314284 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4867 ms 315580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 111188 KB Output is correct
2 Correct 34 ms 111184 KB Output is correct
3 Correct 33 ms 111184 KB Output is correct
4 Correct 34 ms 111184 KB Output is correct
5 Incorrect 33 ms 111392 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 111188 KB Output is correct
2 Correct 34 ms 111184 KB Output is correct
3 Correct 33 ms 111184 KB Output is correct
4 Correct 34 ms 111184 KB Output is correct
5 Incorrect 33 ms 111392 KB Output isn't correct
6 Halted 0 ms 0 KB -