oj.uz

답안 #104119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104119 2019-04-04T06:34:30 Z dimash241 새 집 (APIO18_new_home) C++17
12 / 100
 5000 ms 161504 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;
inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; } 
inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, q, k;
int x[N], t[N], a[N], b[N];
int l[N], y[N];
int ans[N];
vector < int > pp;
map < int, int > M;

int get(int x) {
    auto it = M.lower_bound(x);
    int m = 0;
    if (it != M.end()) m = max(m,it->second-(it->first-x));
    if (it != M.begin()) it--,m = max(m,it->second-(x-it->first));
    return m;
}
void ins(int x,int h) {
    if (get(x) >= h) return ;
    auto it = M.lower_bound(x);
    while (it != M.end()) {
        if (it->second > h-(it->first-x)) break;
        else it = M.erase(it);
    }
    M[x] = h;
    it = M.find(x);
    while (1) {
        if (it == M.begin()) break;
        it--;
        if (it->second > h-(x-it->first)) break;
        else it = M.erase(it);
    }
}

inline void solve () {
	for (int i = 1; i <= n; i ++)
		pp.pb(a[i]), pp.pb(b[i]);
	for (int i = 1; i <= q; i ++) {
		pp.pb(y[i]);
	}
	sort(every(pp));
	pp.resize(unique(every(pp)) - pp.begin());
	vector < vector < pair < int, int > > > add(pp.size() + 2);
	vector < vector < pair < int, int > > > del(pp.size() + 2);
	vector < vector < pair < int, int > > > query(pp.size() + 2);
	multiset < int > bl[k + 1];
	for (int i = 1; i <= k; i ++)
		bl[i].clear();
	for (int i = 1; i <= n; i ++) {
		a[i] = lower_bound(every(pp), a[i]) - pp.begin();
		b[i] = lower_bound(every(pp), b[i]) - pp.begin();
		add[a[i]].pb(mp(x[i], t[i]));
		del[b[i]].pb(mp(x[i], t[i]));
	}

	for (int i = 1; i <= q; i ++) {
		y[i] = lower_bound(every(pp), y[i]) - pp.begin();
		query[y[i]].pb(mp(l[i], i));
	}

	for (int vv = 0; vv < pp.size(); vv ++) {

		for (auto it : add[vv]) bl[it.S].insert(it.F);

		for (auto q : query[vv]) {
			int res = 0;
			for (int w = 1; w <= k; w ++) {
				if (bl[w].empty()) {
					res = -1;
					break;
				}

				int cur = inf;
				auto l = bl[w].upper_bound(q.F);
				if (l != bl[w].end()) {
					cur = min(cur, *l - q.F); 
				}
				if (l != bl[w].begin()) {
					--l;
					cur = min(cur, q.F - *l);
				}
		//		cout << cur << ' ' << w << '\n';
				res = max(res, cur);
			}
			ans[q.S] = res;
		}

		for (auto it : del[vv]) bl[it.S].erase(bl[it.S].find(it.F));
	}
	for (int i = 1; i <= q; i ++)
		cout << ans[i] << '\n';
}
multiset < int > bl[N];

int main () {
	SpeedForce;             
    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 >> l[i] >> y[i];
    }
    if (k < 500) {
    	solve();
    	exit(0);
    }
    for (int i = 1; i <= n; i ++)
		pp.pb(a[i]), pp.pb(b[i]);
	for (int i = 1; i <= q; i ++) {
		pp.pb(y[i]);
	}
	sort(every(pp));
	pp.resize(unique(every(pp)) - pp.begin());
	vector < vector < pair < int, int > > > add(pp.size() + 2);
	vector < vector < pair < int, int > > > del(pp.size() + 2);
	vector < vector < pair < int, int > > > query(pp.size() + 2);
	for (int i = 1; i <= n; i ++) {
		a[i] = lower_bound(every(pp), a[i]) - pp.begin();
		b[i] = lower_bound(every(pp), b[i]) - pp.begin();
		add[a[i]].pb(mp(x[i], t[i]));
		del[b[i]].pb(mp(x[i], t[i]));
	}

	for (int i = 1; i <= q; i ++) {
		y[i] = lower_bound(every(pp), y[i]) - pp.begin();
		query[y[i]].pb(mp(l[i], i));
	}
	for (int i = 0; i < pp.size(); i ++)
		sort(every(add[i])),sort(every(del[i])), sort(every(query[i])); 
	
	
	 
	
	int f = 0;
    for (int i = 0; i < pp.size(); i++) {
    	for (auto it : add[i]) bl[it.S].insert(it.F); 
        if (!f) {
           for (int j = 1; j <= k; j++) {
                bl[j].insert(-3e8);
                bl[j].insert(3e8);
                for (auto it = ++bl[j].begin(); it != bl[j].end(); it++) {
               		auto it2 = it;
                    it2 --;
                    ins(*it + *it2,*it - *it2);
           		}
           }         
           f = 1;
      	}
      	for (auto it : query[i])
      		ans[it.S] = get(2 * it.F)/2;
      	for (auto id : del[i]) {
        	int p = id.S;
            auto it = bl[p].find(id.F);
            auto it2 = it;
            it++,it2--;
            ins(*it+*it2,*it-*it2);
            bl[p].erase(bl[p].find(id.F));
                
    	}
    }
	for (int i = 1; i <= q; i ++) {
		if (ans[i] > 1e8) ans[i] = -1;
		cout << ans[i] << '\n';
	}
    return Accepted;
}

