oj.uz

답안 #104355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104355 2019-04-05T15:04:09 Z tieunhi 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 284512 KB 
#include <bits/stdc++.h>
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define maxN 1000000000
#define N 300005
using namespace std;

struct Store {
    int x, type, a, b;
};
struct Query {
    int x, t, id;
    bool operator < (const Query &rhs) const {
        return x < rhs.x;
    }
};
struct Segment {

    int L, R, a, b;
    Segment(int _L=0, int _R=0, int _a=0, int _b=0) : L(_L), R(_R), a(_a), b(_b) {}
};
bool cmpSegLR(Segment p, Segment q) {
    return p.R > q.R || (p.L == q.L && p.L > q.L);
}
bool cmpSegRL(Segment p, Segment q) {
    return p.L < q.L || (p.R == q.R && p.R < q.R);
}

struct SegOnYear {
    vector<int> t[N << 2];
    void update(int l, int r, int id, int x, int y, int val) {
        if (l > y || r < x) return;
        if (l >= x && r <= y) {
            t[id].PB(val);
            return;
        }
        int mid = (r + l)/2;
        update(l, mid, id*2, x, y, val);
        update(mid+1, r, id*2+1, x, y, val);
    }
}tSegLR, tSegRL;
Store sto[N];
Query que[N];
map<pii, int> maLR, maRL;
vector<Segment> segLR, segRL;
int n, k, Q, tMax;
multiset<int> curSet;

vector<pair<int, pii> > allType[N];
int res[N];

int findLef(int x) {
    auto it = curSet.upper_bound(x);
    it--;
    return (*it);
}
int findRig(int x) {
    auto it = curSet.upper_bound(x);
    return (*it);
}
void addSeg(int L, int R, int time) {
    int mid = (R + L)/2;
    maLR[mp(L, mid)] = time;
    maRL[mp(mid, R)] = time;
}
void remSeg(int L, int R, int time) {
    int mid = (R + L)/2;
    if (time >= maLR[mp(L, mid)])
        segLR.PB(Segment(L, mid, maLR[mp(L, mid)], time));
    if (time >= maRL[mp(mid, R)])
        segRL.PB(Segment(mid, R, maRL[mp(mid, R)], time));
}
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
void setup() {
    read(n); read(k); read(Q);

    vector<int> allYear;
    FOR(i, 1, n) {
        read(sto[i].x); read(sto[i].type); read(sto[i].a); read(sto[i].b);
        sto[i].x *= 2;
    }
    FOR(i, 1, Q) {
        read(que[i].x); read(que[i].t); que[i].x *= 2;
        que[i].id = i;
        allYear.PB(que[i].t);
    }
    sort(allYear.begin(), allYear.end());
    allYear.resize(unique(allYear.begin(), allYear.end()) - allYear.begin());
    FOR(i, 1, n) {
        sto[i].a = lower_bound(allYear.begin(), allYear.end(), sto[i].a) - allYear.begin() + 1;
        sto[i].b = upper_bound(allYear.begin(), allYear.end(), sto[i].b) - allYear.begin();
    }
    FOR(i, 1, Q) {
        que[i].t = lower_bound(allYear.begin(), allYear.end(), que[i].t) - allYear.begin() + 1;
    }
    tMax = allYear.size() + 1;
    sort(que+1, que+Q+1);

    FOR(i, 1, n) {
        if (sto[i].a > sto[i].b) continue;
        int type = sto[i].type;
        allType[type].PB(mp(sto[i].a, mp(0, sto[i].x)));
        allType[type].PB(mp(sto[i].b, mp(1, sto[i].x)));
    }
    FOR(i, 1, k) {
        curSet.clear();
        curSet.insert(-maxN); curSet.insert(maxN);
        addSeg(-maxN, maxN, 0);
        sort(allType[i].begin(), allType[i].end());
        for (auto z : allType[i]) {
            int x = z.S.S;
            int time = z.F;
            int type = z.S.F;
            if (type == 0) {
                int L = findLef(x), R = findRig(x);

                remSeg(L, R, time-1);
                addSeg(L, x, time);
                addSeg(x, R, time);
                curSet.insert(x);
            }
            else {
                auto it = curSet.find(x);
                curSet.erase(it);
                int L = findLef(x), R = findRig(x);
                remSeg(L, x, time);
                remSeg(x, R, time);
                addSeg(L, R, time+1);
            }
        }
    }
    sort(segLR.begin(), segLR.end(), cmpSegLR);
    sort(segRL.begin(), segRL.end(), cmpSegRL);
    for (int i = 0; i < segLR.size(); i++) {
        int a = segLR[i].a;
        int b = segLR[i].b;
        tSegLR.update(1, tMax, 1, a, b, i);
    }
    for (int i = 0; i < segRL.size(); i++) {
        int a = segRL[i].a;
        int b = segRL[i].b;
        tSegRL.update(1, tMax, 1, a, b, i);
    }
}

