답안 #66022 :: oj.uz

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

new_home

#pragma GCC optimize ("O3")
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <cassert>
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 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(d-s.min(), s.max()-d);
}

bool all1;
struct SegTree {
  PQ seg[MAX_N*2-1];
  int emin[MAX_N*2-1], emax[MAX_N*2-1]; // for a=1
  SegTree() {
    rep(i, MAX_N*2-1) emin[i] = 1e9, emax[i] = -1e9;
  }

  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) {
      if (all1) {
        emin[k] = min(emin[k], x);
        emax[k] = max(emax[k], x);
      }
      else {
        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) {
      if (!all1) 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 = 0;
    if (all1) {
      m = max(m, max(x-emin[k], emax[k]-x));
    }
    else {
      m = dist(seg[k], x);
    }
    while (k > 0) {
      k = (k-1)/2;
      if (all1) m = max(m, max(x-emin[k], emax[k]-x));
      else m = max(m, dist(seg[k], x));
    }
    return m;
  }
} seg;

int N, K, Q;
int X[300000], 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 rangeL[300000], rangeR[300000];
int ans[300000];
vector<int> years, xs;

inline void updateRangeL(int id, int l) {
  rangeL[id] = lower_bound(all(xs), l) - xs.begin();
}
inline void updateRangeR(int id, int r) {
  rangeR[id] = upper_bound(all(xs), r) - xs.begin() - 1;
}
inline void addRange(int id) {
  int l = rangeL[id], r = rangeR[id];
  if (rangeL[id] <= r) seg.add(l, r+1, X[id]);
}
inline void removeRange(int id) {
  if (all1) return;
  int l = rangeL[id], r = rangeR[id];
  if (l <= r) 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);
  int a = -1, b = -1;
  if (it != kind[k].end()) b = it->_2;
  if (it != kind[k].begin()) a = (--it)->_2;
  kind[k].insert(val);

  if (a != -1) removeRange(a);
  if (b != -1) removeRange(b);

  if (a == -1) updateRangeL(x, 0);
  else {
    updateRangeR(a, (X[a]+X[x])/2);
    updateRangeL(x, (X[a]+X[x])/2);
  }
  if (b == -1) updateRangeR(x, 2e8);
  else {
    updateRangeR(x, (X[b]+X[x])/2);
    updateRangeL(b, (X[b]+X[x])/2);
  }

  if (a != -1) addRange(a);
  if (b != -1) 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);
  int a = -1, b = -1;
  if (it != kind[k].end()) b = it->_2;
  if (it != kind[k].begin()) a = (--it)->_2;

  if (a != -1) removeRange(a);
  if (b != -1) removeRange(b);
  removeRange(x);

  if (a != -1) updateRangeR(a, (b==-1)?2e8:((X[a]+X[b])/2));
  if (b != -1) updateRangeL(b, (a==-1)?0:((X[a]+X[b])/2));

  if (a != -1) addRange(a);
  if (b != -1) addRange(b);
}

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

