oj.uz

답안 #906017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906017 2024-01-13T09:45:28 Z nguyentunglam 새 집 (APIO18_new_home) C++17
47 / 100
 4236 ms 493468 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, int border, pair<int, int> tmp) {
  while (pos >= border) {
    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, _pos - x[i]);
        break;
      }
    }
    pos += pos & -pos;
  }
  return ret;
}

void add1 (int pos, int border, pair<int, int> tmp) {
  while (pos <= border) {
    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, 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, sz, make_pair(x[cnt + 2], cnt + 2));
    nxt[cnt + 1] = cnt + 2;
    pre[cnt + 2] = cnt + 1;
    cnt += 2;
  }

  double timer = 0;

  int st = 0;
  int ed = 0;
//  timer += 1.0 * (ed - st) / CLOCKS_PER_SEC;

  for(int cur = 1; cur <= m; cur++) {
    assert(timer <= 0.6);
    for(int &j : open[cur]) {
      int st = clock();
      auto iter = s[t[j]].lower_bound(make_pair(x[j], j));
      int to = iter -> second;
      --iter;
      int from = iter -> second;
      int ed = clock();
      timer += 1.0 * (ed - st) / CLOCKS_PER_SEC;
      int middle;
      middle = id(x[from] + x[j] >> 1);
      int L = id(x[from] - 1) + 1, R = id(x[to]), pos = id(x[j]);

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

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

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

      nxt[from] = j;
      pre[j] = from;
      nxt[j] = to;
      pre[to] = j;
        st = clock();
      s[t[j]].insert({x[j], j});
      ed = clock();
      timer += 1.0 * (ed - st) / CLOCKS_PER_SEC;
      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]) {
      st = clock();
      auto iter = s[t[j]].find(make_pair(x[j], j));
      ++iter;
      int to = iter -> second;
      --iter; --iter;
      int from = iter -> second;
      ed = clock();
      timer += 1.0 * (ed - st) / CLOCKS_PER_SEC;

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


      nxt[from] = to;
      pre[to] = from;
      st = clock();
      s[t[j]].erase(s[t[j]].find(make_pair(x[j], j)));
      ed = clock();
      timer += 1.0 * (ed - st) / CLOCKS_PER_SEC;
      alive[j] = 0;
    }
  }

  cerr << timer << endl;
  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:160:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  160 |       middle = id(x[from] + x[j] >> 1);
      |                   ~~~~~~~~^~~~~~
new_home.cpp:166:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  166 |       middle = id(x[j] + x[to] >> 1);
      |                   ~~~~~^~~~~~~