// B...a D....

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:100:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int vv = 0; vv < pp.size(); vv ++) {
                   ~~~^~~~~~~~~~~
new_home.cpp: In function 'int main()':
new_home.cpp:168:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < pp.size(); i ++)
                  ~~^~~~~~~~~~~
new_home.cpp:175:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < pp.size(); i++) {
                     ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 28536 KB Output is correct
2 Correct 32 ms 28536 KB Output is correct
3 Correct 35 ms 28544 KB Output is correct
4 Correct 28 ms 28672 KB Output is correct
5 Correct 31 ms 28664 KB Output is correct
6 Correct 29 ms 28800 KB Output is correct
7 Correct 28 ms 28800 KB Output is correct
8 Correct 30 ms 28808 KB Output is correct
9 Correct 33 ms 28800 KB Output is correct
10 Correct 34 ms 28800 KB Output is correct
11 Correct 36 ms 28672 KB Output is correct
12 Correct 32 ms 28928 KB Output is correct
13 Correct 30 ms 28800 KB Output is correct
14 Correct 30 ms 28772 KB Output is correct
15 Correct 33 ms 28800 KB Output is correct
16 Correct 36 ms 28800 KB Output is correct
17 Correct 31 ms 28664 KB Output is correct
18 Correct 32 ms 28792 KB Output is correct
19 Correct 32 ms 28800 KB Output is correct
20 Correct 31 ms 28764 KB Output is correct
21 Correct 35 ms 28664 KB Output is correct
22 Correct 31 ms 28800 KB Output is correct
23 Correct 29 ms 28792 KB Output is correct
24 Correct 32 ms 28664 KB Output is correct
25 Correct 34 ms 28664 KB Output is correct
26 Correct 29 ms 28800 KB Output is correct
27 Correct 31 ms 28664 KB Output is correct
28 Correct 30 ms 28816 KB Output is correct
29 Correct 33 ms 28660 KB Output is correct
30 Correct 30 ms 28672 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 28536 KB Output is correct
2 Correct 32 ms 28536 KB Output is correct
3 Correct 35 ms 28544 KB Output is correct
4 Correct 28 ms 28672 KB Output is correct
5 Correct 31 ms 28664 KB Output is correct
6 Correct 29 ms 28800 KB Output is correct
7 Correct 28 ms 28800 KB Output is correct
8 Correct 30 ms 28808 KB Output is correct
9 Correct 33 ms 28800 KB Output is correct
10 Correct 34 ms 28800 KB Output is correct
11 Correct 36 ms 28672 KB Output is correct
12 Correct 32 ms 28928 KB Output is correct
13 Correct 30 ms 28800 KB Output is correct
14 Correct 30 ms 28772 KB Output is correct
15 Correct 33 ms 28800 KB Output is correct
16 Correct 36 ms 28800 KB Output is correct
17 Correct 31 ms 28664 KB Output is correct
18 Correct 32 ms 28792 KB Output is correct
19 Correct 32 ms 28800 KB Output is correct
20 Correct 31 ms 28764 KB Output is correct
21 Correct 35 ms 28664 KB Output is correct
22 Correct 31 ms 28800 KB Output is correct
23 Correct 29 ms 28792 KB Output is correct
24 Correct 32 ms 28664 KB Output is correct
25 Correct 34 ms 28664 KB Output is correct
26 Correct 29 ms 28800 KB Output is correct
27 Correct 31 ms 28664 KB Output is correct
28 Correct 30 ms 28816 KB Output is correct
29 Correct 33 ms 28660 KB Output is correct
30 Correct 30 ms 28672 KB Output is correct
31 Correct 3257 ms 53600 KB Output is correct
32 Correct 158 ms 34668 KB Output is correct
33 Correct 385 ms 51756 KB Output is correct
34 Correct 2163 ms 51860 KB Output is correct
35 Correct 1717 ms 53708 KB Output is correct
36 Correct 450 ms 53612 KB Output is correct
37 Correct 331 ms 50928 KB Output is correct
38 Correct 213 ms 50772 KB Output is correct
39 Correct 193 ms 50596 KB Output is correct
40 Correct 205 ms 50796 KB Output is correct
41 Correct 408 ms 50796 KB Output is correct
42 Correct 348 ms 50628 KB Output is correct
43 Correct 359 ms 36788 KB Output is correct
44 Correct 364 ms 50924 KB Output is correct
45 Correct 240 ms 50800 KB Output is correct
46 Correct 210 ms 50888 KB Output is correct
47 Correct 157 ms 50052 KB Output is correct
48 Correct 154 ms 49812 KB Output is correct
49 Correct 170 ms 50260 KB Output is correct
50 Correct 278 ms 50544 KB Output is correct
51 Correct 152 ms 50160 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 893 ms 99032 KB Output is correct
2 Correct 4271 ms 103684 KB Output is correct
3 Correct 963 ms 134396 KB Output is correct
4 Correct 953 ms 115340 KB Output is correct
5 Correct 1702 ms 103296 KB Output is correct
6 Correct 2824 ms 103588 KB Output is correct
7 Correct 958 ms 134504 KB Output is correct
8 Correct 866 ms 115328 KB Output is correct
9 Correct 1058 ms 108636 KB Output is correct
10 Execution timed out 5072 ms 102716 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1610 ms 121688 KB Output is correct
2 Correct 825 ms 66656 KB Output is correct
3 Correct 3461 ms 131716 KB Output is correct
4 Correct 1285 ms 160320 KB Output is correct
5 Correct 1239 ms 137528 KB Output is correct
6 Correct 1304 ms 141480 KB Output is correct
7 Correct 1761 ms 131324 KB Output is correct
8 Correct 2668 ms 131660 KB Output is correct
9 Correct 1218 ms 161504 KB Output is correct
10 Correct 1350 ms 140516 KB Output is correct
11 Correct 1682 ms 134852 KB Output is correct
12 Execution timed out 5104 ms 130376 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 28536 KB Output is correct
2 Correct 32 ms 28536 KB Output is correct
3 Correct 35 ms 28544 KB Output is correct
4 Correct 28 ms 28672 KB Output is correct
5 Correct 31 ms 28664 KB Output is correct
6 Correct 29 ms 28800 KB Output is correct
7 Correct 28 ms 28800 KB Output is correct
8 Correct 30 ms 28808 KB Output is correct
9 Correct 33 ms 28800 KB Output is correct
10 Correct 34 ms 28800 KB Output is correct
11 Correct 36 ms 28672 KB Output is correct
12 Correct 32 ms 28928 KB Output is correct
13 Correct 30 ms 28800 KB Output is correct
14 Correct 30 ms 28772 KB Output is correct
15 Correct 33 ms 28800 KB Output is correct
16 Correct 36 ms 28800 KB Output is correct
17 Correct 31 ms 28664 KB Output is correct
18 Correct 32 ms 28792 KB Output is correct
19 Correct 32 ms 28800 KB Output is correct
20 Correct 31 ms 28764 KB Output is correct
21 Correct 35 ms 28664 KB Output is correct
22 Correct 31 ms 28800 KB Output is correct
23 Correct 29 ms 28792 KB Output is correct
24 Correct 32 ms 28664 KB Output is correct
25 Correct 34 ms 28664 KB Output is correct
26 Correct 29 ms 28800 KB Output is correct
27 Correct 31 ms 28664 KB Output is correct
28 Correct 30 ms 28816 KB Output is correct
29 Correct 33 ms 28660 KB Output is correct
30 Correct 30 ms 28672 KB Output is correct
31 Correct 3257 ms 53600 KB Output is correct
32 Correct 158 ms 34668 KB Output is correct
33 Correct 385 ms 51756 KB Output is correct
34 Correct 2163 ms 51860 KB Output is correct
35 Correct 1717 ms 53708 KB Output is correct
36 Correct 450 ms 53612 KB Output is correct
37 Correct 331 ms 50928 KB Output is correct
38 Correct 213 ms 50772 KB Output is correct
39 Correct 193 ms 50596 KB Output is correct
40 Correct 205 ms 50796 KB Output is correct
41 Correct 408 ms 50796 KB Output is correct
42 Correct 348 ms 50628 KB Output is correct
43 Correct 359 ms 36788 KB Output is correct
44 Correct 364 ms 50924 KB Output is correct
45 Correct 240 ms 50800 KB Output is correct
46 Correct 210 ms 50888 KB Output is correct
47 Correct 157 ms 50052 KB Output is correct
48 Correct 154 ms 49812 KB Output is correct
49 Correct 170 ms 50260 KB Output is correct
50 Correct 278 ms 50544 KB Output is correct
51 Correct 152 ms 50160 KB Output is correct
52 Correct 331 ms 59600 KB Output is correct
53 Correct 336 ms 59240 KB Output is correct
54 Incorrect 325 ms 57196 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 28536 KB Output is correct
2 Correct 32 ms 28536 KB Output is correct
3 Correct 35 ms 28544 KB Output is correct
4 Correct 28 ms 28672 KB Output is correct
5 Correct 31 ms 28664 KB Output is correct
6 Correct 29 ms 28800 KB Output is correct
7 Correct 28 ms 28800 KB Output is correct
8 Correct 30 ms 28808 KB Output is correct
9 Correct 33 ms 28800 KB Output is correct
10 Correct 34 ms 28800 KB Output is correct
11 Correct 36 ms 28672 KB Output is correct
12 Correct 32 ms 28928 KB Output is correct
13 Correct 30 ms 28800 KB Output is correct
14 Correct 30 ms 28772 KB Output is correct
15 Correct 33 ms 28800 KB Output is correct
16 Correct 36 ms 28800 KB Output is correct
17 Correct 31 ms 28664 KB Output is correct
18 Correct 32 ms 28792 KB Output is correct
19 Correct 32 ms 28800 KB Output is correct
20 Correct 31 ms 28764 KB Output is correct
21 Correct 35 ms 28664 KB Output is correct
22 Correct 31 ms 28800 KB Output is correct
23 Correct 29 ms 28792 KB Output is correct
24 Correct 32 ms 28664 KB Output is correct
25 Correct 34 ms 28664 KB Output is correct
26 Correct 29 ms 28800 KB Output is correct
27 Correct 31 ms 28664 KB Output is correct
28 Correct 30 ms 28816 KB Output is correct
29 Correct 33 ms 28660 KB Output is correct
30 Correct 30 ms 28672 KB Output is correct
31 Correct 3257 ms 53600 KB Output is correct
32 Correct 158 ms 34668 KB Output is correct
33 Correct 385 ms 51756 KB Output is correct
34 Correct 2163 ms 51860 KB Output is correct
35 Correct 1717 ms 53708 KB Output is correct
36 Correct 450 ms 53612 KB Output is correct
37 Correct 331 ms 50928 KB Output is correct
38 Correct 213 ms 50772 KB Output is correct
39 Correct 193 ms 50596 KB Output is correct
40 Correct 205 ms 50796 KB Output is correct
41 Correct 408 ms 50796 KB Output is correct
42 Correct 348 ms 50628 KB Output is correct
43 Correct 359 ms 36788 KB Output is correct
44 Correct 364 ms 50924 KB Output is correct
45 Correct 240 ms 50800 KB Output is correct
46 Correct 210 ms 50888 KB Output is correct
47 Correct 157 ms 50052 KB Output is correct
48 Correct 154 ms 49812 KB Output is correct
49 Correct 170 ms 50260 KB Output is correct
50 Correct 278 ms 50544 KB Output is correct
51 Correct 152 ms 50160 KB Output is correct
52 Correct 893 ms 99032 KB Output is correct
53 Correct 4271 ms 103684 KB Output is correct
54 Correct 963 ms 134396 KB Output is correct
55 Correct 953 ms 115340 KB Output is correct
56 Correct 1702 ms 103296 KB Output is correct
57 Correct 2824 ms 103588 KB Output is correct
58 Correct 958 ms 134504 KB Output is correct
59 Correct 866 ms 115328 KB Output is correct
60 Correct 1058 ms 108636 KB Output is correct
61 Execution timed out 5072 ms 102716 KB Time limit exceeded
62 Halted 0 ms 0 KB -