signed main() {
  scanf("%d %d %d", &N, &K, &Q);
  all1 = true;
  rep(i, N) {
    scanf("%d %d %d %d", &X[i], &T[i], &A[i], &B[i]);
    if (A[i] != 1) all1 = false;
    X[i] *= 2;
    T[i]--;
  }
  rep(i, Q) {
    scanf("%d %d", &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);

  sort(all(xs)); uniq(xs);

  int zero = K;
  rep(y, years.size()) {
    for (int i : Gopen[y]) {
      if (kind[T[i]].empty()) zero--;
      add(T[i], P(X[i], i));
    }
    for (int i : Gclose[y]) {
      remove(T[i], P(X[i], i));
      if (kind[T[i]].empty()) zero++;
    }
    for (int q : Gquery[y]) {
      int m = -1;
      if (zero == 0) m = maxDist(L[q])/2;
      ans[q] = m;
    }
  }
  rep(i, Q) printf("%d\n", ans[i]);
  return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:11: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:207:3: note: in expansion of macro 'rep'
   rep(y, years.size()) {
   ^~~
new_home.cpp:184:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &N, &K, &Q);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:187:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &X[i], &T[i], &A[i], &B[i]);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:193:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &L[i], &Y[i]);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	165 ms	183288 KB	Output is correct
2	Correct	172 ms	183444 KB	Output is correct
3	Correct	162 ms	183472 KB	Output is correct
4	Correct	166 ms	183508 KB	Output is correct
5	Correct	177 ms	183684 KB	Output is correct
6	Correct	169 ms	183696 KB	Output is correct
7	Correct	162 ms	183696 KB	Output is correct
8	Correct	177 ms	183756 KB	Output is correct
9	Correct	169 ms	183756 KB	Output is correct
10	Correct	179 ms	183840 KB	Output is correct
11	Correct	175 ms	183840 KB	Output is correct
12	Correct	190 ms	183840 KB	Output is correct
13	Correct	188 ms	183916 KB	Output is correct
14	Correct	180 ms	183916 KB	Output is correct
15	Correct	175 ms	183916 KB	Output is correct
16	Correct	171 ms	183916 KB	Output is correct
17	Correct	184 ms	183916 KB	Output is correct
18	Correct	185 ms	183916 KB	Output is correct
19	Correct	183 ms	183916 KB	Output is correct
20	Correct	190 ms	183932 KB	Output is correct
21	Correct	173 ms	183932 KB	Output is correct
22	Correct	172 ms	183932 KB	Output is correct
23	Correct	188 ms	183932 KB	Output is correct
24	Correct	196 ms	183932 KB	Output is correct
25	Correct	167 ms	183932 KB	Output is correct
26	Correct	189 ms	183932 KB	Output is correct
27	Correct	181 ms	183932 KB	Output is correct
28	Correct	189 ms	183932 KB	Output is correct
29	Correct	212 ms	183932 KB	Output is correct
30	Correct	195 ms	183932 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	165 ms	183288 KB	Output is correct
2	Correct	172 ms	183444 KB	Output is correct
3	Correct	162 ms	183472 KB	Output is correct
4	Correct	166 ms	183508 KB	Output is correct
5	Correct	177 ms	183684 KB	Output is correct
6	Correct	169 ms	183696 KB	Output is correct
7	Correct	162 ms	183696 KB	Output is correct
8	Correct	177 ms	183756 KB	Output is correct
9	Correct	169 ms	183756 KB	Output is correct
10	Correct	179 ms	183840 KB	Output is correct
11	Correct	175 ms	183840 KB	Output is correct
12	Correct	190 ms	183840 KB	Output is correct
13	Correct	188 ms	183916 KB	Output is correct
14	Correct	180 ms	183916 KB	Output is correct
15	Correct	175 ms	183916 KB	Output is correct
16	Correct	171 ms	183916 KB	Output is correct
17	Correct	184 ms	183916 KB	Output is correct
18	Correct	185 ms	183916 KB	Output is correct
19	Correct	183 ms	183916 KB	Output is correct
20	Correct	190 ms	183932 KB	Output is correct
21	Correct	173 ms	183932 KB	Output is correct
22	Correct	172 ms	183932 KB	Output is correct
23	Correct	188 ms	183932 KB	Output is correct
24	Correct	196 ms	183932 KB	Output is correct
25	Correct	167 ms	183932 KB	Output is correct
26	Correct	189 ms	183932 KB	Output is correct
27	Correct	181 ms	183932 KB	Output is correct
28	Correct	189 ms	183932 KB	Output is correct
29	Correct	212 ms	183932 KB	Output is correct
30	Correct	195 ms	183932 KB	Output is correct
31	Correct	3328 ms	253432 KB	Output is correct
32	Correct	608 ms	253432 KB	Output is correct
33	Correct	2136 ms	253432 KB	Output is correct
34	Correct	2976 ms	255552 KB	Output is correct
35	Correct	2787 ms	255552 KB	Output is correct
36	Correct	2136 ms	255552 KB	Output is correct
37	Correct	1804 ms	255552 KB	Output is correct
38	Correct	1732 ms	255552 KB	Output is correct
39	Correct	1040 ms	255552 KB	Output is correct
40	Correct	1110 ms	255552 KB	Output is correct
41	Correct	1885 ms	255552 KB	Output is correct
42	Correct	1768 ms	255552 KB	Output is correct
43	Correct	253 ms	255552 KB	Output is correct
44	Correct	1884 ms	255552 KB	Output is correct
45	Correct	1843 ms	255552 KB	Output is correct
46	Correct	1900 ms	255552 KB	Output is correct
47	Correct	865 ms	255552 KB	Output is correct
48	Correct	929 ms	255552 KB	Output is correct
49	Correct	1132 ms	255552 KB	Output is correct
50	Correct	1014 ms	255552 KB	Output is correct
51	Correct	1292 ms	255552 KB	Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	165 ms	183288 KB	Output is correct
2	Correct	172 ms	183444 KB	Output is correct
3	Correct	162 ms	183472 KB	Output is correct
4	Correct	166 ms	183508 KB	Output is correct
5	Correct	177 ms	183684 KB	Output is correct
6	Correct	169 ms	183696 KB	Output is correct
7	Correct	162 ms	183696 KB	Output is correct
8	Correct	177 ms	183756 KB	Output is correct
9	Correct	169 ms	183756 KB	Output is correct
10	Correct	179 ms	183840 KB	Output is correct
11	Correct	175 ms	183840 KB	Output is correct
12	Correct	190 ms	183840 KB	Output is correct
13	Correct	188 ms	183916 KB	Output is correct
14	Correct	180 ms	183916 KB	Output is correct
15	Correct	175 ms	183916 KB	Output is correct
16	Correct	171 ms	183916 KB	Output is correct
17	Correct	184 ms	183916 KB	Output is correct
18	Correct	185 ms	183916 KB	Output is correct
19	Correct	183 ms	183916 KB	Output is correct
20	Correct	190 ms	183932 KB	Output is correct
21	Correct	173 ms	183932 KB	Output is correct
22	Correct	172 ms	183932 KB	Output is correct
23	Correct	188 ms	183932 KB	Output is correct
24	Correct	196 ms	183932 KB	Output is correct
25	Correct	167 ms	183932 KB	Output is correct
26	Correct	189 ms	183932 KB	Output is correct
27	Correct	181 ms	183932 KB	Output is correct
28	Correct	189 ms	183932 KB	Output is correct
29	Correct	212 ms	183932 KB	Output is correct
30	Correct	195 ms	183932 KB	Output is correct
31	Correct	3328 ms	253432 KB	Output is correct
32	Correct	608 ms	253432 KB	Output is correct
33	Correct	2136 ms	253432 KB	Output is correct
34	Correct	2976 ms	255552 KB	Output is correct
35	Correct	2787 ms	255552 KB	Output is correct
36	Correct	2136 ms	255552 KB	Output is correct
37	Correct	1804 ms	255552 KB	Output is correct
38	Correct	1732 ms	255552 KB	Output is correct
39	Correct	1040 ms	255552 KB	Output is correct
40	Correct	1110 ms	255552 KB	Output is correct
41	Correct	1885 ms	255552 KB	Output is correct
42	Correct	1768 ms	255552 KB	Output is correct
43	Correct	253 ms	255552 KB	Output is correct
44	Correct	1884 ms	255552 KB	Output is correct
45	Correct	1843 ms	255552 KB	Output is correct
46	Correct	1900 ms	255552 KB	Output is correct
47	Correct	865 ms	255552 KB	Output is correct
48	Correct	929 ms	255552 KB	Output is correct
49	Correct	1132 ms	255552 KB	Output is correct
50	Correct	1014 ms	255552 KB	Output is correct
51	Correct	1292 ms	255552 KB	Output is correct
52	Correct	467 ms	255552 KB	Output is correct
53	Correct	409 ms	255552 KB	Output is correct
54	Correct	1409 ms	255552 KB	Output is correct
55	Correct	1318 ms	255552 KB	Output is correct
56	Correct	1130 ms	255552 KB	Output is correct
57	Correct	1603 ms	255552 KB	Output is correct
58	Correct	1275 ms	255552 KB	Output is correct
59	Correct	1030 ms	255552 KB	Output is correct
60	Correct	1471 ms	255552 KB	Output is correct
61	Correct	232 ms	255552 KB	Output is correct
62	Correct	489 ms	255552 KB	Output is correct
63	Correct	1004 ms	255552 KB	Output is correct
64	Correct	1080 ms	255552 KB	Output is correct
65	Correct	1406 ms	255552 KB	Output is correct
66	Correct	1739 ms	255552 KB	Output is correct
67	Correct	502 ms	255552 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	165 ms	183288 KB	Output is correct
2	Correct	172 ms	183444 KB	Output is correct
3	Correct	162 ms	183472 KB	Output is correct
4	Correct	166 ms	183508 KB	Output is correct
5	Correct	177 ms	183684 KB	Output is correct
6	Correct	169 ms	183696 KB	Output is correct
7	Correct	162 ms	183696 KB	Output is correct
8	Correct	177 ms	183756 KB	Output is correct
9	Correct	169 ms	183756 KB	Output is correct
10	Correct	179 ms	183840 KB	Output is correct
11	Correct	175 ms	183840 KB	Output is correct
12	Correct	190 ms	183840 KB	Output is correct
13	Correct	188 ms	183916 KB	Output is correct
14	Correct	180 ms	183916 KB	Output is correct
15	Correct	175 ms	183916 KB	Output is correct
16	Correct	171 ms	183916 KB	Output is correct
17	Correct	184 ms	183916 KB	Output is correct
18	Correct	185 ms	183916 KB	Output is correct
19	Correct	183 ms	183916 KB	Output is correct
20	Correct	190 ms	183932 KB	Output is correct
21	Correct	173 ms	183932 KB	Output is correct
22	Correct	172 ms	183932 KB	Output is correct
23	Correct	188 ms	183932 KB	Output is correct
24	Correct	196 ms	183932 KB	Output is correct
25	Correct	167 ms	183932 KB	Output is correct
26	Correct	189 ms	183932 KB	Output is correct
27	Correct	181 ms	183932 KB	Output is correct
28	Correct	189 ms	183932 KB	Output is correct
29	Correct	212 ms	183932 KB	Output is correct
30	Correct	195 ms	183932 KB	Output is correct
31	Correct	3328 ms	253432 KB	Output is correct
32	Correct	608 ms	253432 KB	Output is correct
33	Correct	2136 ms	253432 KB	Output is correct
34	Correct	2976 ms	255552 KB	Output is correct
35	Correct	2787 ms	255552 KB	Output is correct
36	Correct	2136 ms	255552 KB	Output is correct
37	Correct	1804 ms	255552 KB	Output is correct
38	Correct	1732 ms	255552 KB	Output is correct
39	Correct	1040 ms	255552 KB	Output is correct
40	Correct	1110 ms	255552 KB	Output is correct
41	Correct	1885 ms	255552 KB	Output is correct
42	Correct	1768 ms	255552 KB	Output is correct
43	Correct	253 ms	255552 KB	Output is correct
44	Correct	1884 ms	255552 KB	Output is correct
45	Correct	1843 ms	255552 KB	Output is correct
46	Correct	1900 ms	255552 KB	Output is correct
47	Correct	865 ms	255552 KB	Output is correct
48	Correct	929 ms	255552 KB	Output is correct
49	Correct	1132 ms	255552 KB	Output is correct
50	Correct	1014 ms	255552 KB	Output is correct
51	Correct	1292 ms	255552 KB	Output is correct
52	Incorrect	2139 ms	255552 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

답안 #66022

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