답안 #66475 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66475	2018-08-10T18:20:37 Z	Benq	새 집 (APIO18_new_home)	C++11	80 / 100	5000 ms	556480 KB

new_home

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 300001;

void checkmx(int& a, int b) { a = max(a,b); }
void checkmn(int& a, int b) { a = min(a,b); }

int getPos(vi& v, int x) { return ub(all(v),x)-v.begin()-1; }

template<int SZ> struct seg {
    vector<array<int,4>> todo; // query minimum, interval min operations
    vi num;
    int mx[2][SZ];

    void pull(int ind) {
        F0R(i,2) mx[i][ind] = max(mx[i][2*ind],mx[i][2*ind+1]);
        int t = min(mx[0][2*ind],mx[0][2*ind+1]);
        if (t != mx[0][ind]) checkmx(t,mx[1][ind]);
    }
    
    void build(int ind, int L, int R) {
        if (L == R) { mx[0][ind] = 2*MOD; mx[1][ind] = -2*MOD; return; } 
        int M = (L+R)/2;
        build(2*ind,L,M); build(2*ind+1,M+1,R);
        pull(ind);
    }
    
    void build() {
        num.pb(-MOD);
        for (auto a: todo) num.pb(a[2]), num.pb(a[3]+1);
        sort(all(num)); num.erase(unique(all(num)),num.end());
        build(1,0,sz(num)-1);
    }
    
    void push(int ind, int L, int R) {
        if (L == R) return;
        F0R(i,2) checkmn(mx[0][2*ind+i],mx[0][ind]); 
    }
    
    void modify(int x, int y, int t, int ind, int L, int R) {
        if (R < x || y < L || mx[0][ind] <= t) return;
        push(ind,L,R);
        if (x <= L && R <= y && mx[1][ind] < t) { mx[0][ind] = t; return; }
        if (L == R) return;
        int M = (L+R)/2;
        modify(x,y,t,2*ind,L,M);
        modify(x,y,t,2*ind+1,M+1,R);
        pull(ind);
    }
    
    void modify(int x, int y, int t) {
        // cout << "OOPS " << x << " " << y << " " << t << " " << getPos(num,x) << " " << getPos(num,y) << "\n";
        modify(getPos(num,x),getPos(num,y),t,1,0,sz(num)-1);
    }
    
    int query(int x, int ind, int L, int R) {
        push(ind,L,R);
        if (L == R) return mx[0][ind];
        int M = (L+R)/2;
        if (x <= M) return query(x,2*ind,L,M);
        return query(x,2*ind+1,M+1,R);
    }
    
    int query(int x) { 
        // cout << "HUH " << getPos(num,x) << "\n";
        return query(getPos(num,x),1,0,sz(num)-1); 
    }
};

int n,k,q, ans[MX];

seg<1<<20> S[2];
map<pi,int> type[MX];
vector<array<int,5>> mod;
vector<array<int,3>> query;

ostream& operator <<(ostream& os, const pair<pi,int>& p) {
    os << p.f.f << " " << p.f.s << " " << p.s << " | ";
    return os;
}

void ins(int x, pair<pi,int> a, pair<pi,int> b) {
    // cout << x << " | " << a << b << "\n";
    if (a.f.f == -MOD && b.f.f == MOD) {
        S[0].todo.pb({MOD,-MOD,a.s,x});
        S[1].todo.pb({-MOD,MOD,a.s,x});
    } else {
        S[0].todo.pb({(a.f.f+b.f.f)/2,a.f.f,a.s,x}); // all x <= (a.f.f+b.f.f)/2
        S[1].todo.pb({(a.f.f+b.f.f)/2+1,b.f.f,a.s,x});
    }
}

void init() {
    ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> k >> q;
	F0R(i,n) {
		int x,t,a,b; cin >> x >> t >> a >> b;
		mod.pb({a,1,t,x,i});
		mod.pb({b+1,-1,t,x,i});
	}   
	FOR(i,1,k+1) type[i][{-MOD,-1}] = type[i][{MOD,-1}] = 1;
	sort(all(mod));
	for (auto a: mod) {
	    pi t = {a[3],a[4]};
	    if (a[1] == 1) {
	        type[a[2]][t] = 0;
	        auto it = type[a[2]].find(t);
	        ins(a[0]-1,*prev(it),*next(it));
	        prev(it)->s = it->s = a[0];
	    } else {
	        auto it = type[a[2]].find(t);
	        ins(a[0]-1,*prev(it),*it);
	        ins(a[0]-1,*it,*next(it));
	        prev(it)->s = a[0];
	        type[a[2]].erase(it);
	    }
	}
	FOR(i,1,k+1) ins(1e8,*type[i].begin(),*type[i].rbegin());
}