new_home.cpp:198:71: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  198 |       int L = id(x[from] - 1) + 1, R = id(x[to]), 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
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 111188 KB Output is correct
2 Correct 33 ms 111196 KB Output is correct
3 Correct 33 ms 111196 KB Output is correct
4 Correct 33 ms 111196 KB Output is correct
5 Correct 35 ms 111444 KB Output is correct
6 Correct 35 ms 111324 KB Output is correct
7 Correct 35 ms 111444 KB Output is correct
8 Correct 34 ms 111444 KB Output is correct
9 Correct 35 ms 111440 KB Output is correct
10 Correct 35 ms 111440 KB Output is correct
11 Correct 35 ms 111696 KB Output is correct
12 Correct 35 ms 111440 KB Output is correct
13 Correct 35 ms 111444 KB Output is correct
14 Correct 34 ms 111452 KB Output is correct
15 Correct 34 ms 111364 KB Output is correct
16 Correct 34 ms 111452 KB Output is correct
17 Correct 37 ms 111448 KB Output is correct
18 Correct 38 ms 111448 KB Output is correct
19 Correct 35 ms 111620 KB Output is correct
20 Correct 36 ms 111448 KB Output is correct
21 Correct 35 ms 111452 KB Output is correct
22 Correct 37 ms 111452 KB Output is correct
23 Correct 35 ms 111452 KB Output is correct
24 Correct 34 ms 111452 KB Output is correct
25 Correct 34 ms 111368 KB Output is correct
26 Correct 34 ms 111452 KB Output is correct
27 Correct 35 ms 111504 KB Output is correct
28 Correct 35 ms 111452 KB Output is correct
29 Correct 35 ms 111444 KB Output is correct
30 Correct 36 ms 111452 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 111188 KB Output is correct
2 Correct 33 ms 111196 KB Output is correct
3 Correct 33 ms 111196 KB Output is correct
4 Correct 33 ms 111196 KB Output is correct
5 Correct 35 ms 111444 KB Output is correct
6 Correct 35 ms 111324 KB Output is correct
7 Correct 35 ms 111444 KB Output is correct
8 Correct 34 ms 111444 KB Output is correct
9 Correct 35 ms 111440 KB Output is correct
10 Correct 35 ms 111440 KB Output is correct
11 Correct 35 ms 111696 KB Output is correct
12 Correct 35 ms 111440 KB Output is correct
13 Correct 35 ms 111444 KB Output is correct
14 Correct 34 ms 111452 KB Output is correct
15 Correct 34 ms 111364 KB Output is correct
16 Correct 34 ms 111452 KB Output is correct
17 Correct 37 ms 111448 KB Output is correct
18 Correct 38 ms 111448 KB Output is correct
19 Correct 35 ms 111620 KB Output is correct
20 Correct 36 ms 111448 KB Output is correct
21 Correct 35 ms 111452 KB Output is correct
22 Correct 37 ms 111452 KB Output is correct
23 Correct 35 ms 111452 KB Output is correct
24 Correct 34 ms 111452 KB Output is correct
25 Correct 34 ms 111368 KB Output is correct
26 Correct 34 ms 111452 KB Output is correct
27 Correct 35 ms 111504 KB Output is correct
28 Correct 35 ms 111452 KB Output is correct
29 Correct 35 ms 111444 KB Output is correct
30 Correct 36 ms 111452 KB Output is correct
31 Correct 722 ms 141612 KB Output is correct
32 Correct 264 ms 118144 KB Output is correct
33 Correct 710 ms 131792 KB Output is correct
34 Correct 716 ms 141516 KB Output is correct
35 Correct 672 ms 138464 KB Output is correct
36 Correct 675 ms 132428 KB Output is correct
37 Correct 504 ms 132632 KB Output is correct
38 Correct 516 ms 128252 KB Output is correct
39 Correct 419 ms 129196 KB Output is correct
40 Correct 437 ms 128120 KB Output is correct
41 Correct 614 ms 137384 KB Output is correct
42 Correct 584 ms 137836 KB Output is correct
43 Correct 233 ms 118284 KB Output is correct
44 Correct 555 ms 137164 KB Output is correct
45 Correct 542 ms 134604 KB Output is correct
46 Correct 571 ms 128884 KB Output is correct
47 Correct 392 ms 134092 KB Output is correct
48 Correct 373 ms 132816 KB Output is correct
49 Correct 438 ms 135088 KB Output is correct
50 Correct 448 ms 137160 KB Output is correct
51 Correct 418 ms 133128 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4236 ms 304368 KB Output is correct
2 Runtime error 2076 ms 370580 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2852 ms 493468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 111188 KB Output is correct
2 Correct 33 ms 111196 KB Output is correct
3 Correct 33 ms 111196 KB Output is correct
4 Correct 33 ms 111196 KB Output is correct
5 Correct 35 ms 111444 KB Output is correct
6 Correct 35 ms 111324 KB Output is correct
7 Correct 35 ms 111444 KB Output is correct
8 Correct 34 ms 111444 KB Output is correct
9 Correct 35 ms 111440 KB Output is correct
10 Correct 35 ms 111440 KB Output is correct
11 Correct 35 ms 111696 KB Output is correct
12 Correct 35 ms 111440 KB Output is correct
13 Correct 35 ms 111444 KB Output is correct
14 Correct 34 ms 111452 KB Output is correct
15 Correct 34 ms 111364 KB Output is correct
16 Correct 34 ms 111452 KB Output is correct
17 Correct 37 ms 111448 KB Output is correct
18 Correct 38 ms 111448 KB Output is correct
19 Correct 35 ms 111620 KB Output is correct
20 Correct 36 ms 111448 KB Output is correct
21 Correct 35 ms 111452 KB Output is correct
22 Correct 37 ms 111452 KB Output is correct
23 Correct 35 ms 111452 KB Output is correct
24 Correct 34 ms 111452 KB Output is correct
25 Correct 34 ms 111368 KB Output is correct
26 Correct 34 ms 111452 KB Output is correct
27 Correct 35 ms 111504 KB Output is correct
28 Correct 35 ms 111452 KB Output is correct
29 Correct 35 ms 111444 KB Output is correct
30 Correct 36 ms 111452 KB Output is correct
31 Correct 722 ms 141612 KB Output is correct
32 Correct 264 ms 118144 KB Output is correct
33 Correct 710 ms 131792 KB Output is correct
34 Correct 716 ms 141516 KB Output is correct
35 Correct 672 ms 138464 KB Output is correct
36 Correct 675 ms 132428 KB Output is correct
37 Correct 504 ms 132632 KB Output is correct
38 Correct 516 ms 128252 KB Output is correct
39 Correct 419 ms 129196 KB Output is correct
40 Correct 437 ms 128120 KB Output is correct
41 Correct 614 ms 137384 KB Output is correct
42 Correct 584 ms 137836 KB Output is correct
43 Correct 233 ms 118284 KB Output is correct
44 Correct 555 ms 137164 KB Output is correct
45 Correct 542 ms 134604 KB Output is correct
46 Correct 571 ms 128884 KB Output is correct
47 Correct 392 ms 134092 KB Output is correct
48 Correct 373 ms 132816 KB Output is correct
49 Correct 438 ms 135088 KB Output is correct
50 Correct 448 ms 137160 KB Output is correct
51 Correct 418 ms 133128 KB Output is correct
52 Correct 634 ms 158788 KB Output is correct
53 Correct 656 ms 157868 KB Output is correct
54 Correct 738 ms 150888 KB Output is correct
55 Correct 612 ms 144772 KB Output is correct
56 Correct 572 ms 145612 KB Output is correct
57 Correct 583 ms 137960 KB Output is correct
58 Correct 598 ms 144328 KB Output is correct
59 Correct 639 ms 146124 KB Output is correct
60 Correct 590 ms 138900 KB Output is correct
61 Correct 248 ms 126840 KB Output is correct
62 Correct 619 ms 150840 KB Output is correct
63 Correct 664 ms 150224 KB Output is correct
64 Correct 724 ms 148656 KB Output is correct
65 Correct 702 ms 141904 KB Output is correct
66 Correct 613 ms 139172 KB Output is correct
67 Correct 289 ms 124080 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 111188 KB Output is correct
2 Correct 33 ms 111196 KB Output is correct
3 Correct 33 ms 111196 KB Output is correct
4 Correct 33 ms 111196 KB Output is correct
5 Correct 35 ms 111444 KB Output is correct
6 Correct 35 ms 111324 KB Output is correct
7 Correct 35 ms 111444 KB Output is correct
8 Correct 34 ms 111444 KB Output is correct
9 Correct 35 ms 111440 KB Output is correct
10 Correct 35 ms 111440 KB Output is correct
11 Correct 35 ms 111696 KB Output is correct
12 Correct 35 ms 111440 KB Output is correct
13 Correct 35 ms 111444 KB Output is correct
14 Correct 34 ms 111452 KB Output is correct
15 Correct 34 ms 111364 KB Output is correct
16 Correct 34 ms 111452 KB Output is correct
17 Correct 37 ms 111448 KB Output is correct
18 Correct 38 ms 111448 KB Output is correct
19 Correct 35 ms 111620 KB Output is correct
20 Correct 36 ms 111448 KB Output is correct
21 Correct 35 ms 111452 KB Output is correct
22 Correct 37 ms 111452 KB Output is correct
23 Correct 35 ms 111452 KB Output is correct
24 Correct 34 ms 111452 KB Output is correct
25 Correct 34 ms 111368 KB Output is correct
26 Correct 34 ms 111452 KB Output is correct
27 Correct 35 ms 111504 KB Output is correct
28 Correct 35 ms 111452 KB Output is correct
29 Correct 35 ms 111444 KB Output is correct
30 Correct 36 ms 111452 KB Output is correct
31 Correct 722 ms 141612 KB Output is correct
32 Correct 264 ms 118144 KB Output is correct
33 Correct 710 ms 131792 KB Output is correct
34 Correct 716 ms 141516 KB Output is correct
35 Correct 672 ms 138464 KB Output is correct
36 Correct 675 ms 132428 KB Output is correct
37 Correct 504 ms 132632 KB Output is correct
38 Correct 516 ms 128252 KB Output is correct
39 Correct 419 ms 129196 KB Output is correct
40 Correct 437 ms 128120 KB Output is correct
41 Correct 614 ms 137384 KB Output is correct
42 Correct 584 ms 137836 KB Output is correct
43 Correct 233 ms 118284 KB Output is correct
44 Correct 555 ms 137164 KB Output is correct
45 Correct 542 ms 134604 KB Output is correct
46 Correct 571 ms 128884 KB Output is correct
47 Correct 392 ms 134092 KB Output is correct
48 Correct 373 ms 132816 KB Output is correct
49 Correct 438 ms 135088 KB Output is correct
50 Correct 448 ms 137160 KB Output is correct
51 Correct 418 ms 133128 KB Output is correct
52 Correct 4236 ms 304368 KB Output is correct
53 Runtime error 2076 ms 370580 KB Execution killed with signal 6
54 Halted 0 ms 0 KB -