답안 #60833 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60833	2018-07-24T19:21:24 Z	duality	새 집 (APIO18_new_home)	C++11	57 / 100	3469 ms	360296 KB

new_home

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

struct event { int time,t,x; };
bool comp(event a,event b) {
    if (a.time == b.time) return a.t < b.t;
    else return a.time < b.time;
}
vi sorted;
vector<event> events;
multiset<int> stores[300000];
multimap<pii,int> M;
vpii tree[1 << 19];
int ans[300000];
int update(int s,int e,int as,int ae,int i,pii p) {
    if (as > ae) return 0;
    else if ((s > ae) || (e < as)) return 0;
    else if ((s >= as) && (e <= ae)) {
        tree[i].pb(p);
        return 0;
    }

    int mid = (s+e) / 2;
    update(s,mid,as,ae,2*i+1,p);
    update(mid+1,e,as,ae,2*i+2,p);
    return 0;
}
int query(int s,int e,int q,int i,pii p) {
    if ((s > q) || (e < q)) return 0;
    else if (s == e) {
        tree[i].pb(p);
        return 0;
    }

    int mid = (s+e) / 2;
    query(s,mid,q,2*i+1,p);
    query(mid+1,e,q,2*i+2,p);
    tree[i].pb(p);
    return 0;
}
int solve(int s,int e,int i) {
    int j,k;
    pii m = mp(-3e8,0);
    sort(tree[i].begin(),tree[i].end());
    for (j = 0; j < tree[i].size(); j++) {
        if (tree[i][j].second >= 0) {
            if (tree[i][j].second > m.second-(tree[i][j].first-m.first)) m = tree[i][j];
        }
        else ans[-tree[i][j].second-1] = max(ans[-tree[i][j].second-1],m.second-(tree[i][j].first-m.first));
    }
    m = mp(3e8,0);
    for (j = tree[i].size()-1; j >= 0; j--) {
        if (tree[i][j].second >= 0) {
            if (tree[i][j].second > m.second-(m.first-tree[i][j].first)) m = tree[i][j];
        }
        else ans[-tree[i][j].second-1] = max(ans[-tree[i][j].second-1],m.second-(m.first-tree[i][j].first));
    }
    if (s != e) {
        int mid = (s+e) / 2;
        solve(s,mid,2*i+1),solve(mid+1,e,2*i+2);
    }
    return 0;
}
int main() {
    int i;
    int n,k,q;
    int x,t,a,b,l,y;
    scanf("%d %d %d",&n,&k,&q);
    sorted.pb(0),sorted.pb(3e8);
    for (i = 0; i < n; i++) {
        scanf("%d %d %d %d",&x,&t,&a,&b);
        events.pb((event){a,t,x});
        events.pb((event){b+1,-t,x});
        sorted.pb(a),sorted.pb(b+1);
    }
    sort(events.begin(),events.end(),comp);
    sort(sorted.begin(),sorted.end());
    sorted.resize(unique(sorted.begin(),sorted.end())-sorted.begin());
    for (i = 0; i < k; i++) {
        stores[i].insert(-3e8),stores[i].insert(3e8);
        M.insert(mp(mp(0,6e8),0));
    }
    for (i = 0; i < events.size(); i++) {
        events[i].time = lower_bound(sorted.begin(),sorted.end(),events[i].time)-sorted.begin();
        if (events[i].t > 0) {
            auto it = stores[events[i].t-1].lower_bound(events[i].x);
            auto it2 = it;
            it2--;
            auto it3 = M.find(mp(*it+*it2,*it-*it2));
            update(0,sorted.size()-2,it3->second,events[i].time-1,0,mp(*it+*it2,*it-*it2));
            M.erase(it3);
            M.insert(mp(mp(*it+events[i].x,*it-events[i].x),events[i].time));
            M.insert(mp(mp(events[i].x+*it2,events[i].x-*it2),events[i].time));
            stores[events[i].t-1].insert(events[i].x);
        }
        else {
            auto it = stores[-events[i].t-1].lower_bound(events[i].x);
            auto it2 = it;
            it2--;
            auto it3 = M.find(mp(*it+*it2,*it-*it2));
            update(0,sorted.size()-2,it3->second,events[i].time-1,0,mp(*it+*it2,*it-*it2));
            M.erase(it3);
            it++,it2++;
            it3 = M.find(mp(*it+*it2,*it-*it2));
            update(0,sorted.size()-2,it3->second,events[i].time-1,0,mp(*it+*it2,*it-*it2));
            M.erase(it3);
            it2--;
            M.insert(mp(mp(*it+*it2,*it-*it2),events[i].time));
            stores[-events[i].t-1].erase(--it);
        }
    }
    while (!M.empty()) {
        update(0,sorted.size()-2,M.begin()->second,sorted.size()-2,0,M.begin()->first);
        M.erase(M.begin());
    }
    for (i = 0; i < q; i++) {
        scanf("%d %d",&l,&y);
        int p = upper_bound(sorted.begin(),sorted.end(),y)-sorted.begin()-1;
        query(0,sorted.size()-2,p,0,mp(2*l,-(i+1)));
    }
    solve(0,sorted.size()-2,0);
    for (i = 0; i < q; i++) printf("%d\n",(ans[i] > 3e8) ? -1:ans[i]/2);

    return 0;
}

