답안 #66007 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66007	2018-08-09T10:54:33 Z	funcsr	새 집 (APIO18_new_home)	C++17	47 / 100	3889 ms	260536 KB

new_home

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 600000000
#define MOD 1000000007
#define MAX_N (1<<19)
inline int dist(const multiset<int> &s, int d) {
  if (s.empty()) return 0;
  else return max(abs(d-*s.begin()), abs(d-*s.rbegin()));
}

struct SegTree {
  multiset<int> seg[MAX_N*2-1];
  void add(int a, int b, int x, int k=0, int l=0, int r=MAX_N) {
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) {
      seg[k].insert(x);
      return;
    }
    add(a, b, x, k*2+1, l, (l+r)/2);
    add(a, b, x, k*2+2, (l+r)/2, r);
  }
  void remove(int a, int b, int x, int k=0, int l=0, int r=MAX_N) {
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) {
      auto it = seg[k].find(x);
      assert(it != seg[k].end());
      seg[k].erase(it);
      return;
    }
    remove(a, b, x, k*2+1, l, (l+r)/2);
    remove(a, b, x, k*2+2, (l+r)/2, r);
  }
  int query(int k, int x) {
    k += MAX_N-1;
    int m = dist(seg[k], x);
    while (k > 0) {
      k = (k-1)/2;
      m = max(m, dist(seg[k], x));
    }
    return m;
  }
} seg;

int N, K, Q;
int T[300000], A[300000], B[300000];
int L[300000], Y[300000];
#define MAX_Y 300000
vector<int> Gopen[MAX_Y];
vector<int> Gclose[MAX_Y];
vector<int> Gquery[MAX_Y];
#define MAX_X 300000
int X[MAX_X];
int rangeL[MAX_X], rangeR[MAX_X];
int ans[300000];
vector<int> years, xs;

void addRange(int id) {
  int l = lower_bound(all(xs), rangeL[id]) - xs.begin();
  int r = upper_bound(all(xs), rangeR[id]) - xs.begin() - 1;
  if (l > r) return;
  seg.add(l, r+1, X[id]);
}
void removeRange(int id) {
  int l = lower_bound(all(xs), rangeL[id]) - xs.begin();
  int r = upper_bound(all(xs), rangeR[id]) - xs.begin() - 1;
  if (l > r) return;
  seg.remove(l, r+1, X[id]);
}

set<P> kind[300000]; // (pos, i)

void add(int k, P val) {
  int x = val._2;
  auto it = kind[k].lower_bound(val);
  assert(it != kind[k].end() && it != kind[k].begin());
  int b = (*it)._2;
  int a = (*(--it))._2;
  kind[k].insert(val);

  removeRange(a);
  removeRange(b);

  rangeR[a] = rangeL[x] = (X[a]+X[x])/2;
  rangeR[x] = rangeL[b] = (X[b]+X[x])/2;

  addRange(a);
  addRange(b);
  addRange(x);
}
void remove(int k, P val) {
  int x = val._2;
  kind[k].erase(val);
  auto it = kind[k].lower_bound(val);
  assert(it != kind[k].end() && it != kind[k].begin());
  int b = (*it)._2;
  int a = (*(--it))._2;

  removeRange(a);
  removeRange(b);
  removeRange(x);

  rangeR[a] = rangeL[b] = (X[a]+X[b])/2;

  addRange(a);
  addRange(b);
}