void solve0() {
	sort(query.rbegin(),query.rend());
	S[0].build();
    sort(all(S[0].todo));
    for (auto a: query) {
        while (sz(S[0].todo)) {
            auto x = S[0].todo.back();
            if (x[0] < a[0]) break;
            // cout << "HI " << x[0] << " " << x[1] << " " << x[2] << " " << x[3] << "\n";
            S[0].modify(x[2],x[3],x[1]);
            S[0].todo.pop_back();
        }
        // cout << "IH " << a[0] << " "<< a[1] << " " << S[0].query(a[1]) << "\n";
        checkmx(ans[a[2]],a[0]-S[0].query(a[1]));
    }
}

void solve1() {
    sort(all(query));
    S[1].build();
    sort(all(S[1].todo)); reverse(all(S[1].todo));
    for (auto a: query) {
        while (sz(S[1].todo)) {
            auto x = S[1].todo.back();
            if (x[0] > a[0]) break;
            S[1].modify(x[2],x[3],-x[1]);
            S[1].todo.pop_back();
        }
        checkmx(ans[a[2]],-S[1].query(a[1])-a[0]);
    }
}

int main() {
    init();
	F0R(i,q) {
		int l,y; cin >> l >> y;
		query.pb({l,y,i});
	}
	solve0();
	solve1();
	F0R(i,q) {
	    if (ans[i] > (1e8)) cout << -1;
	    else cout << ans[i];
	    cout << "\n";
	}
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	14456 KB	Output is correct
2	Correct	14 ms	14564 KB	Output is correct
3	Correct	16 ms	14744 KB	Output is correct
4	Correct	16 ms	14744 KB	Output is correct
5	Correct	15 ms	14868 KB	Output is correct
6	Correct	20 ms	15096 KB	Output is correct
7	Correct	20 ms	15096 KB	Output is correct
8	Correct	17 ms	15228 KB	Output is correct
9	Correct	15 ms	15228 KB	Output is correct
10	Correct	15 ms	15228 KB	Output is correct
11	Correct	16 ms	15228 KB	Output is correct
12	Correct	18 ms	15228 KB	Output is correct
13	Correct	20 ms	15228 KB	Output is correct
14	Correct	16 ms	15228 KB	Output is correct
15	Correct	16 ms	15336 KB	Output is correct
16	Correct	19 ms	15336 KB	Output is correct
17	Correct	18 ms	15448 KB	Output is correct
18	Correct	19 ms	15448 KB	Output is correct
19	Correct	19 ms	15448 KB	Output is correct
20	Correct	18 ms	15448 KB	Output is correct
21	Correct	17 ms	15456 KB	Output is correct
22	Correct	19 ms	15476 KB	Output is correct
23	Correct	15 ms	15476 KB	Output is correct
24	Correct	15 ms	15516 KB	Output is correct
25	Correct	19 ms	15516 KB	Output is correct
26	Correct	18 ms	15516 KB	Output is correct
27	Correct	17 ms	15516 KB	Output is correct
28	Correct	18 ms	15560 KB	Output is correct
29	Correct	19 ms	15576 KB	Output is correct
30	Correct	18 ms	15624 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	14456 KB	Output is correct
2	Correct	14 ms	14564 KB	Output is correct
3	Correct	16 ms	14744 KB	Output is correct
4	Correct	16 ms	14744 KB	Output is correct
5	Correct	15 ms	14868 KB	Output is correct
6	Correct	20 ms	15096 KB	Output is correct
7	Correct	20 ms	15096 KB	Output is correct
8	Correct	17 ms	15228 KB	Output is correct
9	Correct	15 ms	15228 KB	Output is correct
10	Correct	15 ms	15228 KB	Output is correct
11	Correct	16 ms	15228 KB	Output is correct
12	Correct	18 ms	15228 KB	Output is correct
13	Correct	20 ms	15228 KB	Output is correct
14	Correct	16 ms	15228 KB	Output is correct
15	Correct	16 ms	15336 KB	Output is correct
16	Correct	19 ms	15336 KB	Output is correct
17	Correct	18 ms	15448 KB	Output is correct
18	Correct	19 ms	15448 KB	Output is correct
19	Correct	19 ms	15448 KB	Output is correct
20	Correct	18 ms	15448 KB	Output is correct
21	Correct	17 ms	15456 KB	Output is correct
22	Correct	19 ms	15476 KB	Output is correct
23	Correct	15 ms	15476 KB	Output is correct
24	Correct	15 ms	15516 KB	Output is correct
25	Correct	19 ms	15516 KB	Output is correct
26	Correct	18 ms	15516 KB	Output is correct
27	Correct	17 ms	15516 KB	Output is correct
28	Correct	18 ms	15560 KB	Output is correct
29	Correct	19 ms	15576 KB	Output is correct
30	Correct	18 ms	15624 KB	Output is correct
31	Correct	454 ms	37200 KB	Output is correct
32	Correct	257 ms	37200 KB	Output is correct
33	Correct	531 ms	41072 KB	Output is correct
34	Correct	446 ms	44004 KB	Output is correct
35	Correct	483 ms	46652 KB	Output is correct
36	Correct	534 ms	49724 KB	Output is correct
37	Correct	414 ms	52500 KB	Output is correct
38	Correct	526 ms	55384 KB	Output is correct
39	Correct	423 ms	58048 KB	Output is correct
40	Correct	440 ms	60836 KB	Output is correct
41	Correct	439 ms	64116 KB	Output is correct
42	Correct	396 ms	66876 KB	Output is correct
43	Correct	190 ms	66876 KB	Output is correct
44	Correct	404 ms	72352 KB	Output is correct
45	Correct	385 ms	75068 KB	Output is correct
46	Correct	399 ms	77944 KB	Output is correct
47	Correct	279 ms	80048 KB	Output is correct
48	Correct	287 ms	82744 KB	Output is correct
49	Correct	300 ms	85832 KB	Output is correct
50	Correct	321 ms	89052 KB	Output is correct
51	Correct	327 ms	91632 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1119 ms	172052 KB	Output is correct
2	Correct	1051 ms	175300 KB	Output is correct
3	Correct	1251 ms	258820 KB	Output is correct
4	Correct	1049 ms	258820 KB	Output is correct
5	Correct	1109 ms	258820 KB	Output is correct
6	Correct	1298 ms	258820 KB	Output is correct
7	Correct	1250 ms	311036 KB	Output is correct
8	Correct	1166 ms	311036 KB	Output is correct
9	Correct	1018 ms	311036 KB	Output is correct
10	Correct	925 ms	311036 KB	Output is correct
11	Correct	939 ms	311036 KB	Output is correct
12	Correct	898 ms	311036 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2378 ms	329792 KB	Output is correct
2	Correct	1229 ms	329792 KB	Output is correct
3	Correct	2808 ms	342084 KB	Output is correct
4	Correct	2742 ms	410704 KB	Output is correct
5	Correct	2279 ms	410704 KB	Output is correct
6	Correct	2355 ms	410704 KB	Output is correct
7	Correct	3130 ms	410704 KB	Output is correct
8	Correct	2937 ms	410704 KB	Output is correct
9	Correct	2583 ms	458832 KB	Output is correct
10	Correct	2429 ms	458832 KB	Output is correct
11	Correct	2393 ms	458832 KB	Output is correct
12	Correct	2456 ms	458832 KB	Output is correct
13	Correct	1799 ms	458832 KB	Output is correct
14	Correct	1887 ms	458832 KB	Output is correct
15	Correct	1804 ms	458832 KB	Output is correct
16	Correct	1867 ms	463068 KB	Output is correct
17	Correct	1995 ms	473476 KB	Output is correct

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	14456 KB	Output is correct
2	Correct	14 ms	14564 KB	Output is correct
3	Correct	16 ms	14744 KB	Output is correct
4	Correct	16 ms	14744 KB	Output is correct
5	Correct	15 ms	14868 KB	Output is correct
6	Correct	20 ms	15096 KB	Output is correct
7	Correct	20 ms	15096 KB	Output is correct
8	Correct	17 ms	15228 KB	Output is correct
9	Correct	15 ms	15228 KB	Output is correct
10	Correct	15 ms	15228 KB	Output is correct
11	Correct	16 ms	15228 KB	Output is correct
12	Correct	18 ms	15228 KB	Output is correct
13	Correct	20 ms	15228 KB	Output is correct
14	Correct	16 ms	15228 KB	Output is correct
15	Correct	16 ms	15336 KB	Output is correct
16	Correct	19 ms	15336 KB	Output is correct
17	Correct	18 ms	15448 KB	Output is correct
18	Correct	19 ms	15448 KB	Output is correct
19	Correct	19 ms	15448 KB	Output is correct
20	Correct	18 ms	15448 KB	Output is correct
21	Correct	17 ms	15456 KB	Output is correct
22	Correct	19 ms	15476 KB	Output is correct
23	Correct	15 ms	15476 KB	Output is correct
24	Correct	15 ms	15516 KB	Output is correct
25	Correct	19 ms	15516 KB	Output is correct
26	Correct	18 ms	15516 KB	Output is correct
27	Correct	17 ms	15516 KB	Output is correct
28	Correct	18 ms	15560 KB	Output is correct
29	Correct	19 ms	15576 KB	Output is correct
30	Correct	18 ms	15624 KB	Output is correct
31	Correct	454 ms	37200 KB	Output is correct
32	Correct	257 ms	37200 KB	Output is correct
33	Correct	531 ms	41072 KB	Output is correct
34	Correct	446 ms	44004 KB	Output is correct
35	Correct	483 ms	46652 KB	Output is correct
36	Correct	534 ms	49724 KB	Output is correct
37	Correct	414 ms	52500 KB	Output is correct
38	Correct	526 ms	55384 KB	Output is correct
39	Correct	423 ms	58048 KB	Output is correct
40	Correct	440 ms	60836 KB	Output is correct
41	Correct	439 ms	64116 KB	Output is correct
42	Correct	396 ms	66876 KB	Output is correct
43	Correct	190 ms	66876 KB	Output is correct
44	Correct	404 ms	72352 KB	Output is correct
45	Correct	385 ms	75068 KB	Output is correct
46	Correct	399 ms	77944 KB	Output is correct
47	Correct	279 ms	80048 KB	Output is correct
48	Correct	287 ms	82744 KB	Output is correct
49	Correct	300 ms	85832 KB	Output is correct
50	Correct	321 ms	89052 KB	Output is correct
51	Correct	327 ms	91632 KB	Output is correct
52	Correct	502 ms	473476 KB	Output is correct
53	Correct	517 ms	473476 KB	Output is correct
54	Correct	455 ms	473476 KB	Output is correct
55	Correct	441 ms	473476 KB	Output is correct
56	Correct	459 ms	473476 KB	Output is correct
57	Correct	427 ms	473476 KB	Output is correct
58	Correct	425 ms	473476 KB	Output is correct
59	Correct	444 ms	473476 KB	Output is correct
60	Correct	425 ms	473476 KB	Output is correct
61	Correct	216 ms	473476 KB	Output is correct
62	Correct	529 ms	473476 KB	Output is correct
63	Correct	534 ms	473476 KB	Output is correct
64	Correct	478 ms	473476 KB	Output is correct
65	Correct	422 ms	473476 KB	Output is correct
66	Correct	459 ms	473476 KB	Output is correct
67	Correct	253 ms	473476 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	14456 KB	Output is correct
2	Correct	14 ms	14564 KB	Output is correct
3	Correct	16 ms	14744 KB	Output is correct
4	Correct	16 ms	14744 KB	Output is correct
5	Correct	15 ms	14868 KB	Output is correct
6	Correct	20 ms	15096 KB	Output is correct
7	Correct	20 ms	15096 KB	Output is correct
8	Correct	17 ms	15228 KB	Output is correct
9	Correct	15 ms	15228 KB	Output is correct
10	Correct	15 ms	15228 KB	Output is correct
11	Correct	16 ms	15228 KB	Output is correct
12	Correct	18 ms	15228 KB	Output is correct
13	Correct	20 ms	15228 KB	Output is correct
14	Correct	16 ms	15228 KB	Output is correct
15	Correct	16 ms	15336 KB	Output is correct
16	Correct	19 ms	15336 KB	Output is correct
17	Correct	18 ms	15448 KB	Output is correct
18	Correct	19 ms	15448 KB	Output is correct
19	Correct	19 ms	15448 KB	Output is correct
20	Correct	18 ms	15448 KB	Output is correct
21	Correct	17 ms	15456 KB	Output is correct
22	Correct	19 ms	15476 KB	Output is correct
23	Correct	15 ms	15476 KB	Output is correct
24	Correct	15 ms	15516 KB	Output is correct
25	Correct	19 ms	15516 KB	Output is correct
26	Correct	18 ms	15516 KB	Output is correct
27	Correct	17 ms	15516 KB	Output is correct
28	Correct	18 ms	15560 KB	Output is correct
29	Correct	19 ms	15576 KB	Output is correct
30	Correct	18 ms	15624 KB	Output is correct
31	Correct	454 ms	37200 KB	Output is correct
32	Correct	257 ms	37200 KB	Output is correct
33	Correct	531 ms	41072 KB	Output is correct
34	Correct	446 ms	44004 KB	Output is correct
35	Correct	483 ms	46652 KB	Output is correct
36	Correct	534 ms	49724 KB	Output is correct
37	Correct	414 ms	52500 KB	Output is correct
38	Correct	526 ms	55384 KB	Output is correct
39	Correct	423 ms	58048 KB	Output is correct
40	Correct	440 ms	60836 KB	Output is correct
41	Correct	439 ms	64116 KB	Output is correct
42	Correct	396 ms	66876 KB	Output is correct
43	Correct	190 ms	66876 KB	Output is correct
44	Correct	404 ms	72352 KB	Output is correct
45	Correct	385 ms	75068 KB	Output is correct
46	Correct	399 ms	77944 KB	Output is correct
47	Correct	279 ms	80048 KB	Output is correct
48	Correct	287 ms	82744 KB	Output is correct
49	Correct	300 ms	85832 KB	Output is correct
50	Correct	321 ms	89052 KB	Output is correct
51	Correct	327 ms	91632 KB	Output is correct
52	Correct	1119 ms	172052 KB	Output is correct
53	Correct	1051 ms	175300 KB	Output is correct
54	Correct	1251 ms	258820 KB	Output is correct
55	Correct	1049 ms	258820 KB	Output is correct
56	Correct	1109 ms	258820 KB	Output is correct
57	Correct	1298 ms	258820 KB	Output is correct
58	Correct	1250 ms	311036 KB	Output is correct
59	Correct	1166 ms	311036 KB	Output is correct
60	Correct	1018 ms	311036 KB	Output is correct
61	Correct	925 ms	311036 KB	Output is correct
62	Correct	939 ms	311036 KB	Output is correct
63	Correct	898 ms	311036 KB	Output is correct
64	Correct	2378 ms	329792 KB	Output is correct
65	Correct	1229 ms	329792 KB	Output is correct
66	Correct	2808 ms	342084 KB	Output is correct
67	Correct	2742 ms	410704 KB	Output is correct
68	Correct	2279 ms	410704 KB	Output is correct
69	Correct	2355 ms	410704 KB	Output is correct
70	Correct	3130 ms	410704 KB	Output is correct
71	Correct	2937 ms	410704 KB	Output is correct
72	Correct	2583 ms	458832 KB	Output is correct
73	Correct	2429 ms	458832 KB	Output is correct
74	Correct	2393 ms	458832 KB	Output is correct
75	Correct	2456 ms	458832 KB	Output is correct
76	Correct	1799 ms	458832 KB	Output is correct
77	Correct	1887 ms	458832 KB	Output is correct
78	Correct	1804 ms	458832 KB	Output is correct
79	Correct	1867 ms	463068 KB	Output is correct
80	Correct	1995 ms	473476 KB	Output is correct
81	Correct	502 ms	473476 KB	Output is correct
82	Correct	517 ms	473476 KB	Output is correct
83	Correct	455 ms	473476 KB	Output is correct
84	Correct	441 ms	473476 KB	Output is correct
85	Correct	459 ms	473476 KB	Output is correct
86	Correct	427 ms	473476 KB	Output is correct
87	Correct	425 ms	473476 KB	Output is correct
88	Correct	444 ms	473476 KB	Output is correct
89	Correct	425 ms	473476 KB	Output is correct
90	Correct	216 ms	473476 KB	Output is correct
91	Correct	529 ms	473476 KB	Output is correct
92	Correct	534 ms	473476 KB	Output is correct
93	Correct	478 ms	473476 KB	Output is correct
94	Correct	422 ms	473476 KB	Output is correct
95	Correct	459 ms	473476 KB	Output is correct
96	Correct	253 ms	473476 KB	Output is correct
97	Execution timed out	5107 ms	556480 KB	Time limit exceeded
98	Halted	0 ms	0 KB	-

답안 #66475

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 23.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
10.0 / 10.0

Subtask #4
23.0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0