Compilation message

new_home.cpp: In function 'int solve(int, int, int)':
new_home.cpp:99:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~
new_home.cpp:96:11: warning: unused variable 'k' [-Wunused-variable]
     int j,k;
           ^
new_home.cpp: In function 'int main()':
new_home.cpp:137:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
new_home.cpp:122:10: 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:125:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d",&x,&t,&a,&b);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:171:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&l,&y);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	26748 KB	Output is correct
2	Correct	29 ms	26808 KB	Output is correct
3	Correct	27 ms	26808 KB	Output is correct
4	Correct	27 ms	26836 KB	Output is correct
5	Correct	28 ms	26880 KB	Output is correct
6	Correct	30 ms	27168 KB	Output is correct
7	Correct	37 ms	27196 KB	Output is correct
8	Correct	35 ms	27196 KB	Output is correct
9	Correct	37 ms	27196 KB	Output is correct
10	Correct	35 ms	27196 KB	Output is correct
11	Correct	27 ms	27196 KB	Output is correct
12	Correct	29 ms	27196 KB	Output is correct
13	Correct	27 ms	27196 KB	Output is correct
14	Correct	28 ms	27196 KB	Output is correct
15	Correct	31 ms	27236 KB	Output is correct
16	Correct	33 ms	27244 KB	Output is correct
17	Correct	35 ms	27244 KB	Output is correct
18	Correct	34 ms	27244 KB	Output is correct
19	Correct	36 ms	27244 KB	Output is correct
20	Correct	35 ms	27244 KB	Output is correct
21	Correct	29 ms	27244 KB	Output is correct
22	Correct	30 ms	27244 KB	Output is correct
23	Correct	28 ms	27244 KB	Output is correct
24	Correct	35 ms	27244 KB	Output is correct
25	Correct	30 ms	27244 KB	Output is correct
26	Correct	27 ms	27244 KB	Output is correct
27	Correct	32 ms	27244 KB	Output is correct
28	Correct	29 ms	27244 KB	Output is correct
29	Correct	34 ms	27244 KB	Output is correct
30	Correct	33 ms	27244 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	26748 KB	Output is correct
2	Correct	29 ms	26808 KB	Output is correct
3	Correct	27 ms	26808 KB	Output is correct
4	Correct	27 ms	26836 KB	Output is correct
5	Correct	28 ms	26880 KB	Output is correct
6	Correct	30 ms	27168 KB	Output is correct
7	Correct	37 ms	27196 KB	Output is correct
8	Correct	35 ms	27196 KB	Output is correct
9	Correct	37 ms	27196 KB	Output is correct
10	Correct	35 ms	27196 KB	Output is correct
11	Correct	27 ms	27196 KB	Output is correct
12	Correct	29 ms	27196 KB	Output is correct
13	Correct	27 ms	27196 KB	Output is correct
14	Correct	28 ms	27196 KB	Output is correct
15	Correct	31 ms	27236 KB	Output is correct
16	Correct	33 ms	27244 KB	Output is correct
17	Correct	35 ms	27244 KB	Output is correct
18	Correct	34 ms	27244 KB	Output is correct
19	Correct	36 ms	27244 KB	Output is correct
20	Correct	35 ms	27244 KB	Output is correct
21	Correct	29 ms	27244 KB	Output is correct
22	Correct	30 ms	27244 KB	Output is correct
23	Correct	28 ms	27244 KB	Output is correct
24	Correct	35 ms	27244 KB	Output is correct
25	Correct	30 ms	27244 KB	Output is correct
26	Correct	27 ms	27244 KB	Output is correct
27	Correct	32 ms	27244 KB	Output is correct
28	Correct	29 ms	27244 KB	Output is correct
29	Correct	34 ms	27244 KB	Output is correct
30	Correct	33 ms	27244 KB	Output is correct
31	Correct	1751 ms	72544 KB	Output is correct
32	Correct	281 ms	72544 KB	Output is correct
33	Correct	1181 ms	72544 KB	Output is correct
34	Correct	1188 ms	74040 KB	Output is correct
35	Correct	1571 ms	82244 KB	Output is correct
36	Correct	1432 ms	84972 KB	Output is correct
37	Correct	897 ms	84972 KB	Output is correct
38	Correct	880 ms	84972 KB	Output is correct
39	Correct	668 ms	84972 KB	Output is correct
40	Correct	659 ms	84972 KB	Output is correct
41	Correct	828 ms	87004 KB	Output is correct
42	Correct	877 ms	90316 KB	Output is correct
43	Correct	187 ms	90316 KB	Output is correct
44	Correct	788 ms	90316 KB	Output is correct
45	Correct	728 ms	90316 KB	Output is correct
46	Correct	578 ms	90316 KB	Output is correct
47	Correct	423 ms	90316 KB	Output is correct
48	Correct	488 ms	90316 KB	Output is correct
49	Correct	647 ms	90316 KB	Output is correct
50	Correct	793 ms	90316 KB	Output is correct
51	Correct	510 ms	90316 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2847 ms	116400 KB	Output is correct
2	Correct	2675 ms	116400 KB	Output is correct
3	Correct	3426 ms	194004 KB	Output is correct
4	Correct	2797 ms	194004 KB	Output is correct
5	Correct	2885 ms	194004 KB	Output is correct
6	Correct	2852 ms	194004 KB	Output is correct
7	Correct	3469 ms	246248 KB	Output is correct
8	Correct	2815 ms	246248 KB	Output is correct
9	Correct	2505 ms	246248 KB	Output is correct
10	Correct	2479 ms	246248 KB	Output is correct
11	Correct	1754 ms	246248 KB	Output is correct
12	Correct	2116 ms	246788 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1358 ms	314468 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	25 ms	26748 KB	Output is correct
2	Correct	29 ms	26808 KB	Output is correct
3	Correct	27 ms	26808 KB	Output is correct
4	Correct	27 ms	26836 KB	Output is correct
5	Correct	28 ms	26880 KB	Output is correct
6	Correct	30 ms	27168 KB	Output is correct
7	Correct	37 ms	27196 KB	Output is correct
8	Correct	35 ms	27196 KB	Output is correct
9	Correct	37 ms	27196 KB	Output is correct
10	Correct	35 ms	27196 KB	Output is correct
11	Correct	27 ms	27196 KB	Output is correct
12	Correct	29 ms	27196 KB	Output is correct
13	Correct	27 ms	27196 KB	Output is correct
14	Correct	28 ms	27196 KB	Output is correct
15	Correct	31 ms	27236 KB	Output is correct
16	Correct	33 ms	27244 KB	Output is correct
17	Correct	35 ms	27244 KB	Output is correct
18	Correct	34 ms	27244 KB	Output is correct
19	Correct	36 ms	27244 KB	Output is correct
20	Correct	35 ms	27244 KB	Output is correct
21	Correct	29 ms	27244 KB	Output is correct
22	Correct	30 ms	27244 KB	Output is correct
23	Correct	28 ms	27244 KB	Output is correct
24	Correct	35 ms	27244 KB	Output is correct
25	Correct	30 ms	27244 KB	Output is correct
26	Correct	27 ms	27244 KB	Output is correct
27	Correct	32 ms	27244 KB	Output is correct
28	Correct	29 ms	27244 KB	Output is correct
29	Correct	34 ms	27244 KB	Output is correct
30	Correct	33 ms	27244 KB	Output is correct
31	Correct	1751 ms	72544 KB	Output is correct
32	Correct	281 ms	72544 KB	Output is correct
33	Correct	1181 ms	72544 KB	Output is correct
34	Correct	1188 ms	74040 KB	Output is correct
35	Correct	1571 ms	82244 KB	Output is correct
36	Correct	1432 ms	84972 KB	Output is correct
37	Correct	897 ms	84972 KB	Output is correct
38	Correct	880 ms	84972 KB	Output is correct
39	Correct	668 ms	84972 KB	Output is correct
40	Correct	659 ms	84972 KB	Output is correct
41	Correct	828 ms	87004 KB	Output is correct
42	Correct	877 ms	90316 KB	Output is correct
43	Correct	187 ms	90316 KB	Output is correct
44	Correct	788 ms	90316 KB	Output is correct
45	Correct	728 ms	90316 KB	Output is correct
46	Correct	578 ms	90316 KB	Output is correct
47	Correct	423 ms	90316 KB	Output is correct
48	Correct	488 ms	90316 KB	Output is correct
49	Correct	647 ms	90316 KB	Output is correct
50	Correct	793 ms	90316 KB	Output is correct
51	Correct	510 ms	90316 KB	Output is correct
52	Correct	1474 ms	333644 KB	Output is correct
53	Correct	1289 ms	333644 KB	Output is correct
54	Correct	1557 ms	333644 KB	Output is correct
55	Correct	1097 ms	333644 KB	Output is correct
56	Correct	1136 ms	333644 KB	Output is correct
57	Correct	883 ms	333644 KB	Output is correct
58	Correct	1061 ms	333644 KB	Output is correct
59	Correct	1269 ms	337316 KB	Output is correct
60	Correct	892 ms	337316 KB	Output is correct
61	Correct	298 ms	337316 KB	Output is correct
62	Correct	1277 ms	360296 KB	Output is correct
63	Correct	1493 ms	360296 KB	Output is correct
64	Correct	1464 ms	360296 KB	Output is correct
65	Correct	1381 ms	360296 KB	Output is correct
66	Correct	899 ms	360296 KB	Output is correct
67	Correct	478 ms	360296 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	26748 KB	Output is correct
2	Correct	29 ms	26808 KB	Output is correct
3	Correct	27 ms	26808 KB	Output is correct
4	Correct	27 ms	26836 KB	Output is correct
5	Correct	28 ms	26880 KB	Output is correct
6	Correct	30 ms	27168 KB	Output is correct
7	Correct	37 ms	27196 KB	Output is correct
8	Correct	35 ms	27196 KB	Output is correct
9	Correct	37 ms	27196 KB	Output is correct
10	Correct	35 ms	27196 KB	Output is correct
11	Correct	27 ms	27196 KB	Output is correct
12	Correct	29 ms	27196 KB	Output is correct
13	Correct	27 ms	27196 KB	Output is correct
14	Correct	28 ms	27196 KB	Output is correct
15	Correct	31 ms	27236 KB	Output is correct
16	Correct	33 ms	27244 KB	Output is correct
17	Correct	35 ms	27244 KB	Output is correct
18	Correct	34 ms	27244 KB	Output is correct
19	Correct	36 ms	27244 KB	Output is correct
20	Correct	35 ms	27244 KB	Output is correct
21	Correct	29 ms	27244 KB	Output is correct
22	Correct	30 ms	27244 KB	Output is correct
23	Correct	28 ms	27244 KB	Output is correct
24	Correct	35 ms	27244 KB	Output is correct
25	Correct	30 ms	27244 KB	Output is correct
26	Correct	27 ms	27244 KB	Output is correct
27	Correct	32 ms	27244 KB	Output is correct
28	Correct	29 ms	27244 KB	Output is correct
29	Correct	34 ms	27244 KB	Output is correct
30	Correct	33 ms	27244 KB	Output is correct
31	Correct	1751 ms	72544 KB	Output is correct
32	Correct	281 ms	72544 KB	Output is correct
33	Correct	1181 ms	72544 KB	Output is correct
34	Correct	1188 ms	74040 KB	Output is correct
35	Correct	1571 ms	82244 KB	Output is correct
36	Correct	1432 ms	84972 KB	Output is correct
37	Correct	897 ms	84972 KB	Output is correct
38	Correct	880 ms	84972 KB	Output is correct
39	Correct	668 ms	84972 KB	Output is correct
40	Correct	659 ms	84972 KB	Output is correct
41	Correct	828 ms	87004 KB	Output is correct
42	Correct	877 ms	90316 KB	Output is correct
43	Correct	187 ms	90316 KB	Output is correct
44	Correct	788 ms	90316 KB	Output is correct
45	Correct	728 ms	90316 KB	Output is correct
46	Correct	578 ms	90316 KB	Output is correct
47	Correct	423 ms	90316 KB	Output is correct
48	Correct	488 ms	90316 KB	Output is correct
49	Correct	647 ms	90316 KB	Output is correct
50	Correct	793 ms	90316 KB	Output is correct
51	Correct	510 ms	90316 KB	Output is correct
52	Correct	2847 ms	116400 KB	Output is correct
53	Correct	2675 ms	116400 KB	Output is correct
54	Correct	3426 ms	194004 KB	Output is correct
55	Correct	2797 ms	194004 KB	Output is correct
56	Correct	2885 ms	194004 KB	Output is correct
57	Correct	2852 ms	194004 KB	Output is correct
58	Correct	3469 ms	246248 KB	Output is correct
59	Correct	2815 ms	246248 KB	Output is correct
60	Correct	2505 ms	246248 KB	Output is correct
61	Correct	2479 ms	246248 KB	Output is correct
62	Correct	1754 ms	246248 KB	Output is correct
63	Correct	2116 ms	246788 KB	Output is correct
64	Runtime error	1358 ms	314468 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
65	Halted	0 ms	0 KB	-

답안 #60833

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.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
10.0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0