int maxDist(int pos) {
  int x = index(xs, pos);
  return seg.query(x, pos);
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> K >> Q;
  rep(i, N) {
    cin >> X[i] >> T[i] >> A[i] >> B[i];
    X[i] *= 2;
    T[i]--;
  }
  rep(i, Q) {
    cin >> L[i] >> Y[i];
    L[i] *= 2;
    xs.pb(L[i]);
    years.pb(Y[i]);
  }
  sort(all(years)); uniq(years);
  assert(years.size() <= MAX_Y);
  rep(i, N) Gopen[index(years, A[i])].pb(i);
  rep(i, N) Gclose[index(years, B[i]+1)].pb(i);
  rep(i, Q) Gquery[index(years, Y[i])].pb(i);
  rep(i, Q) ans[i] = -2;

  sort(all(xs)); uniq(xs);
  assert(xs.size() <= MAX_X);

  rep(k, K) {
    int id1 = N+2*k, id2 = N+2*k+1;
    X[id1] = -INF;
    kind[k].insert(P(-INF, id1));
    rangeL[id1] = -INF;
    rangeR[id1] = 0;
    addRange(id1);

    X[id2] = +INF;
    kind[k].insert(P(+INF, id2));
    rangeL[id2] = 0;
    rangeR[id2] = +INF;
    addRange(id2);
  }
  rep(y, years.size()) {
    for (int i : Gopen[y]) add(T[i], P(X[i], i));
    for (int i : Gclose[y]) remove(T[i], P(X[i], i));
    for (int q : Gquery[y]) {
      int m = maxDist(L[q])/2;
      if (m > 1e8) m = -1;
      ans[q] = m;
    }
  }
  rep(i, Q) cout << ans[i] << "\n";
  return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
new_home.cpp:172:3: note: in expansion of macro 'rep'
   rep(y, years.size()) {
   ^~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	73 ms	84856 KB	Output is correct
2	Correct	72 ms	84892 KB	Output is correct
3	Correct	79 ms	85036 KB	Output is correct
4	Correct	75 ms	85036 KB	Output is correct
5	Correct	89 ms	85172 KB	Output is correct
6	Correct	79 ms	85204 KB	Output is correct
7	Correct	73 ms	85204 KB	Output is correct
8	Correct	75 ms	85204 KB	Output is correct
9	Correct	102 ms	85204 KB	Output is correct
10	Correct	84 ms	85332 KB	Output is correct
11	Correct	85 ms	85332 KB	Output is correct
12	Correct	89 ms	85332 KB	Output is correct
13	Correct	85 ms	85332 KB	Output is correct
14	Correct	88 ms	85332 KB	Output is correct
15	Correct	77 ms	85332 KB	Output is correct
16	Correct	91 ms	85332 KB	Output is correct
17	Correct	78 ms	85332 KB	Output is correct
18	Correct	77 ms	85332 KB	Output is correct
19	Correct	77 ms	85332 KB	Output is correct
20	Correct	77 ms	85332 KB	Output is correct
21	Correct	78 ms	85332 KB	Output is correct
22	Correct	81 ms	85364 KB	Output is correct
23	Correct	82 ms	85500 KB	Output is correct
24	Correct	94 ms	85500 KB	Output is correct
25	Correct	76 ms	85500 KB	Output is correct
26	Correct	87 ms	85500 KB	Output is correct
27	Correct	75 ms	85500 KB	Output is correct
28	Correct	90 ms	85500 KB	Output is correct
29	Correct	74 ms	85500 KB	Output is correct
30	Correct	84 ms	85500 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	73 ms	84856 KB	Output is correct
2	Correct	72 ms	84892 KB	Output is correct
3	Correct	79 ms	85036 KB	Output is correct
4	Correct	75 ms	85036 KB	Output is correct
5	Correct	89 ms	85172 KB	Output is correct
6	Correct	79 ms	85204 KB	Output is correct
7	Correct	73 ms	85204 KB	Output is correct
8	Correct	75 ms	85204 KB	Output is correct
9	Correct	102 ms	85204 KB	Output is correct
10	Correct	84 ms	85332 KB	Output is correct
11	Correct	85 ms	85332 KB	Output is correct
12	Correct	89 ms	85332 KB	Output is correct
13	Correct	85 ms	85332 KB	Output is correct
14	Correct	88 ms	85332 KB	Output is correct
15	Correct	77 ms	85332 KB	Output is correct
16	Correct	91 ms	85332 KB	Output is correct
17	Correct	78 ms	85332 KB	Output is correct
18	Correct	77 ms	85332 KB	Output is correct
19	Correct	77 ms	85332 KB	Output is correct
20	Correct	77 ms	85332 KB	Output is correct
21	Correct	78 ms	85332 KB	Output is correct
22	Correct	81 ms	85364 KB	Output is correct
23	Correct	82 ms	85500 KB	Output is correct
24	Correct	94 ms	85500 KB	Output is correct
25	Correct	76 ms	85500 KB	Output is correct
26	Correct	87 ms	85500 KB	Output is correct
27	Correct	75 ms	85500 KB	Output is correct
28	Correct	90 ms	85500 KB	Output is correct
29	Correct	74 ms	85500 KB	Output is correct
30	Correct	84 ms	85500 KB	Output is correct
31	Correct	3889 ms	117424 KB	Output is correct
32	Correct	406 ms	117424 KB	Output is correct
33	Correct	1677 ms	117424 KB	Output is correct
34	Correct	3481 ms	117424 KB	Output is correct
35	Correct	3120 ms	117424 KB	Output is correct
36	Correct	1496 ms	117424 KB	Output is correct
37	Correct	1144 ms	117424 KB	Output is correct
38	Correct	772 ms	117424 KB	Output is correct
39	Correct	679 ms	117424 KB	Output is correct
40	Correct	637 ms	117424 KB	Output is correct
41	Correct	1206 ms	117424 KB	Output is correct
42	Correct	1412 ms	117424 KB	Output is correct
43	Correct	182 ms	117424 KB	Output is correct
44	Correct	1278 ms	117424 KB	Output is correct
45	Correct	1022 ms	117424 KB	Output is correct
46	Correct	811 ms	117424 KB	Output is correct
47	Correct	603 ms	117424 KB	Output is correct
48	Correct	551 ms	117424 KB	Output is correct
49	Correct	753 ms	117424 KB	Output is correct
50	Correct	1012 ms	117424 KB	Output is correct
51	Correct	686 ms	117424 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	938 ms	260536 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	850 ms	260536 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	73 ms	84856 KB	Output is correct
2	Correct	72 ms	84892 KB	Output is correct
3	Correct	79 ms	85036 KB	Output is correct
4	Correct	75 ms	85036 KB	Output is correct
5	Correct	89 ms	85172 KB	Output is correct
6	Correct	79 ms	85204 KB	Output is correct
7	Correct	73 ms	85204 KB	Output is correct
8	Correct	75 ms	85204 KB	Output is correct
9	Correct	102 ms	85204 KB	Output is correct
10	Correct	84 ms	85332 KB	Output is correct
11	Correct	85 ms	85332 KB	Output is correct
12	Correct	89 ms	85332 KB	Output is correct
13	Correct	85 ms	85332 KB	Output is correct
14	Correct	88 ms	85332 KB	Output is correct
15	Correct	77 ms	85332 KB	Output is correct
16	Correct	91 ms	85332 KB	Output is correct
17	Correct	78 ms	85332 KB	Output is correct
18	Correct	77 ms	85332 KB	Output is correct
19	Correct	77 ms	85332 KB	Output is correct
20	Correct	77 ms	85332 KB	Output is correct
21	Correct	78 ms	85332 KB	Output is correct
22	Correct	81 ms	85364 KB	Output is correct
23	Correct	82 ms	85500 KB	Output is correct
24	Correct	94 ms	85500 KB	Output is correct
25	Correct	76 ms	85500 KB	Output is correct
26	Correct	87 ms	85500 KB	Output is correct
27	Correct	75 ms	85500 KB	Output is correct
28	Correct	90 ms	85500 KB	Output is correct
29	Correct	74 ms	85500 KB	Output is correct
30	Correct	84 ms	85500 KB	Output is correct
31	Correct	3889 ms	117424 KB	Output is correct
32	Correct	406 ms	117424 KB	Output is correct
33	Correct	1677 ms	117424 KB	Output is correct
34	Correct	3481 ms	117424 KB	Output is correct
35	Correct	3120 ms	117424 KB	Output is correct
36	Correct	1496 ms	117424 KB	Output is correct
37	Correct	1144 ms	117424 KB	Output is correct
38	Correct	772 ms	117424 KB	Output is correct
39	Correct	679 ms	117424 KB	Output is correct
40	Correct	637 ms	117424 KB	Output is correct
41	Correct	1206 ms	117424 KB	Output is correct
42	Correct	1412 ms	117424 KB	Output is correct
43	Correct	182 ms	117424 KB	Output is correct
44	Correct	1278 ms	117424 KB	Output is correct
45	Correct	1022 ms	117424 KB	Output is correct
46	Correct	811 ms	117424 KB	Output is correct
47	Correct	603 ms	117424 KB	Output is correct
48	Correct	551 ms	117424 KB	Output is correct
49	Correct	753 ms	117424 KB	Output is correct
50	Correct	1012 ms	117424 KB	Output is correct
51	Correct	686 ms	117424 KB	Output is correct
52	Correct	1881 ms	260536 KB	Output is correct
53	Correct	1534 ms	260536 KB	Output is correct
54	Correct	3546 ms	260536 KB	Output is correct
55	Correct	1757 ms	260536 KB	Output is correct
56	Correct	1332 ms	260536 KB	Output is correct
57	Correct	1241 ms	260536 KB	Output is correct
58	Correct	1428 ms	260536 KB	Output is correct
59	Correct	1776 ms	260536 KB	Output is correct
60	Correct	1748 ms	260536 KB	Output is correct
61	Correct	230 ms	260536 KB	Output is correct
62	Correct	1727 ms	260536 KB	Output is correct
63	Correct	2948 ms	260536 KB	Output is correct
64	Correct	2882 ms	260536 KB	Output is correct
65	Correct	2894 ms	260536 KB	Output is correct
66	Correct	1457 ms	260536 KB	Output is correct
67	Correct	1208 ms	260536 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	73 ms	84856 KB	Output is correct
2	Correct	72 ms	84892 KB	Output is correct
3	Correct	79 ms	85036 KB	Output is correct
4	Correct	75 ms	85036 KB	Output is correct
5	Correct	89 ms	85172 KB	Output is correct
6	Correct	79 ms	85204 KB	Output is correct
7	Correct	73 ms	85204 KB	Output is correct
8	Correct	75 ms	85204 KB	Output is correct
9	Correct	102 ms	85204 KB	Output is correct
10	Correct	84 ms	85332 KB	Output is correct
11	Correct	85 ms	85332 KB	Output is correct
12	Correct	89 ms	85332 KB	Output is correct
13	Correct	85 ms	85332 KB	Output is correct
14	Correct	88 ms	85332 KB	Output is correct
15	Correct	77 ms	85332 KB	Output is correct
16	Correct	91 ms	85332 KB	Output is correct
17	Correct	78 ms	85332 KB	Output is correct
18	Correct	77 ms	85332 KB	Output is correct
19	Correct	77 ms	85332 KB	Output is correct
20	Correct	77 ms	85332 KB	Output is correct
21	Correct	78 ms	85332 KB	Output is correct
22	Correct	81 ms	85364 KB	Output is correct
23	Correct	82 ms	85500 KB	Output is correct
24	Correct	94 ms	85500 KB	Output is correct
25	Correct	76 ms	85500 KB	Output is correct
26	Correct	87 ms	85500 KB	Output is correct
27	Correct	75 ms	85500 KB	Output is correct
28	Correct	90 ms	85500 KB	Output is correct
29	Correct	74 ms	85500 KB	Output is correct
30	Correct	84 ms	85500 KB	Output is correct
31	Correct	3889 ms	117424 KB	Output is correct
32	Correct	406 ms	117424 KB	Output is correct
33	Correct	1677 ms	117424 KB	Output is correct
34	Correct	3481 ms	117424 KB	Output is correct
35	Correct	3120 ms	117424 KB	Output is correct
36	Correct	1496 ms	117424 KB	Output is correct
37	Correct	1144 ms	117424 KB	Output is correct
38	Correct	772 ms	117424 KB	Output is correct
39	Correct	679 ms	117424 KB	Output is correct
40	Correct	637 ms	117424 KB	Output is correct
41	Correct	1206 ms	117424 KB	Output is correct
42	Correct	1412 ms	117424 KB	Output is correct
43	Correct	182 ms	117424 KB	Output is correct
44	Correct	1278 ms	117424 KB	Output is correct
45	Correct	1022 ms	117424 KB	Output is correct
46	Correct	811 ms	117424 KB	Output is correct
47	Correct	603 ms	117424 KB	Output is correct
48	Correct	551 ms	117424 KB	Output is correct
49	Correct	753 ms	117424 KB	Output is correct
50	Correct	1012 ms	117424 KB	Output is correct
51	Correct	686 ms	117424 KB	Output is correct
52	Runtime error	938 ms	260536 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

답안 #66007

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 35.0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0