void rayLR(vector<int> seg, vector<int> idQ) {

    int x0 = maxN, pp = -1;
    for (int i = idQ.size()-1; i >= 0; i--) {
        int id = idQ[i];
        while (pp < (int)seg.size()-1 && segLR[seg[pp+1]].R >= que[id].x) {
            pp++;
            x0 = min(x0, segLR[seg[pp]].L);
        }
        if (pp != -1) res[que[id].id] = max(res[que[id].id], que[id].x - x0);
    }
}

void rayRL(vector<int> seg, vector<int> idQ) {

    int y0 = -maxN, pp = -1;
    for (auto id : idQ) {
        while (pp < (int)seg.size()-1 && segRL[seg[pp+1]].L <= que[id].x) {
            pp++;
            y0 = max(y0, segRL[seg[pp]].R);
        }
        if (pp != -1) res[que[id].id] = max(res[que[id].id], y0 - que[id].x);
    }
}

void solve(int l, int r, int id, vector<int> curQ) {

    if (curQ.size() == 0) return;
    rayLR(tSegLR.t[id], curQ);
    rayRL(tSegRL.t[id], curQ);
    if (l == r) return;
    int mid = (r + l)/2;

    vector<int> qLef, qRig;
    for (auto id : curQ) {
        if (que[id].t <= mid) qLef.PB(id);
        else qRig.PB(id);
    }
    solve(l, mid, id*2, qLef);
    solve(mid+1, r, id*2+1, qRig);
}
int cnt[N], impossible[N];
void checkImpossible() {

    vector<pair<pii, int> > check;
    FOR(i, 1, n) {
        check.PB(mp(mp(sto[i].a, 0), sto[i].type));
        check.PB(mp(mp(sto[i].b, 2), sto[i].type));
    }
    FOR(i, 1, Q) {
        check.PB(mp(mp(que[i].t, 1), que[i].id));
    }

    sort(check.begin(), check.end());

    int curCnt = 0;
    for (auto z : check) {
        int time = z.F.F;
        int type = z.F.S;
        int kind = z.S;
        if (type == 1) impossible[kind] = (curCnt < k);
        else {

            if (cnt[kind]) curCnt--;
            if (type == 0) cnt[kind]++;
            else cnt[kind]--;
            if (cnt[kind]) curCnt++;
        }
    }
}

int main() {
    //freopen("NEWHOME.INP", "r", stdin);
    //freopen("NEWHOME.OUT", "w", stdout);
    setup();

    vector<int> allQ;
    FOR(i, 1, Q) allQ.PB(i);

    solve(1, tMax, 1, allQ);


    checkImpossible();
    FOR(i, 1, Q) {
        if (impossible[i]) writeln(-1);
        else writeln(res[i]/2);
    }
}

Compilation message

