답안 #60843 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60843	2018-07-24T20:24:16 Z	duality	새 집 (APIO18_new_home)	C++11	57 / 100	5000 ms	352404 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,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[1 << 20];
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);
    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,j;
    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),t--;
        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());
    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)));
                M.erase(it3);
                M[mp(it->first+events[i][j].x,it->first-events[i][j].x)] = events[i][j].time;
                M[mp(events[i][j].x+it2->first,events[i][j].x-it2->first)] = events[i][j].time;
                S[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)));
                M.erase(it3);
                it2--,p = mp(it->first+it2->first,it->first-it2->first);
                M[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();
    }
    for (i = 0; i < q; i++) {
        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());
    for (i = 0; i < oper.size(); i++) {
        if (oper[i].second.second == -1) query(0,sorted.size()-2,oper[i].second.first,0,oper[i].first);
        else update(0,sorted.size()-2,oper[i].second.first,oper[i].second.second,0,oper[i].first);
    }
    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:97:11: warning: unused variable 'k' [-Wunused-variable]
     int j,k;
           ^
new_home.cpp: In function 'int main()':
new_home.cpp:135:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < events[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~
new_home.cpp:182:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < oper.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:41: 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),t--;
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
new_home.cpp:177: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	33 ms	31992 KB	Output is correct
2	Correct	32 ms	31992 KB	Output is correct
3	Correct	35 ms	32008 KB	Output is correct
4	Correct	33 ms	32084 KB	Output is correct
5	Correct	33 ms	32212 KB	Output is correct
6	Correct	33 ms	32356 KB	Output is correct
7	Correct	32 ms	32456 KB	Output is correct
8	Correct	39 ms	32584 KB	Output is correct
9	Correct	36 ms	32592 KB	Output is correct
10	Correct	34 ms	32592 KB	Output is correct
11	Correct	35 ms	32592 KB	Output is correct
12	Correct	31 ms	32592 KB	Output is correct
13	Correct	31 ms	32592 KB	Output is correct
14	Correct	37 ms	32592 KB	Output is correct
15	Correct	39 ms	32592 KB	Output is correct
16	Correct	32 ms	32592 KB	Output is correct
17	Correct	39 ms	32592 KB	Output is correct
18	Correct	37 ms	32592 KB	Output is correct
19	Correct	39 ms	32592 KB	Output is correct
20	Correct	37 ms	32592 KB	Output is correct
21	Correct	40 ms	32592 KB	Output is correct
22	Correct	32 ms	32592 KB	Output is correct
23	Correct	32 ms	32592 KB	Output is correct
24	Correct	40 ms	32592 KB	Output is correct
25	Correct	32 ms	32592 KB	Output is correct
26	Correct	37 ms	32592 KB	Output is correct
27	Correct	40 ms	32592 KB	Output is correct
28	Correct	31 ms	32592 KB	Output is correct
29	Correct	37 ms	32592 KB	Output is correct
30	Correct	35 ms	32592 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	31992 KB	Output is correct
2	Correct	32 ms	31992 KB	Output is correct
3	Correct	35 ms	32008 KB	Output is correct
4	Correct	33 ms	32084 KB	Output is correct
5	Correct	33 ms	32212 KB	Output is correct
6	Correct	33 ms	32356 KB	Output is correct
7	Correct	32 ms	32456 KB	Output is correct
8	Correct	39 ms	32584 KB	Output is correct
9	Correct	36 ms	32592 KB	Output is correct
10	Correct	34 ms	32592 KB	Output is correct
11	Correct	35 ms	32592 KB	Output is correct
12	Correct	31 ms	32592 KB	Output is correct
13	Correct	31 ms	32592 KB	Output is correct
14	Correct	37 ms	32592 KB	Output is correct
15	Correct	39 ms	32592 KB	Output is correct
16	Correct	32 ms	32592 KB	Output is correct
17	Correct	39 ms	32592 KB	Output is correct
18	Correct	37 ms	32592 KB	Output is correct
19	Correct	39 ms	32592 KB	Output is correct
20	Correct	37 ms	32592 KB	Output is correct
21	Correct	40 ms	32592 KB	Output is correct
22	Correct	32 ms	32592 KB	Output is correct
23	Correct	32 ms	32592 KB	Output is correct
24	Correct	40 ms	32592 KB	Output is correct
25	Correct	32 ms	32592 KB	Output is correct
26	Correct	37 ms	32592 KB	Output is correct
27	Correct	40 ms	32592 KB	Output is correct
28	Correct	31 ms	32592 KB	Output is correct
29	Correct	37 ms	32592 KB	Output is correct
30	Correct	35 ms	32592 KB	Output is correct
31	Correct	945 ms	82652 KB	Output is correct
32	Correct	104 ms	82652 KB	Output is correct
33	Correct	1025 ms	82652 KB	Output is correct
34	Correct	1056 ms	82652 KB	Output is correct
35	Correct	858 ms	82652 KB	Output is correct
36	Correct	873 ms	82652 KB	Output is correct
37	Correct	691 ms	82652 KB	Output is correct
38	Correct	743 ms	82652 KB	Output is correct
39	Correct	504 ms	82652 KB	Output is correct
40	Correct	530 ms	82652 KB	Output is correct
41	Correct	888 ms	82652 KB	Output is correct
42	Correct	1054 ms	83448 KB	Output is correct
43	Correct	135 ms	83448 KB	Output is correct
44	Correct	986 ms	83448 KB	Output is correct
45	Correct	970 ms	83448 KB	Output is correct
46	Correct	774 ms	83448 KB	Output is correct
47	Correct	427 ms	83448 KB	Output is correct
48	Correct	395 ms	83448 KB	Output is correct
49	Correct	462 ms	83448 KB	Output is correct
50	Correct	538 ms	83448 KB	Output is correct
51	Correct	492 ms	83448 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1000 ms	103892 KB	Output is correct
2	Correct	1605 ms	103892 KB	Output is correct
3	Correct	1141 ms	109968 KB	Output is correct
4	Correct	1123 ms	109968 KB	Output is correct
5	Correct	2897 ms	111240 KB	Output is correct
6	Correct	2205 ms	111240 KB	Output is correct
7	Correct	1087 ms	111240 KB	Output is correct
8	Correct	794 ms	111240 KB	Output is correct
9	Correct	879 ms	111240 KB	Output is correct
10	Correct	1012 ms	111240 KB	Output is correct
11	Correct	1085 ms	111240 KB	Output is correct
12	Correct	1031 ms	111240 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4593 ms	267156 KB	Output is correct
2	Correct	521 ms	267156 KB	Output is correct
3	Correct	4886 ms	267156 KB	Output is correct
4	Correct	4761 ms	352404 KB	Output is correct
5	Correct	3944 ms	352404 KB	Output is correct
6	Correct	3959 ms	352404 KB	Output is correct
7	Execution timed out	5070 ms	352404 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	31992 KB	Output is correct
2	Correct	32 ms	31992 KB	Output is correct
3	Correct	35 ms	32008 KB	Output is correct
4	Correct	33 ms	32084 KB	Output is correct
5	Correct	33 ms	32212 KB	Output is correct
6	Correct	33 ms	32356 KB	Output is correct
7	Correct	32 ms	32456 KB	Output is correct
8	Correct	39 ms	32584 KB	Output is correct
9	Correct	36 ms	32592 KB	Output is correct
10	Correct	34 ms	32592 KB	Output is correct
11	Correct	35 ms	32592 KB	Output is correct
12	Correct	31 ms	32592 KB	Output is correct
13	Correct	31 ms	32592 KB	Output is correct
14	Correct	37 ms	32592 KB	Output is correct
15	Correct	39 ms	32592 KB	Output is correct
16	Correct	32 ms	32592 KB	Output is correct
17	Correct	39 ms	32592 KB	Output is correct
18	Correct	37 ms	32592 KB	Output is correct
19	Correct	39 ms	32592 KB	Output is correct
20	Correct	37 ms	32592 KB	Output is correct
21	Correct	40 ms	32592 KB	Output is correct
22	Correct	32 ms	32592 KB	Output is correct
23	Correct	32 ms	32592 KB	Output is correct
24	Correct	40 ms	32592 KB	Output is correct
25	Correct	32 ms	32592 KB	Output is correct
26	Correct	37 ms	32592 KB	Output is correct
27	Correct	40 ms	32592 KB	Output is correct
28	Correct	31 ms	32592 KB	Output is correct
29	Correct	37 ms	32592 KB	Output is correct
30	Correct	35 ms	32592 KB	Output is correct
31	Correct	945 ms	82652 KB	Output is correct
32	Correct	104 ms	82652 KB	Output is correct
33	Correct	1025 ms	82652 KB	Output is correct
34	Correct	1056 ms	82652 KB	Output is correct
35	Correct	858 ms	82652 KB	Output is correct
36	Correct	873 ms	82652 KB	Output is correct
37	Correct	691 ms	82652 KB	Output is correct
38	Correct	743 ms	82652 KB	Output is correct
39	Correct	504 ms	82652 KB	Output is correct
40	Correct	530 ms	82652 KB	Output is correct
41	Correct	888 ms	82652 KB	Output is correct
42	Correct	1054 ms	83448 KB	Output is correct
43	Correct	135 ms	83448 KB	Output is correct
44	Correct	986 ms	83448 KB	Output is correct
45	Correct	970 ms	83448 KB	Output is correct
46	Correct	774 ms	83448 KB	Output is correct
47	Correct	427 ms	83448 KB	Output is correct
48	Correct	395 ms	83448 KB	Output is correct
49	Correct	462 ms	83448 KB	Output is correct
50	Correct	538 ms	83448 KB	Output is correct
51	Correct	492 ms	83448 KB	Output is correct
52	Correct	929 ms	352404 KB	Output is correct
53	Correct	1030 ms	352404 KB	Output is correct
54	Correct	1075 ms	352404 KB	Output is correct
55	Correct	814 ms	352404 KB	Output is correct
56	Correct	907 ms	352404 KB	Output is correct
57	Correct	893 ms	352404 KB	Output is correct
58	Correct	912 ms	352404 KB	Output is correct
59	Correct	910 ms	352404 KB	Output is correct
60	Correct	858 ms	352404 KB	Output is correct
61	Correct	203 ms	352404 KB	Output is correct
62	Correct	827 ms	352404 KB	Output is correct
63	Correct	850 ms	352404 KB	Output is correct
64	Correct	959 ms	352404 KB	Output is correct
65	Correct	943 ms	352404 KB	Output is correct
66	Correct	889 ms	352404 KB	Output is correct
67	Correct	215 ms	352404 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	31992 KB	Output is correct
2	Correct	32 ms	31992 KB	Output is correct
3	Correct	35 ms	32008 KB	Output is correct
4	Correct	33 ms	32084 KB	Output is correct
5	Correct	33 ms	32212 KB	Output is correct
6	Correct	33 ms	32356 KB	Output is correct
7	Correct	32 ms	32456 KB	Output is correct
8	Correct	39 ms	32584 KB	Output is correct
9	Correct	36 ms	32592 KB	Output is correct
10	Correct	34 ms	32592 KB	Output is correct
11	Correct	35 ms	32592 KB	Output is correct
12	Correct	31 ms	32592 KB	Output is correct
13	Correct	31 ms	32592 KB	Output is correct
14	Correct	37 ms	32592 KB	Output is correct
15	Correct	39 ms	32592 KB	Output is correct
16	Correct	32 ms	32592 KB	Output is correct
17	Correct	39 ms	32592 KB	Output is correct
18	Correct	37 ms	32592 KB	Output is correct
19	Correct	39 ms	32592 KB	Output is correct
20	Correct	37 ms	32592 KB	Output is correct
21	Correct	40 ms	32592 KB	Output is correct
22	Correct	32 ms	32592 KB	Output is correct
23	Correct	32 ms	32592 KB	Output is correct
24	Correct	40 ms	32592 KB	Output is correct
25	Correct	32 ms	32592 KB	Output is correct
26	Correct	37 ms	32592 KB	Output is correct
27	Correct	40 ms	32592 KB	Output is correct
28	Correct	31 ms	32592 KB	Output is correct
29	Correct	37 ms	32592 KB	Output is correct
30	Correct	35 ms	32592 KB	Output is correct
31	Correct	945 ms	82652 KB	Output is correct
32	Correct	104 ms	82652 KB	Output is correct
33	Correct	1025 ms	82652 KB	Output is correct
34	Correct	1056 ms	82652 KB	Output is correct
35	Correct	858 ms	82652 KB	Output is correct
36	Correct	873 ms	82652 KB	Output is correct
37	Correct	691 ms	82652 KB	Output is correct
38	Correct	743 ms	82652 KB	Output is correct
39	Correct	504 ms	82652 KB	Output is correct
40	Correct	530 ms	82652 KB	Output is correct
41	Correct	888 ms	82652 KB	Output is correct
42	Correct	1054 ms	83448 KB	Output is correct
43	Correct	135 ms	83448 KB	Output is correct
44	Correct	986 ms	83448 KB	Output is correct
45	Correct	970 ms	83448 KB	Output is correct
46	Correct	774 ms	83448 KB	Output is correct
47	Correct	427 ms	83448 KB	Output is correct
48	Correct	395 ms	83448 KB	Output is correct
49	Correct	462 ms	83448 KB	Output is correct
50	Correct	538 ms	83448 KB	Output is correct
51	Correct	492 ms	83448 KB	Output is correct
52	Correct	1000 ms	103892 KB	Output is correct
53	Correct	1605 ms	103892 KB	Output is correct
54	Correct	1141 ms	109968 KB	Output is correct
55	Correct	1123 ms	109968 KB	Output is correct
56	Correct	2897 ms	111240 KB	Output is correct
57	Correct	2205 ms	111240 KB	Output is correct
58	Correct	1087 ms	111240 KB	Output is correct
59	Correct	794 ms	111240 KB	Output is correct
60	Correct	879 ms	111240 KB	Output is correct
61	Correct	1012 ms	111240 KB	Output is correct
62	Correct	1085 ms	111240 KB	Output is correct
63	Correct	1031 ms	111240 KB	Output is correct
64	Correct	4593 ms	267156 KB	Output is correct
65	Correct	521 ms	267156 KB	Output is correct
66	Correct	4886 ms	267156 KB	Output is correct
67	Correct	4761 ms	352404 KB	Output is correct
68	Correct	3944 ms	352404 KB	Output is correct
69	Correct	3959 ms	352404 KB	Output is correct
70	Execution timed out	5070 ms	352404 KB	Time limit exceeded
71	Halted	0 ms	0 KB	-

답안 #60843

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