oj.uz

Submission #60867

# Submission time Handle Problem Language Result Execution time Memory
60867 2018-07-24T21:33:45 Z duality New Home (APIO18_new_home) C++11
80 / 100
 5000 ms 379968 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];
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() {
    int i,j;
    int n,k,q;
    int x,t,a,b,l,y;
    n = readInt(),k = readInt(),q = readInt();
    sorted.pb(0),sorted.pb(3e8);
    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});
        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++) {
        l = readInt(),y = readInt();
        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(oper[i].second.first,oper[i].first);
        else update(oper[i].second.first,oper[i].second.second,oper[i].first);
    }
    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));
        }
    }
    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:108:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < events[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~
new_home.cpp:155:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < oper.size(); i++) {
                 ~~^~~~~~~~~~~~~
new_home.cpp:159:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i < 2*(sorted.size()-1); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~~~
new_home.cpp:161: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 36 ms 35576 KB Output is correct
2 Correct 40 ms 35576 KB Output is correct
3 Correct 43 ms 35636 KB Output is correct
4 Correct 41 ms 35768 KB Output is correct
5 Correct 44 ms 35768 KB Output is correct
6 Correct 39 ms 35896 KB Output is correct
7 Correct 33 ms 36024 KB Output is correct
8 Correct 41 ms 36024 KB Output is correct
9 Correct 44 ms 36024 KB Output is correct
10 Correct 36 ms 36024 KB Output is correct
11 Correct 35 ms 36024 KB Output is correct
12 Correct 43 ms 36024 KB Output is correct
13 Correct 42 ms 36024 KB Output is correct
14 Correct 42 ms 36024 KB Output is correct
15 Correct 42 ms 36024 KB Output is correct
16 Correct 40 ms 36024 KB Output is correct
17 Correct 35 ms 36024 KB Output is correct
18 Correct 33 ms 36024 KB Output is correct
19 Correct 32 ms 36024 KB Output is correct
20 Correct 33 ms 36024 KB Output is correct
21 Correct 32 ms 36024 KB Output is correct
22 Correct 40 ms 36152 KB Output is correct
23 Correct 37 ms 36152 KB Output is correct
24 Correct 42 ms 36152 KB Output is correct
25 Correct 39 ms 36152 KB Output is correct
26 Correct 47 ms 36152 KB Output is correct
27 Correct 48 ms 36152 KB Output is correct
28 Correct 41 ms 36152 KB Output is correct
29 Correct 40 ms 36152 KB Output is correct
30 Correct 36 ms 36152 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 35576 KB Output is correct
2 Correct 40 ms 35576 KB Output is correct
3 Correct 43 ms 35636 KB Output is correct
4 Correct 41 ms 35768 KB Output is correct
5 Correct 44 ms 35768 KB Output is correct
6 Correct 39 ms 35896 KB Output is correct
7 Correct 33 ms 36024 KB Output is correct
8 Correct 41 ms 36024 KB Output is correct
9 Correct 44 ms 36024 KB Output is correct
10 Correct 36 ms 36024 KB Output is correct
11 Correct 35 ms 36024 KB Output is correct
12 Correct 43 ms 36024 KB Output is correct
13 Correct 42 ms 36024 KB Output is correct
14 Correct 42 ms 36024 KB Output is correct
15 Correct 42 ms 36024 KB Output is correct
16 Correct 40 ms 36024 KB Output is correct
17 Correct 35 ms 36024 KB Output is correct
18 Correct 33 ms 36024 KB Output is correct
19 Correct 32 ms 36024 KB Output is correct
20 Correct 33 ms 36024 KB Output is correct
21 Correct 32 ms 36024 KB Output is correct
22 Correct 40 ms 36152 KB Output is correct
23 Correct 37 ms 36152 KB Output is correct
24 Correct 42 ms 36152 KB Output is correct
25 Correct 39 ms 36152 KB Output is correct
26 Correct 47 ms 36152 KB Output is correct
27 Correct 48 ms 36152 KB Output is correct
28 Correct 41 ms 36152 KB Output is correct
29 Correct 40 ms 36152 KB Output is correct
30 Correct 36 ms 36152 KB Output is correct
31 Correct 764 ms 83572 KB Output is correct
32 Correct 111 ms 83572 KB Output is correct
33 Correct 769 ms 83572 KB Output is correct
34 Correct 823 ms 83572 KB Output is correct
35 Correct 840 ms 83572 KB Output is correct
36 Correct 880 ms 83572 KB Output is correct
37 Correct 575 ms 83572 KB Output is correct
38 Correct 568 ms 83572 KB Output is correct
39 Correct 406 ms 83572 KB Output is correct
40 Correct 416 ms 83572 KB Output is correct
41 Correct 705 ms 83572 KB Output is correct
42 Correct 705 ms 83572 KB Output is correct
43 Correct 87 ms 83572 KB Output is correct
44 Correct 718 ms 83572 KB Output is correct
45 Correct 643 ms 83572 KB Output is correct
46 Correct 576 ms 83572 KB Output is correct
47 Correct 352 ms 83572 KB Output is correct
48 Correct 349 ms 83572 KB Output is correct
49 Correct 457 ms 83572 KB Output is correct
50 Correct 528 ms 83572 KB Output is correct
51 Correct 389 ms 83572 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 852 ms 93224 KB Output is correct
2 Correct 1790 ms 93224 KB Output is correct
3 Correct 783 ms 99232 KB Output is correct
4 Correct 779 ms 99232 KB Output is correct
5 Correct 2412 ms 100420 KB Output is correct
6 Correct 1999 ms 100420 KB Output is correct
7 Correct 769 ms 100420 KB Output is correct
8 Correct 809 ms 100420 KB Output is correct
9 Correct 843 ms 100420 KB Output is correct
10 Correct 872 ms 100420 KB Output is correct
11 Correct 938 ms 100420 KB Output is correct
12 Correct 982 ms 100420 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3610 ms 235716 KB Output is correct
2 Correct 318 ms 235716 KB Output is correct
3 Correct 4323 ms 235716 KB Output is correct
4 Correct 3277 ms 309628 KB Output is correct
5 Correct 3083 ms 309628 KB Output is correct
6 Correct 3193 ms 309628 KB Output is correct
7 Correct 4903 ms 309628 KB Output is correct
8 Correct 4500 ms 309628 KB Output is correct
9 Correct 2635 ms 309628 KB Output is correct
10 Correct 3309 ms 309628 KB Output is correct
11 Correct 3431 ms 309628 KB Output is correct
12 Correct 3480 ms 309628 KB Output is correct
13 Correct 1858 ms 309628 KB Output is correct
14 Correct 1869 ms 309628 KB Output is correct
15 Correct 1838 ms 309628 KB Output is correct
16 Correct 1905 ms 309628 KB Output is correct
17 Correct 1958 ms 309628 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 35576 KB Output is correct
2 Correct 40 ms 35576 KB Output is correct
3 Correct 43 ms 35636 KB Output is correct
4 Correct 41 ms 35768 KB Output is correct
5 Correct 44 ms 35768 KB Output is correct
6 Correct 39 ms 35896 KB Output is correct
7 Correct 33 ms 36024 KB Output is correct
8 Correct 41 ms 36024 KB Output is correct
9 Correct 44 ms 36024 KB Output is correct
10 Correct 36 ms 36024 KB Output is correct
11 Correct 35 ms 36024 KB Output is correct
12 Correct 43 ms 36024 KB Output is correct
13 Correct 42 ms 36024 KB Output is correct
14 Correct 42 ms 36024 KB Output is correct
15 Correct 42 ms 36024 KB Output is correct
16 Correct 40 ms 36024 KB Output is correct
17 Correct 35 ms 36024 KB Output is correct
18 Correct 33 ms 36024 KB Output is correct
19 Correct 32 ms 36024 KB Output is correct
20 Correct 33 ms 36024 KB Output is correct
21 Correct 32 ms 36024 KB Output is correct
22 Correct 40 ms 36152 KB Output is correct
23 Correct 37 ms 36152 KB Output is correct
24 Correct 42 ms 36152 KB Output is correct
25 Correct 39 ms 36152 KB Output is correct
26 Correct 47 ms 36152 KB Output is correct
27 Correct 48 ms 36152 KB Output is correct
28 Correct 41 ms 36152 KB Output is correct
29 Correct 40 ms 36152 KB Output is correct
30 Correct 36 ms 36152 KB Output is correct
31 Correct 764 ms 83572 KB Output is correct
32 Correct 111 ms 83572 KB Output is correct
33 Correct 769 ms 83572 KB Output is correct
34 Correct 823 ms 83572 KB Output is correct
35 Correct 840 ms 83572 KB Output is correct
36 Correct 880 ms 83572 KB Output is correct
37 Correct 575 ms 83572 KB Output is correct
38 Correct 568 ms 83572 KB Output is correct
39 Correct 406 ms 83572 KB Output is correct
40 Correct 416 ms 83572 KB Output is correct
41 Correct 705 ms 83572 KB Output is correct
42 Correct 705 ms 83572 KB Output is correct
43 Correct 87 ms 83572 KB Output is correct
44 Correct 718 ms 83572 KB Output is correct
45 Correct 643 ms 83572 KB Output is correct
46 Correct 576 ms 83572 KB Output is correct
47 Correct 352 ms 83572 KB Output is correct
48 Correct 349 ms 83572 KB Output is correct
49 Correct 457 ms 83572 KB Output is correct
50 Correct 528 ms 83572 KB Output is correct
51 Correct 389 ms 83572 KB Output is correct
52 Correct 779 ms 309628 KB Output is correct
53 Correct 741 ms 309628 KB Output is correct
54 Correct 649 ms 309628 KB Output is correct
55 Correct 658 ms 309628 KB Output is correct
56 Correct 723 ms 309628 KB Output is correct
57 Correct 658 ms 309628 KB Output is correct
58 Correct 791 ms 309628 KB Output is correct
59 Correct 688 ms 309628 KB Output is correct
60 Correct 748 ms 309628 KB Output is correct
61 Correct 175 ms 309628 KB Output is correct
62 Correct 764 ms 309628 KB Output is correct
63 Correct 834 ms 309628 KB Output is correct
64 Correct 708 ms 309628 KB Output is correct
65 Correct 777 ms 309628 KB Output is correct
66 Correct 628 ms 309628 KB Output is correct
67 Correct 183 ms 309628 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 35576 KB Output is correct
2 Correct 40 ms 35576 KB Output is correct
3 Correct 43 ms 35636 KB Output is correct
4 Correct 41 ms 35768 KB Output is correct
5 Correct 44 ms 35768 KB Output is correct
6 Correct 39 ms 35896 KB Output is correct
7 Correct 33 ms 36024 KB Output is correct
8 Correct 41 ms 36024 KB Output is correct
9 Correct 44 ms 36024 KB Output is correct
10 Correct 36 ms 36024 KB Output is correct
11 Correct 35 ms 36024 KB Output is correct
12 Correct 43 ms 36024 KB Output is correct
13 Correct 42 ms 36024 KB Output is correct
14 Correct 42 ms 36024 KB Output is correct
15 Correct 42 ms 36024 KB Output is correct
16 Correct 40 ms 36024 KB Output is correct
17 Correct 35 ms 36024 KB Output is correct
18 Correct 33 ms 36024 KB Output is correct
19 Correct 32 ms 36024 KB Output is correct
20 Correct 33 ms 36024 KB Output is correct
21 Correct 32 ms 36024 KB Output is correct
22 Correct 40 ms 36152 KB Output is correct
23 Correct 37 ms 36152 KB Output is correct
24 Correct 42 ms 36152 KB Output is correct
25 Correct 39 ms 36152 KB Output is correct
26 Correct 47 ms 36152 KB Output is correct
27 Correct 48 ms 36152 KB Output is correct
28 Correct 41 ms 36152 KB Output is correct
29 Correct 40 ms 36152 KB Output is correct
30 Correct 36 ms 36152 KB Output is correct
31 Correct 764 ms 83572 KB Output is correct
32 Correct 111 ms 83572 KB Output is correct
33 Correct 769 ms 83572 KB Output is correct
34 Correct 823 ms 83572 KB Output is correct
35 Correct 840 ms 83572 KB Output is correct
36 Correct 880 ms 83572 KB Output is correct
37 Correct 575 ms 83572 KB Output is correct
38 Correct 568 ms 83572 KB Output is correct
39 Correct 406 ms 83572 KB Output is correct
40 Correct 416 ms 83572 KB Output is correct
41 Correct 705 ms 83572 KB Output is correct
42 Correct 705 ms 83572 KB Output is correct
43 Correct 87 ms 83572 KB Output is correct
44 Correct 718 ms 83572 KB Output is correct
45 Correct 643 ms 83572 KB Output is correct
46 Correct 576 ms 83572 KB Output is correct
47 Correct 352 ms 83572 KB Output is correct
48 Correct 349 ms 83572 KB Output is correct
49 Correct 457 ms 83572 KB Output is correct
50 Correct 528 ms 83572 KB Output is correct
51 Correct 389 ms 83572 KB Output is correct
52 Correct 852 ms 93224 KB Output is correct
53 Correct 1790 ms 93224 KB Output is correct
54 Correct 783 ms 99232 KB Output is correct
55 Correct 779 ms 99232 KB Output is correct
56 Correct 2412 ms 100420 KB Output is correct
57 Correct 1999 ms 100420 KB Output is correct
58 Correct 769 ms 100420 KB Output is correct
59 Correct 809 ms 100420 KB Output is correct
60 Correct 843 ms 100420 KB Output is correct
61 Correct 872 ms 100420 KB Output is correct
62 Correct 938 ms 100420 KB Output is correct
63 Correct 982 ms 100420 KB Output is correct
64 Correct 3610 ms 235716 KB Output is correct
65 Correct 318 ms 235716 KB Output is correct
66 Correct 4323 ms 235716 KB Output is correct
67 Correct 3277 ms 309628 KB Output is correct
68 Correct 3083 ms 309628 KB Output is correct
69 Correct 3193 ms 309628 KB Output is correct
70 Correct 4903 ms 309628 KB Output is correct
71 Correct 4500 ms 309628 KB Output is correct
72 Correct 2635 ms 309628 KB Output is correct
73 Correct 3309 ms 309628 KB Output is correct
74 Correct 3431 ms 309628 KB Output is correct
75 Correct 3480 ms 309628 KB Output is correct
76 Correct 1858 ms 309628 KB Output is correct
77 Correct 1869 ms 309628 KB Output is correct
78 Correct 1838 ms 309628 KB Output is correct
79 Correct 1905 ms 309628 KB Output is correct
80 Correct 1958 ms 309628 KB Output is correct
81 Correct 779 ms 309628 KB Output is correct
82 Correct 741 ms 309628 KB Output is correct
83 Correct 649 ms 309628 KB Output is correct
84 Correct 658 ms 309628 KB Output is correct
85 Correct 723 ms 309628 KB Output is correct
86 Correct 658 ms 309628 KB Output is correct
87 Correct 791 ms 309628 KB Output is correct
88 Correct 688 ms 309628 KB Output is correct
89 Correct 748 ms 309628 KB Output is correct
90 Correct 175 ms 309628 KB Output is correct
91 Correct 764 ms 309628 KB Output is correct
92 Correct 834 ms 309628 KB Output is correct
93 Correct 708 ms 309628 KB Output is correct
94 Correct 777 ms 309628 KB Output is correct
95 Correct 628 ms 309628 KB Output is correct
96 Correct 183 ms 309628 KB Output is correct
97 Correct 4891 ms 379968 KB Output is correct
98 Correct 379 ms 379968 KB Output is correct
99 Execution timed out 5026 ms 379968 KB Time limit exceeded
100 Halted 0 ms 0 KB -