답안 #60874 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60874	2018-07-24T21:56:47 Z	duality	새 집 (APIO18_new_home)	C++11	57 / 100	5000 ms	309704 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 ----------
int readInt() {
    char c;
    while ((c=getchar()) < '0');
    int n = c-'0';
    while ((c=getchar()) >= '0') n *= 10,n += c-'0';
    return n;
}

#include <iostream>
#include <ctime>
using namespace std;
clock_t __init_time__ = clock();
#define set_init_time() __init_time__ = clock()
#define get_elapsed_time() ((double)(clock()-__init_time__)/CLOCKS_PER_SEC)
// cout << elapsedTime << endl;
#define elapsedTime get_elapsed_time()<<" seconds"

struct event { int time,x,t; };
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[300000];
map<int,int> S;
map<pii,int> M;
vector<pair<pii,pii> > oper;
vpii tree[1200000];
int ans[300000];
int update(int as,int ae,pii p) {
    as += sorted.size()-1,ae += sorted.size();
    while (as < ae) {
        if (as & 1) tree[as++].pb(p);
        if (ae & 1) tree[--ae].pb(p);
        as >>= 1,ae >>= 1;
    }
    return 0;
}
int query(int q,pii p) {
    q += sorted.size()-1;
    while (q > 0) tree[q].pb(p),q >>= 1;
    return 0;
}
int main() {
    //freopen("100","r",stdin);
    int i,j;
    int n,k,q;
    int x,t,a,b,l,y;
    n = readInt(),k = readInt(),q = readInt();
    //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),t--;
        x = readInt(),t = readInt()-1,a = readInt(),b = readInt();
        events[t].pb((event){a,x,1});
        events[t].pb((event){b+1,x,-1});
        sorted.pb(a),sorted.pb(b+1);
    }
    sort(sorted.begin(),sorted.end());
    sorted.resize(unique(sorted.begin(),sorted.end())-sorted.begin());
    //cout<<elapsedTime<<endl;
    //set_init_time();
    for (i = 0; i < k; i++) {
        sort(events[i].begin(),events[i].end(),comp);
        S[-3e8] = S[3e8] = 1,M[mp(0,6e8)] = 0;
        for (j = 0; j < events[i].size(); j++) {
            events[i][j].time = lower_bound(sorted.begin(),sorted.end(),events[i][j].time)-sorted.begin();
            if (events[i][j].t == 1) {
                auto it = S.lower_bound(events[i][j].x);
                if (it->first == events[i][j].x) {
                    it->second++;
                    continue;
                }
                auto it2 = it;
                it2--;
                pii p = mp(it->first+it2->first,it->first-it2->first);
                auto it3 = M.find(p);
                oper.pb(mp(p,mp(it3->second,events[i][j].time-1)));
                it3 = M.erase(it3);
                it3 = M.insert(it3,mp(mp(it->first+events[i][j].x,it->first-events[i][j].x),events[i][j].time));
                M.insert(it3,mp(mp(events[i][j].x+it2->first,events[i][j].x-it2->first),events[i][j].time));
                S.insert(it,mp(events[i][j].x,1));
            }
            else {
                auto it = S.find(events[i][j].x);
                if (it->second > 1) {
                    it->second--;
                    continue;
                }
                auto it2 = it;
                it2--;
                pii p = mp(it->first+it2->first,it->first-it2->first);
                auto it3 = M.find(p);
                oper.pb(mp(p,mp(it3->second,events[i][j].time-1)));
                it3 = M.erase(it3);
                it++,it2++,p = mp(it->first+it2->first,it->first-it2->first);
                oper.pb(mp(p,mp(it3->second,events[i][j].time-1)));
                it3 = M.erase(it3);
                it2--,p = mp(it->first+it2->first,it->first-it2->first);
                M.insert(it3,mp(p,events[i][j].time));
                S.erase(--it);
            }
        }
        for (auto it = M.begin(); it != M.end(); it++) oper.pb(mp(it->first,mp(it->second,sorted.size()-2)));
        S.clear(),M.clear();
    }
    //cout<<elapsedTime<<endl;
    //set_init_time();
    for (i = 0; i < q; i++) {
        l = readInt(),y = readInt();
        //scanf("%d %d",&l,&y);
        int p = upper_bound(sorted.begin(),sorted.end(),y)-sorted.begin()-1;
        oper.pb(mp(mp(2*l,-(i+1)),mp(p,-1)));
    }
    sort(oper.begin(),oper.end());
    //cout<<elapsedTime<<endl;
    //set_init_time();
    for (i = 0; i < oper.size(); i++) {
        if (oper[i].second.second == -1) query(oper[i].second.first,oper[i].first);
        else update(oper[i].second.first,oper[i].second.second,oper[i].first);
    }
    //cout<<elapsedTime<<endl;
    //set_init_time();
    for (i = 1; i < 2*(sorted.size()-1); i++) {
        pii m = mp(-3e8,0);
        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));
        }
    }
    //cout<<elapsedTime<<endl;
    //freopen("debug.txt","w",stdout);
    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 main()':
