oj.uz

답안 #233116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233116 2020-05-19T11:33:31 Z nvmdava 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 115536 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 2000005
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
 
int x[N], ans[N], y[N], l[N], t[N], a[N], b[N];
int n, k, q;
vector<int> tmp;
 
vector<pair<int, int> > sh[N];
map<int, int> in;
multiset<int> ok;
vector<pair<pair<int, int>, pair<int, int> > > lol;
int seg[N];
int hel;
void update(int id, int l, int r, int L, int R, int v){
    if(l >= L && r <= R){
        seg[id] = max(seg[id], v);
        return;
    }
    if(l > R || r < L) return;
    int m = (l + r) >> 1;
    update(id << 1, l, m, L, R, v);
    update(id << 1 | 1, m + 1, r, L, R, v);
}
 
int query(int id, int l, int r, int x){
    if(x < l || x > r) return 0;
    if(l == r) return seg[id];
    int m = (l + r) >> 1;
    return max(seg[id], max(query(id << 1, l, m, x), query(id << 1 | 1, m + 1, r, x)));
}
 
void solve(){
    lol.clear();
    memset(seg, 0, sizeof seg);
    for(int i = 1; i <= k; ++i){
        in.clear();
        ok.clear();
        in[INF] = 1;
        in[-INF] = 1;
        for(auto& x : sh[i]){
            if(x.ss > 0){
                ok.insert(x.ss);
                if(ok.count(x.ss) >= 2)
                    continue;
                auto r = in.insert({x.ss, x.ff}).ff;
                auto l = r++;
                auto it = l--;
                if(r -> ss < x.ff && r -> ff > 0)
                    lol.push_back({{(r -> ff + l -> ff) / 2, r -> ff}, {r -> ss, x.ff - 1}});
                r -> ss = x.ff;
            } else {
                ok.erase(ok.find(-x.ss));
                if(ok.count(-x.ss))
                    continue;
                auto r = in.find(-x.ss);
                auto l = r++;
                auto it = l--;
                if(it -> ss < x.ff && it -> ff > 0)
                    lol.push_back({{(it -> ff + l -> ff) / 2, it -> ff}, {it -> ss, x.ff - 1}});
                if(r -> ss < x.ff && r -> ff > 0)
                    lol.push_back({{(it -> ff + r -> ff) / 2, r -> ff}, {r -> ss, x.ff - 1}});
                in[r -> ff] = x.ff;
                in.erase(it);
            }
        }
        auto r = in.begin();
        auto l = r++;
        lol.push_back({{(r -> ff + l -> ff) / 2, r -> ff}, {r -> ss, hel}});
    }
    for(int i = 1; i <= q; ++i)
        lol.push_back({{l[i], 1'200'000'000}, {i, y[i]}});
    
    sort(lol.begin(), lol.end(), [](const pair<pair<int, int>, pair<int, int> >& lhs, const pair<pair<int, int>, pair<int, int> >& rhs){
        return lhs.ff < rhs.ff;
    });
    for(auto& x : lol){
        if(x.ff.ss != 1'200'000'000)
            update(1, 1, hel, x.ss.ff, x.ss.ss, x.ff.ss);
        else
            ans[x.ss.ff] = max(ans[x.ss.ff], query(1, 1, hel, x.ss.ss) - x.ff.ff);
    }
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cin>>n>>k>>q;
    for(int i = 1; i <= n; ++i)
        cin>>x[i]>>t[i]>>a[i]>>b[i];
    for(int i = 1; i <= q; ++i){
        cin>>l[i]>>y[i];
        l[i] <<= 1;
        tmp.push_back(y[i]);
    }
    sort(tmp.begin(), tmp.end());
    tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
    hel = tmp.size();
    for(int i = 1; i <= q; ++i)
        y[i] = upper_bound(tmp.begin(), tmp.end(), y[i]) - tmp.begin();
    for(int i = 1; i <= n; ++i){
        a[i] = lower_bound(tmp.begin(), tmp.end(), a[i]) - tmp.begin() + 1;
        b[i] = lower_bound(tmp.begin(), tmp.end(), b[i] + 1) - tmp.begin() + 1;
        if(a[i] < b[i]){
            x[i] <<= 1;
            sh[t[i]].push_back({a[i], x[i]});
            sh[t[i]].push_back({b[i], -x[i]});
        }
    }
 
    for(int i = 1; i <= k; ++i)
        sort(sh[i].begin(), sh[i].end(), [](const pair<int, int>& lhs, const pair<int, int>& rhs){
            return lhs.ff < rhs.ff;
        });
    solve();
 
    for(int i = 1; i <= q; ++i)
        l[i] = 200'000'002 - l[i];
    for(int i = 1; i <= k; ++i)
        for(auto& x : sh[i])
            if(x.ss > 0)
                x.ss = 200'000'002 - x.ss;
            else
                x.ss = -200'000'002 - x.ss;
    solve();
 
    for(int i = 1; i <= q; ++i){
        if(ans[i] > 400'000'002)
            cout<<"-1\n";
        else
            cout<<ans[i] / 2<<'\n';
    }
}

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:54:22: warning: variable 'it' set but not used [-Wunused-but-set-variable]
                 auto it = l--;
                      ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 55160 KB Output is correct
2 Correct 38 ms 55168 KB Output is correct
3 Correct 37 ms 55288 KB Output is correct
4 Correct 37 ms 55160 KB Output is correct
5 Correct 39 ms 55296 KB Output is correct
6 Correct 39 ms 55296 KB Output is correct
7 Correct 45 ms 55288 KB Output is correct
8 Correct 43 ms 55288 KB Output is correct
9 Correct 39 ms 55288 KB Output is correct
10 Correct 38 ms 55296 KB Output is correct
11 Correct 41 ms 55296 KB Output is correct
12 Correct 38 ms 55296 KB Output is correct
13 Correct 38 ms 55288 KB Output is correct
14 Correct 39 ms 55296 KB Output is correct
15 Correct 40 ms 55296 KB Output is correct
16 Correct 39 ms 55288 KB Output is correct
17 Correct 39 ms 55296 KB Output is correct
18 Correct 39 ms 55288 KB Output is correct
19 Correct 39 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 38 ms 55288 KB Output is correct
22 Correct 39 ms 55296 KB Output is correct
23 Correct 39 ms 55296 KB Output is correct
24 Correct 39 ms 55296 KB Output is correct
25 Correct 39 ms 55288 KB Output is correct
26 Correct 38 ms 55288 KB Output is correct
27 Correct 38 ms 55296 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 39 ms 55288 KB Output is correct
30 Correct 37 ms 55296 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 55160 KB Output is correct
2 Correct 38 ms 55168 KB Output is correct
3 Correct 37 ms 55288 KB Output is correct
4 Correct 37 ms 55160 KB Output is correct
5 Correct 39 ms 55296 KB Output is correct
6 Correct 39 ms 55296 KB Output is correct
7 Correct 45 ms 55288 KB Output is correct
8 Correct 43 ms 55288 KB Output is correct
9 Correct 39 ms 55288 KB Output is correct
10 Correct 38 ms 55296 KB Output is correct
11 Correct 41 ms 55296 KB Output is correct
12 Correct 38 ms 55296 KB Output is correct
13 Correct 38 ms 55288 KB Output is correct
14 Correct 39 ms 55296 KB Output is correct
15 Correct 40 ms 55296 KB Output is correct
16 Correct 39 ms 55288 KB Output is correct
17 Correct 39 ms 55296 KB Output is correct
18 Correct 39 ms 55288 KB Output is correct
19 Correct 39 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 38 ms 55288 KB Output is correct
22 Correct 39 ms 55296 KB Output is correct
23 Correct 39 ms 55296 KB Output is correct
24 Correct 39 ms 55296 KB Output is correct
25 Correct 39 ms 55288 KB Output is correct
26 Correct 38 ms 55288 KB Output is correct
27 Correct 38 ms 55296 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 39 ms 55288 KB Output is correct
30 Correct 37 ms 55296 KB Output is correct
31 Correct 376 ms 63584 KB Output is correct
32 Correct 544 ms 59960 KB Output is correct
33 Correct 396 ms 63072 KB Output is correct
34 Correct 347 ms 63584 KB Output is correct
35 Correct 369 ms 63072 KB Output is correct
36 Correct 404 ms 63456 KB Output is correct
37 Correct 341 ms 63092 KB Output is correct
38 Correct 368 ms 62800 KB Output is correct
39 Correct 310 ms 62844 KB Output is correct
40 Correct 325 ms 62756 KB Output is correct
41 Correct 305 ms 62948 KB Output is correct
42 Correct 292 ms 63200 KB Output is correct
43 Correct 208 ms 60788 KB Output is correct
44 Correct 293 ms 63456 KB Output is correct
45 Correct 280 ms 63220 KB Output is correct
46 Correct 272 ms 63020 KB Output is correct
47 Correct 231 ms 62568 KB Output is correct
48 Correct 218 ms 62428 KB Output is correct
49 Correct 242 ms 62816 KB Output is correct
50 Correct 269 ms 63424 KB Output is correct
51 Correct 247 ms 62948 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 956 ms 88304 KB Output is correct
2 Correct 1468 ms 88088 KB Output is correct
3 Correct 1079 ms 106276 KB Output is correct
4 Correct 962 ms 88128 KB Output is correct
5 Correct 2055 ms 115536 KB Output is correct
6 Correct 1641 ms 90968 KB Output is correct
7 Correct 982 ms 106212 KB Output is correct
8 Correct 887 ms 87396 KB Output is correct
9 Correct 911 ms 87032 KB Output is correct
10 Correct 1127 ms 86548 KB Output is correct
11 Correct 1069 ms 88416 KB Output is correct
12 Correct 993 ms 86840 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1403 ms 88600 KB Output is correct
2 Execution timed out 5074 ms 70120 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 55160 KB Output is correct
2 Correct 38 ms 55168 KB Output is correct
3 Correct 37 ms 55288 KB Output is correct
4 Correct 37 ms 55160 KB Output is correct
5 Correct 39 ms 55296 KB Output is correct
6 Correct 39 ms 55296 KB Output is correct
7 Correct 45 ms 55288 KB Output is correct
8 Correct 43 ms 55288 KB Output is correct
9 Correct 39 ms 55288 KB Output is correct
10 Correct 38 ms 55296 KB Output is correct
11 Correct 41 ms 55296 KB Output is correct
12 Correct 38 ms 55296 KB Output is correct
13 Correct 38 ms 55288 KB Output is correct
14 Correct 39 ms 55296 KB Output is correct
15 Correct 40 ms 55296 KB Output is correct
16 Correct 39 ms 55288 KB Output is correct
17 Correct 39 ms 55296 KB Output is correct
18 Correct 39 ms 55288 KB Output is correct
19 Correct 39 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 38 ms 55288 KB Output is correct
22 Correct 39 ms 55296 KB Output is correct
23 Correct 39 ms 55296 KB Output is correct
24 Correct 39 ms 55296 KB Output is correct
25 Correct 39 ms 55288 KB Output is correct
26 Correct 38 ms 55288 KB Output is correct
27 Correct 38 ms 55296 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 39 ms 55288 KB Output is correct
30 Correct 37 ms 55296 KB Output is correct
31 Correct 376 ms 63584 KB Output is correct
32 Correct 544 ms 59960 KB Output is correct
33 Correct 396 ms 63072 KB Output is correct
34 Correct 347 ms 63584 KB Output is correct
35 Correct 369 ms 63072 KB Output is correct
36 Correct 404 ms 63456 KB Output is correct
37 Correct 341 ms 63092 KB Output is correct
38 Correct 368 ms 62800 KB Output is correct
39 Correct 310 ms 62844 KB Output is correct
40 Correct 325 ms 62756 KB Output is correct
41 Correct 305 ms 62948 KB Output is correct
42 Correct 292 ms 63200 KB Output is correct
43 Correct 208 ms 60788 KB Output is correct
44 Correct 293 ms 63456 KB Output is correct
45 Correct 280 ms 63220 KB Output is correct
46 Correct 272 ms 63020 KB Output is correct
47 Correct 231 ms 62568 KB Output is correct
48 Correct 218 ms 62428 KB Output is correct
49 Correct 242 ms 62816 KB Output is correct
50 Correct 269 ms 63424 KB Output is correct
51 Correct 247 ms 62948 KB Output is correct
52 Correct 337 ms 67432 KB Output is correct
53 Correct 328 ms 67432 KB Output is correct
54 Correct 325 ms 63456 KB Output is correct
55 Correct 295 ms 63700 KB Output is correct
56 Correct 310 ms 67176 KB Output is correct
57 Correct 289 ms 63084 KB Output is correct
58 Correct 307 ms 63588 KB Output is correct
59 Correct 310 ms 67044 KB Output is correct
60 Correct 291 ms 63200 KB Output is correct
61 Correct 148 ms 63716 KB Output is correct
62 Correct 323 ms 67432 KB Output is correct
63 Correct 322 ms 67044 KB Output is correct
64 Correct 326 ms 63328 KB Output is correct
65 Correct 305 ms 63200 KB Output is correct
66 Correct 303 ms 63264 KB Output is correct
67 Correct 171 ms 62700 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 55160 KB Output is correct
2 Correct 38 ms 55168 KB Output is correct
3 Correct 37 ms 55288 KB Output is correct
4 Correct 37 ms 55160 KB Output is correct
5 Correct 39 ms 55296 KB Output is correct
6 Correct 39 ms 55296 KB Output is correct
7 Correct 45 ms 55288 KB Output is correct
8 Correct 43 ms 55288 KB Output is correct
9 Correct 39 ms 55288 KB Output is correct
10 Correct 38 ms 55296 KB Output is correct
11 Correct 41 ms 55296 KB Output is correct
12 Correct 38 ms 55296 KB Output is correct
13 Correct 38 ms 55288 KB Output is correct
14 Correct 39 ms 55296 KB Output is correct
15 Correct 40 ms 55296 KB Output is correct
16 Correct 39 ms 55288 KB Output is correct
17 Correct 39 ms 55296 KB Output is correct
18 Correct 39 ms 55288 KB Output is correct
19 Correct 39 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 38 ms 55288 KB Output is correct
22 Correct 39 ms 55296 KB Output is correct
23 Correct 39 ms 55296 KB Output is correct
24 Correct 39 ms 55296 KB Output is correct
25 Correct 39 ms 55288 KB Output is correct
26 Correct 38 ms 55288 KB Output is correct
27 Correct 38 ms 55296 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 39 ms 55288 KB Output is correct
30 Correct 37 ms 55296 KB Output is correct
31 Correct 376 ms 63584 KB Output is correct
32 Correct 544 ms 59960 KB Output is correct
33 Correct 396 ms 63072 KB Output is correct
34 Correct 347 ms 63584 KB Output is correct
35 Correct 369 ms 63072 KB Output is correct
36 Correct 404 ms 63456 KB Output is correct
37 Correct 341 ms 63092 KB Output is correct
38 Correct 368 ms 62800 KB Output is correct
39 Correct 310 ms 62844 KB Output is correct
40 Correct 325 ms 62756 KB Output is correct
41 Correct 305 ms 62948 KB Output is correct
42 Correct 292 ms 63200 KB Output is correct
43 Correct 208 ms 60788 KB Output is correct
44 Correct 293 ms 63456 KB Output is correct
45 Correct 280 ms 63220 KB Output is correct
46 Correct 272 ms 63020 KB Output is correct
47 Correct 231 ms 62568 KB Output is correct
48 Correct 218 ms 62428 KB Output is correct
49 Correct 242 ms 62816 KB Output is correct
50 Correct 269 ms 63424 KB Output is correct
51 Correct 247 ms 62948 KB Output is correct
52 Correct 956 ms 88304 KB Output is correct
53 Correct 1468 ms 88088 KB Output is correct
54 Correct 1079 ms 106276 KB Output is correct
55 Correct 962 ms 88128 KB Output is correct
56 Correct 2055 ms 115536 KB Output is correct
57 Correct 1641 ms 90968 KB Output is correct
58 Correct 982 ms 106212 KB Output is correct
59 Correct 887 ms 87396 KB Output is correct
60 Correct 911 ms 87032 KB Output is correct
61 Correct 1127 ms 86548 KB Output is correct
62 Correct 1069 ms 88416 KB Output is correct
63 Correct 993 ms 86840 KB Output is correct
64 Correct 1403 ms 88600 KB Output is correct
65 Execution timed out 5074 ms 70120 KB Time limit exceeded
66 Halted 0 ms 0 KB -