답안 #66011 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66011	2018-08-09T11:04:07 Z	funcsr	새 집 (APIO18_new_home)	C++17	47 / 100	5000 ms	366772 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)
struct PQ {
  int size = 0;
  priority_queue<int> pq_max, erase_max;
  priority_queue<int, vector<int>, greater<int> > pq_min, erase_min;

  void add(int x) {
    size++;
    pq_min.push(x);
    pq_max.push(x);
  }
  void erase(int x) {
    size--;
    erase_min.push(x);
    erase_max.push(x);
  }
  bool empty() {
    return size==0;
  }
  int min() {
    while (!erase_min.empty() && pq_min.top() == erase_min.top()) pq_min.pop(), erase_min.pop();
    return pq_min.top();
  }
  int max() {
    while (!erase_max.empty() && pq_max.top() == erase_max.top()) pq_max.pop(), erase_max.pop();
    return pq_max.top();
  }
};

inline int dist(PQ &s, int d) {
  if (s.empty()) return 0;
  //else return max(abs(d-*s.begin()), abs(d-*s.rbegin()));
  else return max(abs(d-s.min()), abs(d-s.max()));
}

struct SegTree {
  PQ 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].add(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) {
      seg[k].erase(x);
      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];
int X[600000];
int rangeL[600000], rangeR[600000];
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);

  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:197:3: note: in expansion of macro 'rep'
   rep(y, years.size()) {
   ^~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	145 ms	175096 KB	Output is correct
2	Correct	167 ms	175148 KB	Output is correct
3	Correct	150 ms	175256 KB	Output is correct
4	Correct	151 ms	175332 KB	Output is correct
5	Correct	180 ms	175332 KB	Output is correct
6	Correct	154 ms	175664 KB	Output is correct
7	Correct	170 ms	175696 KB	Output is correct
8	Correct	153 ms	175696 KB	Output is correct
9	Correct	153 ms	175696 KB	Output is correct
10	Correct	151 ms	175696 KB	Output is correct
11	Correct	154 ms	175696 KB	Output is correct
12	Correct	179 ms	175696 KB	Output is correct
13	Correct	170 ms	175696 KB	Output is correct
14	Correct	168 ms	175696 KB	Output is correct
15	Correct	171 ms	175696 KB	Output is correct
16	Correct	157 ms	175700 KB	Output is correct
17	Correct	172 ms	175700 KB	Output is correct
18	Correct	176 ms	175700 KB	Output is correct
19	Correct	176 ms	175700 KB	Output is correct
20	Correct	169 ms	175700 KB	Output is correct
21	Correct	152 ms	175700 KB	Output is correct
22	Correct	165 ms	175700 KB	Output is correct
23	Correct	162 ms	175700 KB	Output is correct
24	Correct	158 ms	175700 KB	Output is correct
25	Correct	168 ms	175700 KB	Output is correct
26	Correct	174 ms	175700 KB	Output is correct
27	Correct	178 ms	175700 KB	Output is correct
28	Correct	155 ms	175700 KB	Output is correct
29	Correct	154 ms	175700 KB	Output is correct
30	Correct	184 ms	175700 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	145 ms	175096 KB	Output is correct
2	Correct	167 ms	175148 KB	Output is correct
3	Correct	150 ms	175256 KB	Output is correct
4	Correct	151 ms	175332 KB	Output is correct
5	Correct	180 ms	175332 KB	Output is correct
6	Correct	154 ms	175664 KB	Output is correct
7	Correct	170 ms	175696 KB	Output is correct
8	Correct	153 ms	175696 KB	Output is correct
9	Correct	153 ms	175696 KB	Output is correct
10	Correct	151 ms	175696 KB	Output is correct
11	Correct	154 ms	175696 KB	Output is correct
12	Correct	179 ms	175696 KB	Output is correct
13	Correct	170 ms	175696 KB	Output is correct
14	Correct	168 ms	175696 KB	Output is correct
15	Correct	171 ms	175696 KB	Output is correct
16	Correct	157 ms	175700 KB	Output is correct
17	Correct	172 ms	175700 KB	Output is correct
18	Correct	176 ms	175700 KB	Output is correct
19	Correct	176 ms	175700 KB	Output is correct
20	Correct	169 ms	175700 KB	Output is correct
21	Correct	152 ms	175700 KB	Output is correct
22	Correct	165 ms	175700 KB	Output is correct
23	Correct	162 ms	175700 KB	Output is correct
24	Correct	158 ms	175700 KB	Output is correct
25	Correct	168 ms	175700 KB	Output is correct
26	Correct	174 ms	175700 KB	Output is correct
27	Correct	178 ms	175700 KB	Output is correct
28	Correct	155 ms	175700 KB	Output is correct
29	Correct	154 ms	175700 KB	Output is correct
30	Correct	184 ms	175700 KB	Output is correct
31	Correct	3375 ms	245468 KB	Output is correct
32	Correct	459 ms	245468 KB	Output is correct
33	Correct	2177 ms	245468 KB	Output is correct
34	Correct	3447 ms	247308 KB	Output is correct
35	Correct	3172 ms	247308 KB	Output is correct
36	Correct	2091 ms	247308 KB	Output is correct
37	Correct	2070 ms	247308 KB	Output is correct
38	Correct	1639 ms	247308 KB	Output is correct
39	Correct	1201 ms	247308 KB	Output is correct
40	Correct	1101 ms	247308 KB	Output is correct
41	Correct	1823 ms	247308 KB	Output is correct
42	Correct	1841 ms	247308 KB	Output is correct
43	Correct	225 ms	247308 KB	Output is correct
44	Correct	1653 ms	247308 KB	Output is correct
45	Correct	1715 ms	247308 KB	Output is correct
46	Correct	1913 ms	247308 KB	Output is correct
47	Correct	893 ms	247308 KB	Output is correct
48	Correct	908 ms	247308 KB	Output is correct
49	Correct	1115 ms	247308 KB	Output is correct
50	Correct	1149 ms	247308 KB	Output is correct
51	Correct	1160 ms	247308 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5042 ms	366772 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5044 ms	366772 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	145 ms	175096 KB	Output is correct
2	Correct	167 ms	175148 KB	Output is correct
3	Correct	150 ms	175256 KB	Output is correct
4	Correct	151 ms	175332 KB	Output is correct
5	Correct	180 ms	175332 KB	Output is correct
6	Correct	154 ms	175664 KB	Output is correct
7	Correct	170 ms	175696 KB	Output is correct
8	Correct	153 ms	175696 KB	Output is correct
9	Correct	153 ms	175696 KB	Output is correct
10	Correct	151 ms	175696 KB	Output is correct
11	Correct	154 ms	175696 KB	Output is correct
12	Correct	179 ms	175696 KB	Output is correct
13	Correct	170 ms	175696 KB	Output is correct
14	Correct	168 ms	175696 KB	Output is correct
15	Correct	171 ms	175696 KB	Output is correct
16	Correct	157 ms	175700 KB	Output is correct
17	Correct	172 ms	175700 KB	Output is correct
18	Correct	176 ms	175700 KB	Output is correct
19	Correct	176 ms	175700 KB	Output is correct
20	Correct	169 ms	175700 KB	Output is correct
21	Correct	152 ms	175700 KB	Output is correct
22	Correct	165 ms	175700 KB	Output is correct
23	Correct	162 ms	175700 KB	Output is correct
24	Correct	158 ms	175700 KB	Output is correct
25	Correct	168 ms	175700 KB	Output is correct
26	Correct	174 ms	175700 KB	Output is correct
27	Correct	178 ms	175700 KB	Output is correct
28	Correct	155 ms	175700 KB	Output is correct
29	Correct	154 ms	175700 KB	Output is correct
30	Correct	184 ms	175700 KB	Output is correct
31	Correct	3375 ms	245468 KB	Output is correct
32	Correct	459 ms	245468 KB	Output is correct
33	Correct	2177 ms	245468 KB	Output is correct
34	Correct	3447 ms	247308 KB	Output is correct
35	Correct	3172 ms	247308 KB	Output is correct
36	Correct	2091 ms	247308 KB	Output is correct
37	Correct	2070 ms	247308 KB	Output is correct
38	Correct	1639 ms	247308 KB	Output is correct
39	Correct	1201 ms	247308 KB	Output is correct
40	Correct	1101 ms	247308 KB	Output is correct
41	Correct	1823 ms	247308 KB	Output is correct
42	Correct	1841 ms	247308 KB	Output is correct
43	Correct	225 ms	247308 KB	Output is correct
44	Correct	1653 ms	247308 KB	Output is correct
45	Correct	1715 ms	247308 KB	Output is correct
46	Correct	1913 ms	247308 KB	Output is correct
47	Correct	893 ms	247308 KB	Output is correct
48	Correct	908 ms	247308 KB	Output is correct
49	Correct	1115 ms	247308 KB	Output is correct
50	Correct	1149 ms	247308 KB	Output is correct
51	Correct	1160 ms	247308 KB	Output is correct
52	Correct	688 ms	366772 KB	Output is correct
53	Correct	752 ms	366772 KB	Output is correct
54	Correct	1792 ms	366772 KB	Output is correct
55	Correct	1541 ms	366772 KB	Output is correct
56	Correct	1142 ms	366772 KB	Output is correct
57	Correct	1615 ms	366772 KB	Output is correct
58	Correct	1393 ms	366772 KB	Output is correct
59	Correct	1313 ms	366772 KB	Output is correct
60	Correct	1782 ms	366772 KB	Output is correct
61	Correct	281 ms	366772 KB	Output is correct
62	Correct	719 ms	366772 KB	Output is correct
63	Correct	1253 ms	366772 KB	Output is correct
64	Correct	1596 ms	366772 KB	Output is correct
65	Correct	1775 ms	366772 KB	Output is correct
66	Correct	1969 ms	366772 KB	Output is correct
67	Correct	566 ms	366772 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	145 ms	175096 KB	Output is correct
2	Correct	167 ms	175148 KB	Output is correct
3	Correct	150 ms	175256 KB	Output is correct
4	Correct	151 ms	175332 KB	Output is correct
5	Correct	180 ms	175332 KB	Output is correct
6	Correct	154 ms	175664 KB	Output is correct
7	Correct	170 ms	175696 KB	Output is correct
8	Correct	153 ms	175696 KB	Output is correct
9	Correct	153 ms	175696 KB	Output is correct
10	Correct	151 ms	175696 KB	Output is correct
11	Correct	154 ms	175696 KB	Output is correct
12	Correct	179 ms	175696 KB	Output is correct
13	Correct	170 ms	175696 KB	Output is correct
14	Correct	168 ms	175696 KB	Output is correct
15	Correct	171 ms	175696 KB	Output is correct
16	Correct	157 ms	175700 KB	Output is correct
17	Correct	172 ms	175700 KB	Output is correct
18	Correct	176 ms	175700 KB	Output is correct
19	Correct	176 ms	175700 KB	Output is correct
20	Correct	169 ms	175700 KB	Output is correct
21	Correct	152 ms	175700 KB	Output is correct
22	Correct	165 ms	175700 KB	Output is correct
23	Correct	162 ms	175700 KB	Output is correct
24	Correct	158 ms	175700 KB	Output is correct
25	Correct	168 ms	175700 KB	Output is correct
26	Correct	174 ms	175700 KB	Output is correct
27	Correct	178 ms	175700 KB	Output is correct
28	Correct	155 ms	175700 KB	Output is correct
29	Correct	154 ms	175700 KB	Output is correct
30	Correct	184 ms	175700 KB	Output is correct
31	Correct	3375 ms	245468 KB	Output is correct
32	Correct	459 ms	245468 KB	Output is correct
33	Correct	2177 ms	245468 KB	Output is correct
34	Correct	3447 ms	247308 KB	Output is correct
35	Correct	3172 ms	247308 KB	Output is correct
36	Correct	2091 ms	247308 KB	Output is correct
37	Correct	2070 ms	247308 KB	Output is correct
38	Correct	1639 ms	247308 KB	Output is correct
39	Correct	1201 ms	247308 KB	Output is correct
40	Correct	1101 ms	247308 KB	Output is correct
41	Correct	1823 ms	247308 KB	Output is correct
42	Correct	1841 ms	247308 KB	Output is correct
43	Correct	225 ms	247308 KB	Output is correct
44	Correct	1653 ms	247308 KB	Output is correct
45	Correct	1715 ms	247308 KB	Output is correct
46	Correct	1913 ms	247308 KB	Output is correct
47	Correct	893 ms	247308 KB	Output is correct
48	Correct	908 ms	247308 KB	Output is correct
49	Correct	1115 ms	247308 KB	Output is correct
50	Correct	1149 ms	247308 KB	Output is correct
51	Correct	1160 ms	247308 KB	Output is correct
52	Execution timed out	5042 ms	366772 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #66011

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