new_home.cpp: In function 'void setup()':
new_home.cpp:142:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < segLR.size(); i++) {
                     ~~^~~~~~~~~~~~~~
new_home.cpp:147:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < segRL.size(); i++) {
                     ~~^~~~~~~~~~~~~~
new_home.cpp: In function 'void checkImpossible()':
new_home.cpp:211:13: warning: unused variable 'time' [-Wunused-variable]
         int time = z.F.F;
             ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 63736 KB Output is correct
2 Correct 68 ms 63736 KB Output is correct
3 Correct 70 ms 63736 KB Output is correct
4 Correct 63 ms 63864 KB Output is correct
5 Correct 70 ms 63864 KB Output is correct
6 Correct 70 ms 64040 KB Output is correct
7 Correct 76 ms 64120 KB Output is correct
8 Correct 72 ms 64132 KB Output is correct
9 Correct 74 ms 64120 KB Output is correct
10 Correct 73 ms 64120 KB Output is correct
11 Correct 85 ms 64120 KB Output is correct
12 Correct 73 ms 63992 KB Output is correct
13 Correct 63 ms 63992 KB Output is correct
14 Correct 71 ms 63992 KB Output is correct
15 Correct 69 ms 64120 KB Output is correct
16 Correct 68 ms 64120 KB Output is correct
17 Correct 67 ms 64120 KB Output is correct
18 Correct 69 ms 64248 KB Output is correct
19 Correct 72 ms 64120 KB Output is correct
20 Correct 70 ms 64132 KB Output is correct
21 Correct 72 ms 63960 KB Output is correct
22 Correct 68 ms 64120 KB Output is correct
23 Correct 72 ms 64120 KB Output is correct
24 Correct 82 ms 64144 KB Output is correct
25 Correct 75 ms 64120 KB Output is correct
26 Correct 66 ms 64176 KB Output is correct
27 Correct 82 ms 63992 KB Output is correct
28 Correct 80 ms 64120 KB Output is correct
29 Correct 73 ms 64120 KB Output is correct
30 Correct 69 ms 63992 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 63736 KB Output is correct
2 Correct 68 ms 63736 KB Output is correct
3 Correct 70 ms 63736 KB Output is correct
4 Correct 63 ms 63864 KB Output is correct
5 Correct 70 ms 63864 KB Output is correct
6 Correct 70 ms 64040 KB Output is correct
7 Correct 76 ms 64120 KB Output is correct
8 Correct 72 ms 64132 KB Output is correct
9 Correct 74 ms 64120 KB Output is correct
10 Correct 73 ms 64120 KB Output is correct
11 Correct 85 ms 64120 KB Output is correct
12 Correct 73 ms 63992 KB Output is correct
13 Correct 63 ms 63992 KB Output is correct
14 Correct 71 ms 63992 KB Output is correct
15 Correct 69 ms 64120 KB Output is correct
16 Correct 68 ms 64120 KB Output is correct
17 Correct 67 ms 64120 KB Output is correct
18 Correct 69 ms 64248 KB Output is correct
19 Correct 72 ms 64120 KB Output is correct
20 Correct 70 ms 64132 KB Output is correct
21 Correct 72 ms 63960 KB Output is correct
22 Correct 68 ms 64120 KB Output is correct
23 Correct 72 ms 64120 KB Output is correct
24 Correct 82 ms 64144 KB Output is correct
25 Correct 75 ms 64120 KB Output is correct
26 Correct 66 ms 64176 KB Output is correct
27 Correct 82 ms 63992 KB Output is correct
28 Correct 80 ms 64120 KB Output is correct
29 Correct 73 ms 64120 KB Output is correct
30 Correct 69 ms 63992 KB Output is correct
31 Correct 1780 ms 126664 KB Output is correct
32 Correct 199 ms 74032 KB Output is correct
33 Correct 1829 ms 124816 KB Output is correct
34 Correct 1751 ms 125644 KB Output is correct
35 Correct 1699 ms 126208 KB Output is correct
36 Correct 1866 ms 126180 KB Output is correct
37 Correct 1390 ms 120388 KB Output is correct
38 Correct 1160 ms 119964 KB Output is correct
39 Correct 787 ms 113168 KB Output is correct
40 Correct 895 ms 114640 KB Output is correct
41 Correct 1632 ms 119640 KB Output is correct
42 Correct 1692 ms 120804 KB Output is correct
43 Correct 165 ms 74732 KB Output is correct
44 Correct 1653 ms 119716 KB Output is correct
45 Correct 1553 ms 115816 KB Output is correct
46 Correct 1199 ms 109020 KB Output is correct
47 Correct 620 ms 106916 KB Output is correct
48 Correct 559 ms 104588 KB Output is correct
49 Correct 880 ms 111020 KB Output is correct
50 Correct 1018 ms 118500 KB Output is correct
51 Correct 792 ms 108900 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5058 ms 284512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5083 ms 261132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 63736 KB Output is correct
2 Correct 68 ms 63736 KB Output is correct
3 Correct 70 ms 63736 KB Output is correct
4 Correct 63 ms 63864 KB Output is correct
5 Correct 70 ms 63864 KB Output is correct
6 Correct 70 ms 64040 KB Output is correct
7 Correct 76 ms 64120 KB Output is correct
8 Correct 72 ms 64132 KB Output is correct
9 Correct 74 ms 64120 KB Output is correct
10 Correct 73 ms 64120 KB Output is correct
11 Correct 85 ms 64120 KB Output is correct
12 Correct 73 ms 63992 KB Output is correct
13 Correct 63 ms 63992 KB Output is correct
14 Correct 71 ms 63992 KB Output is correct
15 Correct 69 ms 64120 KB Output is correct
16 Correct 68 ms 64120 KB Output is correct
17 Correct 67 ms 64120 KB Output is correct
18 Correct 69 ms 64248 KB Output is correct
19 Correct 72 ms 64120 KB Output is correct
20 Correct 70 ms 64132 KB Output is correct
21 Correct 72 ms 63960 KB Output is correct
22 Correct 68 ms 64120 KB Output is correct
23 Correct 72 ms 64120 KB Output is correct
24 Correct 82 ms 64144 KB Output is correct
25 Correct 75 ms 64120 KB Output is correct
26 Correct 66 ms 64176 KB Output is correct
27 Correct 82 ms 63992 KB Output is correct
28 Correct 80 ms 64120 KB Output is correct
29 Correct 73 ms 64120 KB Output is correct
30 Correct 69 ms 63992 KB Output is correct
31 Correct 1780 ms 126664 KB Output is correct
32 Correct 199 ms 74032 KB Output is correct
33 Correct 1829 ms 124816 KB Output is correct
34 Correct 1751 ms 125644 KB Output is correct
35 Correct 1699 ms 126208 KB Output is correct
36 Correct 1866 ms 126180 KB Output is correct
37 Correct 1390 ms 120388 KB Output is correct
38 Correct 1160 ms 119964 KB Output is correct
39 Correct 787 ms 113168 KB Output is correct
40 Correct 895 ms 114640 KB Output is correct
41 Correct 1632 ms 119640 KB Output is correct
42 Correct 1692 ms 120804 KB Output is correct
43 Correct 165 ms 74732 KB Output is correct
44 Correct 1653 ms 119716 KB Output is correct
45 Correct 1553 ms 115816 KB Output is correct
46 Correct 1199 ms 109020 KB Output is correct
47 Correct 620 ms 106916 KB Output is correct
48 Correct 559 ms 104588 KB Output is correct
49 Correct 880 ms 111020 KB Output is correct
50 Correct 1018 ms 118500 KB Output is correct
51 Correct 792 ms 108900 KB Output is correct
52 Correct 1286 ms 118808 KB Output is correct
53 Correct 1476 ms 118932 KB Output is correct
54 Correct 1632 ms 123760 KB Output is correct
55 Correct 1364 ms 122256 KB Output is correct
56 Correct 1244 ms 122152 KB Output is correct
57 Correct 1537 ms 120340 KB Output is correct
58 Correct 1382 ms 121440 KB Output is correct
59 Correct 1291 ms 121928 KB Output is correct
60 Correct 1489 ms 121060 KB Output is correct
61 Correct 209 ms 80220 KB Output is correct
62 Correct 1247 ms 120412 KB Output is correct
63 Correct 1458 ms 124716 KB Output is correct
64 Correct 1617 ms 126340 KB Output is correct
65 Correct 1689 ms 127332 KB Output is correct
66 Correct 1556 ms 122692 KB Output is correct
67 Correct 360 ms 83024 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 63736 KB Output is correct
2 Correct 68 ms 63736 KB Output is correct
3 Correct 70 ms 63736 KB Output is correct
4 Correct 63 ms 63864 KB Output is correct
5 Correct 70 ms 63864 KB Output is correct
6 Correct 70 ms 64040 KB Output is correct
7 Correct 76 ms 64120 KB Output is correct
8 Correct 72 ms 64132 KB Output is correct
9 Correct 74 ms 64120 KB Output is correct
10 Correct 73 ms 64120 KB Output is correct
11 Correct 85 ms 64120 KB Output is correct
12 Correct 73 ms 63992 KB Output is correct
13 Correct 63 ms 63992 KB Output is correct
14 Correct 71 ms 63992 KB Output is correct
15 Correct 69 ms 64120 KB Output is correct
16 Correct 68 ms 64120 KB Output is correct
17 Correct 67 ms 64120 KB Output is correct
18 Correct 69 ms 64248 KB Output is correct
19 Correct 72 ms 64120 KB Output is correct
20 Correct 70 ms 64132 KB Output is correct
21 Correct 72 ms 63960 KB Output is correct
22 Correct 68 ms 64120 KB Output is correct
23 Correct 72 ms 64120 KB Output is correct
24 Correct 82 ms 64144 KB Output is correct
25 Correct 75 ms 64120 KB Output is correct
26 Correct 66 ms 64176 KB Output is correct
27 Correct 82 ms 63992 KB Output is correct
28 Correct 80 ms 64120 KB Output is correct
29 Correct 73 ms 64120 KB Output is correct
30 Correct 69 ms 63992 KB Output is correct
31 Correct 1780 ms 126664 KB Output is correct
32 Correct 199 ms 74032 KB Output is correct
33 Correct 1829 ms 124816 KB Output is correct
34 Correct 1751 ms 125644 KB Output is correct
35 Correct 1699 ms 126208 KB Output is correct
36 Correct 1866 ms 126180 KB Output is correct
37 Correct 1390 ms 120388 KB Output is correct
38 Correct 1160 ms 119964 KB Output is correct
39 Correct 787 ms 113168 KB Output is correct
40 Correct 895 ms 114640 KB Output is correct
41 Correct 1632 ms 119640 KB Output is correct
42 Correct 1692 ms 120804 KB Output is correct
43 Correct 165 ms 74732 KB Output is correct
44 Correct 1653 ms 119716 KB Output is correct
45 Correct 1553 ms 115816 KB Output is correct
46 Correct 1199 ms 109020 KB Output is correct
47 Correct 620 ms 106916 KB Output is correct
48 Correct 559 ms 104588 KB Output is correct
49 Correct 880 ms 111020 KB Output is correct
50 Correct 1018 ms 118500 KB Output is correct
51 Correct 792 ms 108900 KB Output is correct
52 Execution timed out 5058 ms 284512 KB Time limit exceeded
53 Halted 0 ms 0 KB -