new_home.cpp:122:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < events[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~
new_home.cpp:174:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < oper.size(); i++) {
                 ~~^~~~~~~~~~~~~
new_home.cpp:180:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i < 2*(sorted.size()-1); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~~~
new_home.cpp:182:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35580 KB	Output is correct
2	Correct	34 ms	35580 KB	Output is correct
3	Correct	33 ms	35632 KB	Output is correct
4	Correct	32 ms	35688 KB	Output is correct
5	Correct	44 ms	35688 KB	Output is correct
6	Correct	42 ms	35796 KB	Output is correct
7	Correct	41 ms	35924 KB	Output is correct
8	Correct	40 ms	35924 KB	Output is correct
9	Correct	49 ms	36000 KB	Output is correct
10	Correct	41 ms	36000 KB	Output is correct
11	Correct	41 ms	36000 KB	Output is correct
12	Correct	37 ms	36000 KB	Output is correct
13	Correct	40 ms	36048 KB	Output is correct
14	Correct	36 ms	36048 KB	Output is correct
15	Correct	40 ms	36048 KB	Output is correct
16	Correct	42 ms	36048 KB	Output is correct
17	Correct	35 ms	36048 KB	Output is correct
18	Correct	37 ms	36048 KB	Output is correct
19	Correct	34 ms	36048 KB	Output is correct
20	Correct	37 ms	36048 KB	Output is correct
21	Correct	35 ms	36048 KB	Output is correct
22	Correct	38 ms	36048 KB	Output is correct
23	Correct	34 ms	36048 KB	Output is correct
24	Correct	36 ms	36048 KB	Output is correct
25	Correct	39 ms	36048 KB	Output is correct
26	Correct	42 ms	36048 KB	Output is correct
27	Correct	35 ms	36048 KB	Output is correct
28	Correct	35 ms	36048 KB	Output is correct
29	Correct	39 ms	36048 KB	Output is correct
30	Correct	36 ms	36048 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35580 KB	Output is correct
2	Correct	34 ms	35580 KB	Output is correct
3	Correct	33 ms	35632 KB	Output is correct
4	Correct	32 ms	35688 KB	Output is correct
5	Correct	44 ms	35688 KB	Output is correct
6	Correct	42 ms	35796 KB	Output is correct
7	Correct	41 ms	35924 KB	Output is correct
8	Correct	40 ms	35924 KB	Output is correct
9	Correct	49 ms	36000 KB	Output is correct
10	Correct	41 ms	36000 KB	Output is correct
11	Correct	41 ms	36000 KB	Output is correct
12	Correct	37 ms	36000 KB	Output is correct
13	Correct	40 ms	36048 KB	Output is correct
14	Correct	36 ms	36048 KB	Output is correct
15	Correct	40 ms	36048 KB	Output is correct
16	Correct	42 ms	36048 KB	Output is correct
17	Correct	35 ms	36048 KB	Output is correct
18	Correct	37 ms	36048 KB	Output is correct
19	Correct	34 ms	36048 KB	Output is correct
20	Correct	37 ms	36048 KB	Output is correct
21	Correct	35 ms	36048 KB	Output is correct
22	Correct	38 ms	36048 KB	Output is correct
23	Correct	34 ms	36048 KB	Output is correct
24	Correct	36 ms	36048 KB	Output is correct
25	Correct	39 ms	36048 KB	Output is correct
26	Correct	42 ms	36048 KB	Output is correct
27	Correct	35 ms	36048 KB	Output is correct
28	Correct	35 ms	36048 KB	Output is correct
29	Correct	39 ms	36048 KB	Output is correct
30	Correct	36 ms	36048 KB	Output is correct
31	Correct	728 ms	83672 KB	Output is correct
32	Correct	87 ms	83672 KB	Output is correct
33	Correct	765 ms	83672 KB	Output is correct
34	Correct	824 ms	83672 KB	Output is correct
35	Correct	732 ms	83672 KB	Output is correct
36	Correct	783 ms	83672 KB	Output is correct
37	Correct	556 ms	83672 KB	Output is correct
38	Correct	519 ms	83672 KB	Output is correct
39	Correct	434 ms	83672 KB	Output is correct
40	Correct	463 ms	83672 KB	Output is correct
41	Correct	847 ms	83672 KB	Output is correct
42	Correct	850 ms	83672 KB	Output is correct
43	Correct	98 ms	83672 KB	Output is correct
44	Correct	784 ms	83672 KB	Output is correct
45	Correct	721 ms	83672 KB	Output is correct
46	Correct	559 ms	83672 KB	Output is correct
47	Correct	348 ms	83672 KB	Output is correct
48	Correct	356 ms	83672 KB	Output is correct
49	Correct	400 ms	83672 KB	Output is correct
50	Correct	461 ms	83672 KB	Output is correct
51	Correct	351 ms	83672 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	905 ms	93240 KB	Output is correct
2	Correct	1469 ms	93240 KB	Output is correct
3	Correct	863 ms	99316 KB	Output is correct
4	Correct	926 ms	99316 KB	Output is correct
5	Correct	2534 ms	100452 KB	Output is correct
6	Correct	1723 ms	100452 KB	Output is correct
7	Correct	780 ms	100452 KB	Output is correct
8	Correct	699 ms	100452 KB	Output is correct
9	Correct	853 ms	100452 KB	Output is correct
10	Correct	889 ms	100452 KB	Output is correct
11	Correct	1006 ms	100452 KB	Output is correct
12	Correct	1050 ms	100452 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3411 ms	235520 KB	Output is correct
2	Correct	284 ms	235520 KB	Output is correct
3	Correct	4085 ms	235520 KB	Output is correct
4	Correct	3157 ms	309704 KB	Output is correct
5	Correct	3522 ms	309704 KB	Output is correct
6	Correct	3408 ms	309704 KB	Output is correct
7	Execution timed out	5041 ms	309704 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35580 KB	Output is correct
2	Correct	34 ms	35580 KB	Output is correct
3	Correct	33 ms	35632 KB	Output is correct
4	Correct	32 ms	35688 KB	Output is correct
5	Correct	44 ms	35688 KB	Output is correct
6	Correct	42 ms	35796 KB	Output is correct
7	Correct	41 ms	35924 KB	Output is correct
8	Correct	40 ms	35924 KB	Output is correct
9	Correct	49 ms	36000 KB	Output is correct
10	Correct	41 ms	36000 KB	Output is correct
11	Correct	41 ms	36000 KB	Output is correct
12	Correct	37 ms	36000 KB	Output is correct
13	Correct	40 ms	36048 KB	Output is correct
14	Correct	36 ms	36048 KB	Output is correct
15	Correct	40 ms	36048 KB	Output is correct
16	Correct	42 ms	36048 KB	Output is correct
17	Correct	35 ms	36048 KB	Output is correct
18	Correct	37 ms	36048 KB	Output is correct
19	Correct	34 ms	36048 KB	Output is correct
20	Correct	37 ms	36048 KB	Output is correct
21	Correct	35 ms	36048 KB	Output is correct
22	Correct	38 ms	36048 KB	Output is correct
23	Correct	34 ms	36048 KB	Output is correct
24	Correct	36 ms	36048 KB	Output is correct
25	Correct	39 ms	36048 KB	Output is correct
26	Correct	42 ms	36048 KB	Output is correct
27	Correct	35 ms	36048 KB	Output is correct
28	Correct	35 ms	36048 KB	Output is correct
29	Correct	39 ms	36048 KB	Output is correct
30	Correct	36 ms	36048 KB	Output is correct
31	Correct	728 ms	83672 KB	Output is correct
32	Correct	87 ms	83672 KB	Output is correct
33	Correct	765 ms	83672 KB	Output is correct
34	Correct	824 ms	83672 KB	Output is correct
35	Correct	732 ms	83672 KB	Output is correct
36	Correct	783 ms	83672 KB	Output is correct
37	Correct	556 ms	83672 KB	Output is correct
38	Correct	519 ms	83672 KB	Output is correct
39	Correct	434 ms	83672 KB	Output is correct
40	Correct	463 ms	83672 KB	Output is correct
41	Correct	847 ms	83672 KB	Output is correct
42	Correct	850 ms	83672 KB	Output is correct
43	Correct	98 ms	83672 KB	Output is correct
44	Correct	784 ms	83672 KB	Output is correct
45	Correct	721 ms	83672 KB	Output is correct
46	Correct	559 ms	83672 KB	Output is correct
47	Correct	348 ms	83672 KB	Output is correct
48	Correct	356 ms	83672 KB	Output is correct
49	Correct	400 ms	83672 KB	Output is correct
50	Correct	461 ms	83672 KB	Output is correct
51	Correct	351 ms	83672 KB	Output is correct
52	Correct	690 ms	309704 KB	Output is correct
53	Correct	795 ms	309704 KB	Output is correct
54	Correct	792 ms	309704 KB	Output is correct
55	Correct	755 ms	309704 KB	Output is correct
56	Correct	665 ms	309704 KB	Output is correct
57	Correct	686 ms	309704 KB	Output is correct
58	Correct	797 ms	309704 KB	Output is correct
59	Correct	765 ms	309704 KB	Output is correct
60	Correct	678 ms	309704 KB	Output is correct
61	Correct	160 ms	309704 KB	Output is correct
62	Correct	766 ms	309704 KB	Output is correct
63	Correct	835 ms	309704 KB	Output is correct
64	Correct	874 ms	309704 KB	Output is correct
65	Correct	800 ms	309704 KB	Output is correct
66	Correct	769 ms	309704 KB	Output is correct
67	Correct	173 ms	309704 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35580 KB	Output is correct
2	Correct	34 ms	35580 KB	Output is correct
3	Correct	33 ms	35632 KB	Output is correct
4	Correct	32 ms	35688 KB	Output is correct
5	Correct	44 ms	35688 KB	Output is correct
6	Correct	42 ms	35796 KB	Output is correct
7	Correct	41 ms	35924 KB	Output is correct
8	Correct	40 ms	35924 KB	Output is correct
9	Correct	49 ms	36000 KB	Output is correct
10	Correct	41 ms	36000 KB	Output is correct
11	Correct	41 ms	36000 KB	Output is correct
12	Correct	37 ms	36000 KB	Output is correct
13	Correct	40 ms	36048 KB	Output is correct
14	Correct	36 ms	36048 KB	Output is correct
15	Correct	40 ms	36048 KB	Output is correct
16	Correct	42 ms	36048 KB	Output is correct
17	Correct	35 ms	36048 KB	Output is correct
18	Correct	37 ms	36048 KB	Output is correct
19	Correct	34 ms	36048 KB	Output is correct
20	Correct	37 ms	36048 KB	Output is correct
21	Correct	35 ms	36048 KB	Output is correct
22	Correct	38 ms	36048 KB	Output is correct
23	Correct	34 ms	36048 KB	Output is correct
24	Correct	36 ms	36048 KB	Output is correct
25	Correct	39 ms	36048 KB	Output is correct
26	Correct	42 ms	36048 KB	Output is correct
27	Correct	35 ms	36048 KB	Output is correct
28	Correct	35 ms	36048 KB	Output is correct
29	Correct	39 ms	36048 KB	Output is correct
30	Correct	36 ms	36048 KB	Output is correct
31	Correct	728 ms	83672 KB	Output is correct
32	Correct	87 ms	83672 KB	Output is correct
33	Correct	765 ms	83672 KB	Output is correct
34	Correct	824 ms	83672 KB	Output is correct
35	Correct	732 ms	83672 KB	Output is correct
36	Correct	783 ms	83672 KB	Output is correct
37	Correct	556 ms	83672 KB	Output is correct
38	Correct	519 ms	83672 KB	Output is correct
39	Correct	434 ms	83672 KB	Output is correct
40	Correct	463 ms	83672 KB	Output is correct
41	Correct	847 ms	83672 KB	Output is correct
42	Correct	850 ms	83672 KB	Output is correct
43	Correct	98 ms	83672 KB	Output is correct
44	Correct	784 ms	83672 KB	Output is correct
45	Correct	721 ms	83672 KB	Output is correct
46	Correct	559 ms	83672 KB	Output is correct
47	Correct	348 ms	83672 KB	Output is correct
48	Correct	356 ms	83672 KB	Output is correct
49	Correct	400 ms	83672 KB	Output is correct
50	Correct	461 ms	83672 KB	Output is correct
51	Correct	351 ms	83672 KB	Output is correct
52	Correct	905 ms	93240 KB	Output is correct
53	Correct	1469 ms	93240 KB	Output is correct
54	Correct	863 ms	99316 KB	Output is correct
55	Correct	926 ms	99316 KB	Output is correct
56	Correct	2534 ms	100452 KB	Output is correct
57	Correct	1723 ms	100452 KB	Output is correct
58	Correct	780 ms	100452 KB	Output is correct
59	Correct	699 ms	100452 KB	Output is correct
60	Correct	853 ms	100452 KB	Output is correct
61	Correct	889 ms	100452 KB	Output is correct
62	Correct	1006 ms	100452 KB	Output is correct
63	Correct	1050 ms	100452 KB	Output is correct
64	Correct	3411 ms	235520 KB	Output is correct
65	Correct	284 ms	235520 KB	Output is correct
66	Correct	4085 ms	235520 KB	Output is correct
67	Correct	3157 ms	309704 KB	Output is correct
68	Correct	3522 ms	309704 KB	Output is correct
69	Correct	3408 ms	309704 KB	Output is correct
70	Execution timed out	5041 ms	309704 KB	Time limit exceeded
71	Halted	0 ms	0 KB	-

답안 #60874

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