oj.uz

Submission #60916

# Submission time Handle Problem Language Result Execution time Memory
60916 2018-07-25T01:22:49 Z duality New Home (APIO18_new_home) C++11
100 / 100
 4777 ms 566324 KB 
#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;
}

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];
multimap<int,int> S;
vector<pair<pii,pii> > oper;
vpii tree[600000];
int ans[300000];
int update(int as,int ae,pii p) {
    as += sorted.size(),ae += sorted.size()+1;
    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();
    while (q > 0) tree[q].pb(p),q >>= 1;
    return 0;
}
int main() {
    int i,j;
    int n,k,q;
    int x,t,a,b,l,y;
    n = readInt(),k = readInt(),q = readInt();
    for (i = 0; i < n; i++) {
        x = readInt(),t = readInt()-1,a = readInt(),b = readInt();
        events[t].pb((event){a,x,1});
        events[t].pb((event){b+1,x,-1});
    }
    for (i = 0; i < k; i++) {
        sort(events[i].begin(),events[i].end(),comp);
        S.insert(mp(-3e8,1)),S.insert(mp(3e8,1));
        for (j = 0; j < events[i].size(); j++) {
            if (events[i][j].t == 1) {
                auto it = S.lower_bound(events[i][j].x);
                auto it2 = it;
                it2--;
                pii p = mp(it->first+it2->first,it->first-it2->first);
                oper.pb(mp(p,mp(it2->second,events[i][j].time)));
                it2->second = events[i][j].time;
                S.insert(it,mp(events[i][j].x,events[i][j].time));
            }
            else {
                auto it = S.find(events[i][j].x);
                auto it2 = it;
                it2--;
                pii p = mp(it->first+it2->first,it->first-it2->first);
                oper.pb(mp(p,mp(it2->second,events[i][j].time)));
                it++,it2++,p = mp(it->first+it2->first,it->first-it2->first);
                oper.pb(mp(p,mp(it2->second,events[i][j].time)));
                it2--,p = mp(it->first+it2->first,it->first-it2->first);
                it2->second = events[i][j].time;
                S.erase(--it);
            }
        }
        oper.pb(mp(mp(0,6e8),mp(S.begin()->second,3e8)));
        S.clear();
    }
    for (i = 0; i < q; i++) {
        l = readInt(),y = readInt();
        sorted.pb(y);
        oper.pb(mp(mp(2*l,-(i+1)),mp(y,-1)));
    }
    sort(oper.begin(),oper.end());
    sort(sorted.begin(),sorted.end());
    sorted.resize(unique(sorted.begin(),sorted.end())-sorted.begin());
    for (i = 0; i < oper.size(); i++) {
        if (oper[i].second.second == -1) {
            oper[i].second.first = lower_bound(sorted.begin(),sorted.end(),oper[i].second.first)-sorted.begin();
            query(oper[i].second.first,oper[i].first);
        }
        else {
            oper[i].second.first = lower_bound(sorted.begin(),sorted.end(),oper[i].second.first)-sorted.begin();
            oper[i].second.second = lower_bound(sorted.begin(),sorted.end(),oper[i].second.second)-sorted.begin()-1;
            if (oper[i].second.first <= oper[i].second.second) update(oper[i].second.first,oper[i].second.second,oper[i].first);
        }
    }
    for (i = 1; i < 2*sorted.size(); 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));
        }
    }
    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:103:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < events[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~
new_home.cpp:137:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < oper.size(); i++) {
                 ~~^~~~~~~~~~~~~
new_home.cpp:148:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i < 2*sorted.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~
new_home.cpp:150: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

# Verdict Execution time Memory Grader output
1 Correct 26 ms 21368 KB Output is correct
2 Correct 29 ms 21576 KB Output is correct
3 Correct 25 ms 21576 KB Output is correct
4 Correct 25 ms 21608 KB Output is correct
5 Correct 27 ms 21664 KB Output is correct
6 Correct 28 ms 21796 KB Output is correct
7 Correct 26 ms 21796 KB Output is correct
8 Correct 25 ms 21796 KB Output is correct
9 Correct 29 ms 21796 KB Output is correct
10 Correct 30 ms 21848 KB Output is correct
11 Correct 27 ms 21848 KB Output is correct
12 Correct 28 ms 21860 KB Output is correct
13 Correct 28 ms 21924 KB Output is correct
14 Correct 28 ms 21928 KB Output is correct
15 Correct 28 ms 21972 KB Output is correct
16 Correct 30 ms 22064 KB Output is correct
17 Correct 31 ms 22064 KB Output is correct
18 Correct 29 ms 22064 KB Output is correct
19 Correct 26 ms 22064 KB Output is correct
20 Correct 28 ms 22064 KB Output is correct
21 Correct 26 ms 22064 KB Output is correct
22 Correct 29 ms 22064 KB Output is correct
23 Correct 28 ms 22064 KB Output is correct
24 Correct 29 ms 22064 KB Output is correct
25 Correct 27 ms 22064 KB Output is correct
26 Correct 28 ms 22064 KB Output is correct
27 Correct 30 ms 22064 KB Output is correct
28 Correct 29 ms 22064 KB Output is correct
29 Correct 31 ms 22064 KB Output is correct
30 Correct 28 ms 22064 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 21368 KB Output is correct
2 Correct 29 ms 21576 KB Output is correct
3 Correct 25 ms 21576 KB Output is correct
4 Correct 25 ms 21608 KB Output is correct
5 Correct 27 ms 21664 KB Output is correct
6 Correct 28 ms 21796 KB Output is correct
7 Correct 26 ms 21796 KB Output is correct
8 Correct 25 ms 21796 KB Output is correct
9 Correct 29 ms 21796 KB Output is correct
10 Correct 30 ms 21848 KB Output is correct
11 Correct 27 ms 21848 KB Output is correct
12 Correct 28 ms 21860 KB Output is correct
13 Correct 28 ms 21924 KB Output is correct
14 Correct 28 ms 21928 KB Output is correct
15 Correct 28 ms 21972 KB Output is correct
16 Correct 30 ms 22064 KB Output is correct
17 Correct 31 ms 22064 KB Output is correct
18 Correct 29 ms 22064 KB Output is correct
19 Correct 26 ms 22064 KB Output is correct
20 Correct 28 ms 22064 KB Output is correct
21 Correct 26 ms 22064 KB Output is correct
22 Correct 29 ms 22064 KB Output is correct
23 Correct 28 ms 22064 KB Output is correct
24 Correct 29 ms 22064 KB Output is correct
25 Correct 27 ms 22064 KB Output is correct
26 Correct 28 ms 22064 KB Output is correct
27 Correct 30 ms 22064 KB Output is correct
28 Correct 29 ms 22064 KB Output is correct
29 Correct 31 ms 22064 KB Output is correct
30 Correct 28 ms 22064 KB Output is correct
31 Correct 743 ms 64796 KB Output is correct
32 Correct 142 ms 64796 KB Output is correct
33 Correct 658 ms 64796 KB Output is correct
34 Correct 707 ms 64796 KB Output is correct
35 Correct 766 ms 64796 KB Output is correct
36 Correct 719 ms 64796 KB Output is correct
37 Correct 538 ms 64796 KB Output is correct
38 Correct 548 ms 64796 KB Output is correct
39 Correct 375 ms 64796 KB Output is correct
40 Correct 409 ms 64796 KB Output is correct
41 Correct 709 ms 64796 KB Output is correct
42 Correct 685 ms 64796 KB Output is correct
43 Correct 131 ms 64796 KB Output is correct
44 Correct 645 ms 64796 KB Output is correct
45 Correct 603 ms 64796 KB Output is correct
46 Correct 516 ms 64796 KB Output is correct
47 Correct 293 ms 64796 KB Output is correct
48 Correct 272 ms 64796 KB Output is correct
49 Correct 330 ms 64796 KB Output is correct
50 Correct 401 ms 64796 KB Output is correct
51 Correct 366 ms 64796 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2578 ms 185444 KB Output is correct
2 Correct 2160 ms 185444 KB Output is correct
3 Correct 2282 ms 252944 KB Output is correct
4 Correct 2260 ms 252944 KB Output is correct
5 Correct 2563 ms 252944 KB Output is correct
6 Correct 2303 ms 252944 KB Output is correct
7 Correct 2078 ms 256724 KB Output is correct
8 Correct 1988 ms 256724 KB Output is correct
9 Correct 1881 ms 256724 KB Output is correct
10 Correct 2129 ms 256724 KB Output is correct
11 Correct 1247 ms 256724 KB Output is correct
12 Correct 1360 ms 256724 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3459 ms 256724 KB Output is correct
2 Correct 511 ms 256724 KB Output is correct
3 Correct 3253 ms 256724 KB Output is correct
4 Correct 3637 ms 293904 KB Output is correct
5 Correct 3209 ms 293904 KB Output is correct
6 Correct 3334 ms 293904 KB Output is correct
7 Correct 4120 ms 293904 KB Output is correct
8 Correct 3295 ms 293904 KB Output is correct
9 Correct 2832 ms 302544 KB Output is correct
10 Correct 3107 ms 302544 KB Output is correct
11 Correct 3107 ms 302544 KB Output is correct
12 Correct 3240 ms 302544 KB Output is correct
13 Correct 1308 ms 302544 KB Output is correct
14 Correct 1365 ms 302544 KB Output is correct
15 Correct 1431 ms 302544 KB Output is correct
16 Correct 1567 ms 302544 KB Output is correct
17 Correct 1604 ms 302544 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 21368 KB Output is correct
2 Correct 29 ms 21576 KB Output is correct
3 Correct 25 ms 21576 KB Output is correct
4 Correct 25 ms 21608 KB Output is correct
5 Correct 27 ms 21664 KB Output is correct
6 Correct 28 ms 21796 KB Output is correct
7 Correct 26 ms 21796 KB Output is correct
8 Correct 25 ms 21796 KB Output is correct
9 Correct 29 ms 21796 KB Output is correct
10 Correct 30 ms 21848 KB Output is correct
11 Correct 27 ms 21848 KB Output is correct
12 Correct 28 ms 21860 KB Output is correct
13 Correct 28 ms 21924 KB Output is correct
14 Correct 28 ms 21928 KB Output is correct
15 Correct 28 ms 21972 KB Output is correct
16 Correct 30 ms 22064 KB Output is correct
17 Correct 31 ms 22064 KB Output is correct
18 Correct 29 ms 22064 KB Output is correct
19 Correct 26 ms 22064 KB Output is correct
20 Correct 28 ms 22064 KB Output is correct
21 Correct 26 ms 22064 KB Output is correct
22 Correct 29 ms 22064 KB Output is correct
23 Correct 28 ms 22064 KB Output is correct
24 Correct 29 ms 22064 KB Output is correct
25 Correct 27 ms 22064 KB Output is correct
26 Correct 28 ms 22064 KB Output is correct
27 Correct 30 ms 22064 KB Output is correct
28 Correct 29 ms 22064 KB Output is correct
29 Correct 31 ms 22064 KB Output is correct
30 Correct 28 ms 22064 KB Output is correct
31 Correct 743 ms 64796 KB Output is correct
32 Correct 142 ms 64796 KB Output is correct
33 Correct 658 ms 64796 KB Output is correct
34 Correct 707 ms 64796 KB Output is correct
35 Correct 766 ms 64796 KB Output is correct
36 Correct 719 ms 64796 KB Output is correct
37 Correct 538 ms 64796 KB Output is correct
38 Correct 548 ms 64796 KB Output is correct
39 Correct 375 ms 64796 KB Output is correct
40 Correct 409 ms 64796 KB Output is correct
41 Correct 709 ms 64796 KB Output is correct
42 Correct 685 ms 64796 KB Output is correct
43 Correct 131 ms 64796 KB Output is correct
44 Correct 645 ms 64796 KB Output is correct
45 Correct 603 ms 64796 KB Output is correct
46 Correct 516 ms 64796 KB Output is correct
47 Correct 293 ms 64796 KB Output is correct
48 Correct 272 ms 64796 KB Output is correct
49 Correct 330 ms 64796 KB Output is correct
50 Correct 401 ms 64796 KB Output is correct
51 Correct 366 ms 64796 KB Output is correct
52 Correct 533 ms 302544 KB Output is correct
53 Correct 517 ms 302544 KB Output is correct
54 Correct 574 ms 302544 KB Output is correct
55 Correct 439 ms 302544 KB Output is correct
56 Correct 541 ms 302544 KB Output is correct
57 Correct 566 ms 302544 KB Output is correct
58 Correct 500 ms 302544 KB Output is correct
59 Correct 510 ms 302544 KB Output is correct
60 Correct 526 ms 302544 KB Output is correct
61 Correct 149 ms 302544 KB Output is correct
62 Correct 706 ms 302544 KB Output is correct
63 Correct 645 ms 302544 KB Output is correct
64 Correct 642 ms 302544 KB Output is correct
65 Correct 549 ms 302544 KB Output is correct
66 Correct 510 ms 302544 KB Output is correct
67 Correct 134 ms 302544 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 21368 KB Output is correct
2 Correct 29 ms 21576 KB Output is correct
3 Correct 25 ms 21576 KB Output is correct
4 Correct 25 ms 21608 KB Output is correct
5 Correct 27 ms 21664 KB Output is correct
6 Correct 28 ms 21796 KB Output is correct
7 Correct 26 ms 21796 KB Output is correct
8 Correct 25 ms 21796 KB Output is correct
9 Correct 29 ms 21796 KB Output is correct
10 Correct 30 ms 21848 KB Output is correct
11 Correct 27 ms 21848 KB Output is correct
12 Correct 28 ms 21860 KB Output is correct
13 Correct 28 ms 21924 KB Output is correct
14 Correct 28 ms 21928 KB Output is correct
15 Correct 28 ms 21972 KB Output is correct
16 Correct 30 ms 22064 KB Output is correct
17 Correct 31 ms 22064 KB Output is correct
18 Correct 29 ms 22064 KB Output is correct
19 Correct 26 ms 22064 KB Output is correct
20 Correct 28 ms 22064 KB Output is correct
21 Correct 26 ms 22064 KB Output is correct
22 Correct 29 ms 22064 KB Output is correct
23 Correct 28 ms 22064 KB Output is correct
24 Correct 29 ms 22064 KB Output is correct
25 Correct 27 ms 22064 KB Output is correct
26 Correct 28 ms 22064 KB Output is correct
27 Correct 30 ms 22064 KB Output is correct
28 Correct 29 ms 22064 KB Output is correct
29 Correct 31 ms 22064 KB Output is correct
30 Correct 28 ms 22064 KB Output is correct
31 Correct 743 ms 64796 KB Output is correct
32 Correct 142 ms 64796 KB Output is correct
33 Correct 658 ms 64796 KB Output is correct
34 Correct 707 ms 64796 KB Output is correct
35 Correct 766 ms 64796 KB Output is correct
36 Correct 719 ms 64796 KB Output is correct
37 Correct 538 ms 64796 KB Output is correct
38 Correct 548 ms 64796 KB Output is correct
39 Correct 375 ms 64796 KB Output is correct
40 Correct 409 ms 64796 KB Output is correct
41 Correct 709 ms 64796 KB Output is correct
42 Correct 685 ms 64796 KB Output is correct
43 Correct 131 ms 64796 KB Output is correct
44 Correct 645 ms 64796 KB Output is correct
45 Correct 603 ms 64796 KB Output is correct
46 Correct 516 ms 64796 KB Output is correct
47 Correct 293 ms 64796 KB Output is correct
48 Correct 272 ms 64796 KB Output is correct
49 Correct 330 ms 64796 KB Output is correct
50 Correct 401 ms 64796 KB Output is correct
51 Correct 366 ms 64796 KB Output is correct
52 Correct 2578 ms 185444 KB Output is correct
53 Correct 2160 ms 185444 KB Output is correct
54 Correct 2282 ms 252944 KB Output is correct
55 Correct 2260 ms 252944 KB Output is correct
56 Correct 2563 ms 252944 KB Output is correct
57 Correct 2303 ms 252944 KB Output is correct
58 Correct 2078 ms 256724 KB Output is correct
59 Correct 1988 ms 256724 KB Output is correct
60 Correct 1881 ms 256724 KB Output is correct
61 Correct 2129 ms 256724 KB Output is correct
62 Correct 1247 ms 256724 KB Output is correct
63 Correct 1360 ms 256724 KB Output is correct
64 Correct 3459 ms 256724 KB Output is correct
65 Correct 511 ms 256724 KB Output is correct
66 Correct 3253 ms 256724 KB Output is correct
67 Correct 3637 ms 293904 KB Output is correct
68 Correct 3209 ms 293904 KB Output is correct
69 Correct 3334 ms 293904 KB Output is correct
70 Correct 4120 ms 293904 KB Output is correct
71 Correct 3295 ms 293904 KB Output is correct
72 Correct 2832 ms 302544 KB Output is correct
73 Correct 3107 ms 302544 KB Output is correct
74 Correct 3107 ms 302544 KB Output is correct
75 Correct 3240 ms 302544 KB Output is correct
76 Correct 1308 ms 302544 KB Output is correct
77 Correct 1365 ms 302544 KB Output is correct
78 Correct 1431 ms 302544 KB Output is correct
79 Correct 1567 ms 302544 KB Output is correct
80 Correct 1604 ms 302544 KB Output is correct
81 Correct 533 ms 302544 KB Output is correct
82 Correct 517 ms 302544 KB Output is correct
83 Correct 574 ms 302544 KB Output is correct
84 Correct 439 ms 302544 KB Output is correct
85 Correct 541 ms 302544 KB Output is correct
86 Correct 566 ms 302544 KB Output is correct
87 Correct 500 ms 302544 KB Output is correct
88 Correct 510 ms 302544 KB Output is correct
89 Correct 526 ms 302544 KB Output is correct
90 Correct 149 ms 302544 KB Output is correct
91 Correct 706 ms 302544 KB Output is correct
92 Correct 645 ms 302544 KB Output is correct
93 Correct 642 ms 302544 KB Output is correct
94 Correct 549 ms 302544 KB Output is correct
95 Correct 510 ms 302544 KB Output is correct
96 Correct 134 ms 302544 KB Output is correct
97 Correct 4106 ms 324536 KB Output is correct
98 Correct 601 ms 324536 KB Output is correct
99 Correct 4113 ms 324536 KB Output is correct
100 Correct 4011 ms 324536 KB Output is correct
101 Correct 4456 ms 324536 KB Output is correct
102 Correct 4098 ms 324536 KB Output is correct
103 Correct 3001 ms 324536 KB Output is correct
104 Correct 3085 ms 324536 KB Output is correct
105 Correct 2017 ms 324536 KB Output is correct
106 Correct 2084 ms 324536 KB Output is correct
107 Correct 3939 ms 324536 KB Output is correct
108 Correct 3583 ms 342276 KB Output is correct
109 Correct 3834 ms 342276 KB Output is correct
110 Correct 4777 ms 369564 KB Output is correct
111 Correct 4296 ms 403276 KB Output is correct
112 Correct 4201 ms 403276 KB Output is correct
113 Correct 633 ms 403276 KB Output is correct
114 Correct 4219 ms 493864 KB Output is correct
115 Correct 4544 ms 493864 KB Output is correct
116 Correct 4676 ms 497428 KB Output is correct
117 Correct 4609 ms 497428 KB Output is correct
118 Correct 4569 ms 497428 KB Output is correct
119 Correct 657 ms 497428 KB Output is correct
120 Correct 1187 ms 497428 KB Output is correct
121 Correct 1312 ms 497428 KB Output is correct
122 Correct 1291 ms 497428 KB Output is correct
123 Correct 1457 ms 497428 KB Output is correct
124 Correct 1938 ms 514868 KB Output is correct
125 Correct 1818 ms 514868 KB Output is correct
126 Correct 2136 ms 566324 KB Output is correct