oj.uz

Submission #60866

# Submission time Handle Problem Language Result Execution time Memory
60866 2018-07-24T21:33:06 Z duality New Home (APIO18_new_home) C++11
57 / 100
 5000 ms 310456 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 37 ms 35576 KB Output is correct
2 Correct 44 ms 35576 KB Output is correct
3 Correct 33 ms 35620 KB Output is correct
4 Correct 35 ms 35624 KB Output is correct
5 Correct 40 ms 35628 KB Output is correct
6 Correct 44 ms 35892 KB Output is correct
7 Correct 50 ms 36036 KB Output is correct
8 Correct 47 ms 36036 KB Output is correct
9 Correct 46 ms 36100 KB Output is correct
10 Correct 38 ms 36100 KB Output is correct
11 Correct 43 ms 36100 KB Output is correct
12 Correct 49 ms 36164 KB Output is correct
13 Correct 46 ms 36164 KB Output is correct
14 Correct 43 ms 36164 KB Output is correct
15 Correct 47 ms 36404 KB Output is correct
16 Correct 47 ms 36404 KB Output is correct
17 Correct 47 ms 36404 KB Output is correct
18 Correct 41 ms 36404 KB Output is correct
19 Correct 43 ms 36484 KB Output is correct
20 Correct 41 ms 36484 KB Output is correct
21 Correct 43 ms 36484 KB Output is correct
22 Correct 38 ms 36484 KB Output is correct
23 Correct 45 ms 36484 KB Output is correct
24 Correct 36 ms 36484 KB Output is correct
25 Correct 39 ms 36484 KB Output is correct
26 Correct 44 ms 36496 KB Output is correct
27 Correct 48 ms 36496 KB Output is correct
28 Correct 35 ms 36496 KB Output is correct
29 Correct 46 ms 36496 KB Output is correct
30 Correct 38 ms 36496 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 35576 KB Output is correct
2 Correct 44 ms 35576 KB Output is correct
3 Correct 33 ms 35620 KB Output is correct
4 Correct 35 ms 35624 KB Output is correct
5 Correct 40 ms 35628 KB Output is correct
6 Correct 44 ms 35892 KB Output is correct
7 Correct 50 ms 36036 KB Output is correct
8 Correct 47 ms 36036 KB Output is correct
9 Correct 46 ms 36100 KB Output is correct
10 Correct 38 ms 36100 KB Output is correct
11 Correct 43 ms 36100 KB Output is correct
12 Correct 49 ms 36164 KB Output is correct
13 Correct 46 ms 36164 KB Output is correct
14 Correct 43 ms 36164 KB Output is correct
15 Correct 47 ms 36404 KB Output is correct
16 Correct 47 ms 36404 KB Output is correct
17 Correct 47 ms 36404 KB Output is correct
18 Correct 41 ms 36404 KB Output is correct
19 Correct 43 ms 36484 KB Output is correct
20 Correct 41 ms 36484 KB Output is correct
21 Correct 43 ms 36484 KB Output is correct
22 Correct 38 ms 36484 KB Output is correct
23 Correct 45 ms 36484 KB Output is correct
24 Correct 36 ms 36484 KB Output is correct
25 Correct 39 ms 36484 KB Output is correct
26 Correct 44 ms 36496 KB Output is correct
27 Correct 48 ms 36496 KB Output is correct
28 Correct 35 ms 36496 KB Output is correct
29 Correct 46 ms 36496 KB Output is correct
30 Correct 38 ms 36496 KB Output is correct
31 Correct 927 ms 84516 KB Output is correct
32 Correct 108 ms 84516 KB Output is correct
33 Correct 880 ms 84516 KB Output is correct
34 Correct 873 ms 84516 KB Output is correct
35 Correct 924 ms 84516 KB Output is correct
36 Correct 990 ms 84516 KB Output is correct
37 Correct 579 ms 84516 KB Output is correct
38 Correct 519 ms 84516 KB Output is correct
39 Correct 383 ms 84516 KB Output is correct
40 Correct 444 ms 84516 KB Output is correct
41 Correct 693 ms 84516 KB Output is correct
42 Correct 720 ms 84516 KB Output is correct
43 Correct 99 ms 84516 KB Output is correct
44 Correct 688 ms 84516 KB Output is correct
45 Correct 605 ms 84516 KB Output is correct
46 Correct 483 ms 84516 KB Output is correct
47 Correct 288 ms 84516 KB Output is correct
48 Correct 338 ms 84516 KB Output is correct
49 Correct 356 ms 84516 KB Output is correct
50 Correct 543 ms 84516 KB Output is correct
51 Correct 418 ms 84516 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 845 ms 94460 KB Output is correct
2 Correct 1827 ms 94460 KB Output is correct
3 Correct 873 ms 100500 KB Output is correct
4 Correct 796 ms 100500 KB Output is correct
5 Correct 2715 ms 101816 KB Output is correct
6 Correct 1642 ms 101816 KB Output is correct
7 Correct 821 ms 101816 KB Output is correct
8 Correct 753 ms 101816 KB Output is correct
9 Correct 703 ms 101816 KB Output is correct
10 Correct 1069 ms 101816 KB Output is correct
11 Correct 921 ms 101816 KB Output is correct
12 Correct 852 ms 101816 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3172 ms 236692 KB Output is correct
2 Correct 303 ms 236692 KB Output is correct
3 Correct 4026 ms 236692 KB Output is correct
4 Correct 3337 ms 310456 KB Output is correct
5 Correct 3652 ms 310456 KB Output is correct
6 Correct 3399 ms 310456 KB Output is correct
7 Execution timed out 5027 ms 310456 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 35576 KB Output is correct
2 Correct 44 ms 35576 KB Output is correct
3 Correct 33 ms 35620 KB Output is correct
4 Correct 35 ms 35624 KB Output is correct
5 Correct 40 ms 35628 KB Output is correct
6 Correct 44 ms 35892 KB Output is correct
7 Correct 50 ms 36036 KB Output is correct
8 Correct 47 ms 36036 KB Output is correct
9 Correct 46 ms 36100 KB Output is correct
10 Correct 38 ms 36100 KB Output is correct
11 Correct 43 ms 36100 KB Output is correct
12 Correct 49 ms 36164 KB Output is correct
13 Correct 46 ms 36164 KB Output is correct
14 Correct 43 ms 36164 KB Output is correct
15 Correct 47 ms 36404 KB Output is correct
16 Correct 47 ms 36404 KB Output is correct
17 Correct 47 ms 36404 KB Output is correct
18 Correct 41 ms 36404 KB Output is correct
19 Correct 43 ms 36484 KB Output is correct
20 Correct 41 ms 36484 KB Output is correct
21 Correct 43 ms 36484 KB Output is correct
22 Correct 38 ms 36484 KB Output is correct
23 Correct 45 ms 36484 KB Output is correct
24 Correct 36 ms 36484 KB Output is correct
25 Correct 39 ms 36484 KB Output is correct
26 Correct 44 ms 36496 KB Output is correct
27 Correct 48 ms 36496 KB Output is correct
28 Correct 35 ms 36496 KB Output is correct
29 Correct 46 ms 36496 KB Output is correct
30 Correct 38 ms 36496 KB Output is correct
31 Correct 927 ms 84516 KB Output is correct
32 Correct 108 ms 84516 KB Output is correct
33 Correct 880 ms 84516 KB Output is correct
34 Correct 873 ms 84516 KB Output is correct
35 Correct 924 ms 84516 KB Output is correct
36 Correct 990 ms 84516 KB Output is correct
37 Correct 579 ms 84516 KB Output is correct
38 Correct 519 ms 84516 KB Output is correct
39 Correct 383 ms 84516 KB Output is correct
40 Correct 444 ms 84516 KB Output is correct
41 Correct 693 ms 84516 KB Output is correct
42 Correct 720 ms 84516 KB Output is correct
43 Correct 99 ms 84516 KB Output is correct
44 Correct 688 ms 84516 KB Output is correct
45 Correct 605 ms 84516 KB Output is correct
46 Correct 483 ms 84516 KB Output is correct
47 Correct 288 ms 84516 KB Output is correct
48 Correct 338 ms 84516 KB Output is correct
49 Correct 356 ms 84516 KB Output is correct
50 Correct 543 ms 84516 KB Output is correct
51 Correct 418 ms 84516 KB Output is correct
52 Correct 720 ms 310456 KB Output is correct
53 Correct 740 ms 310456 KB Output is correct
54 Correct 826 ms 310456 KB Output is correct
55 Correct 657 ms 310456 KB Output is correct
56 Correct 626 ms 310456 KB Output is correct
57 Correct 733 ms 310456 KB Output is correct
58 Correct 837 ms 310456 KB Output is correct
59 Correct 775 ms 310456 KB Output is correct
60 Correct 836 ms 310456 KB Output is correct
61 Correct 230 ms 310456 KB Output is correct
62 Correct 693 ms 310456 KB Output is correct
63 Correct 787 ms 310456 KB Output is correct
64 Correct 835 ms 310456 KB Output is correct
65 Correct 729 ms 310456 KB Output is correct
66 Correct 650 ms 310456 KB Output is correct
67 Correct 164 ms 310456 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 35576 KB Output is correct
2 Correct 44 ms 35576 KB Output is correct
3 Correct 33 ms 35620 KB Output is correct
4 Correct 35 ms 35624 KB Output is correct
5 Correct 40 ms 35628 KB Output is correct
6 Correct 44 ms 35892 KB Output is correct
7 Correct 50 ms 36036 KB Output is correct
8 Correct 47 ms 36036 KB Output is correct
9 Correct 46 ms 36100 KB Output is correct
10 Correct 38 ms 36100 KB Output is correct
11 Correct 43 ms 36100 KB Output is correct
12 Correct 49 ms 36164 KB Output is correct
13 Correct 46 ms 36164 KB Output is correct
14 Correct 43 ms 36164 KB Output is correct
15 Correct 47 ms 36404 KB Output is correct
16 Correct 47 ms 36404 KB Output is correct
17 Correct 47 ms 36404 KB Output is correct
18 Correct 41 ms 36404 KB Output is correct
19 Correct 43 ms 36484 KB Output is correct
20 Correct 41 ms 36484 KB Output is correct
21 Correct 43 ms 36484 KB Output is correct
22 Correct 38 ms 36484 KB Output is correct
23 Correct 45 ms 36484 KB Output is correct
24 Correct 36 ms 36484 KB Output is correct
25 Correct 39 ms 36484 KB Output is correct
26 Correct 44 ms 36496 KB Output is correct
27 Correct 48 ms 36496 KB Output is correct
28 Correct 35 ms 36496 KB Output is correct
29 Correct 46 ms 36496 KB Output is correct
30 Correct 38 ms 36496 KB Output is correct
31 Correct 927 ms 84516 KB Output is correct
32 Correct 108 ms 84516 KB Output is correct
33 Correct 880 ms 84516 KB Output is correct
34 Correct 873 ms 84516 KB Output is correct
35 Correct 924 ms 84516 KB Output is correct
36 Correct 990 ms 84516 KB Output is correct
37 Correct 579 ms 84516 KB Output is correct
38 Correct 519 ms 84516 KB Output is correct
39 Correct 383 ms 84516 KB Output is correct
40 Correct 444 ms 84516 KB Output is correct
41 Correct 693 ms 84516 KB Output is correct
42 Correct 720 ms 84516 KB Output is correct
43 Correct 99 ms 84516 KB Output is correct
44 Correct 688 ms 84516 KB Output is correct
45 Correct 605 ms 84516 KB Output is correct
46 Correct 483 ms 84516 KB Output is correct
47 Correct 288 ms 84516 KB Output is correct
48 Correct 338 ms 84516 KB Output is correct
49 Correct 356 ms 84516 KB Output is correct
50 Correct 543 ms 84516 KB Output is correct
51 Correct 418 ms 84516 KB Output is correct
52 Correct 845 ms 94460 KB Output is correct
53 Correct 1827 ms 94460 KB Output is correct
54 Correct 873 ms 100500 KB Output is correct
55 Correct 796 ms 100500 KB Output is correct
56 Correct 2715 ms 101816 KB Output is correct
57 Correct 1642 ms 101816 KB Output is correct
58 Correct 821 ms 101816 KB Output is correct
59 Correct 753 ms 101816 KB Output is correct
60 Correct 703 ms 101816 KB Output is correct
61 Correct 1069 ms 101816 KB Output is correct
62 Correct 921 ms 101816 KB Output is correct
63 Correct 852 ms 101816 KB Output is correct
64 Correct 3172 ms 236692 KB Output is correct
65 Correct 303 ms 236692 KB Output is correct
66 Correct 4026 ms 236692 KB Output is correct
67 Correct 3337 ms 310456 KB Output is correct
68 Correct 3652 ms 310456 KB Output is correct
69 Correct 3399 ms 310456 KB Output is correct
70 Execution timed out 5027 ms 310456 KB Time limit exceeded
71 Halted 0 ms 0 KB -