oj.uz

답안 #233102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233102 2020-05-19T10:56:51 Z nvmdava 새 집 (APIO18_new_home) C++17
47 / 100
 1114 ms 127760 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 1000005
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];
multiset<pair<int, int> > in;
vector<pair<pair<int, int>, pair<int, int> > > lol;
int seg[N];
 
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();
        in.insert({INF, 1});
        in.insert({-INF, 1});
        for(auto& x : sh[i]){
            if(x.ss > 0){
                auto r = in.insert({x.ss, -x.ff});
                auto l = r++;
                auto it = l--;
                lol.push_back({{(r -> ff + l -> ff) / 2, r -> ff}, {-r -> ss, x.ff - 1}});
                in.insert({r -> ff, -x.ff});
                in.erase(r);
            } else {
                auto r = in.lower_bound({-x.ss, -1000000});
                auto l = r++;
                auto it = l--;
                lol.push_back({{(it -> ff + l -> ff) / 2, it -> ff}, {-it -> ss, x.ff - 1}});
                lol.push_back({{(it -> ff + r -> ff) / 2, r -> ff}, {-r -> ss, x.ff - 1}});
                in.insert({r -> ff, -x.ff});
                in.erase(it);
                in.erase(r);
            }
        }
        auto r = in.begin();
        auto l = r++;
        lol.push_back({{(r -> ff + l -> ff) / 2, r -> ff}, {-r -> ss, tmp.size()}});
    }
    for(int i = 1; i <= q; ++i)
        lol.push_back({{l[i], 1'000'000'000}, {i, y[i]}});
    
    sort(lol.begin(), lol.end());
    for(auto& x : lol){
        if(x.ff.ss != 1'000'000'000){
            if(x.ss.ff <= x.ss.ss && x.ff.ss > 0){
                update(1, 1, 300'005, x.ss.ff, x.ss.ss, x.ff.ss);
            }
        }
        else
            ans[x.ss.ff] = max(ans[x.ss.ff], query(1, 1, 300'005, 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());
 
    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());
    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] > 200'000'002)
            cout<<"-1\n";
        else
            cout<<ans[i] / 2<<'\n';
    }
}

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:49: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 20 ms 27776 KB Output is correct
2 Correct 20 ms 27776 KB Output is correct
3 Correct 20 ms 27776 KB Output is correct
4 Correct 21 ms 27776 KB Output is correct
5 Correct 22 ms 27904 KB Output is correct
6 Correct 22 ms 27904 KB Output is correct
7 Correct 22 ms 27904 KB Output is correct
8 Correct 22 ms 27904 KB Output is correct
9 Correct 23 ms 27904 KB Output is correct
10 Correct 24 ms 27904 KB Output is correct
11 Correct 22 ms 27904 KB Output is correct
12 Correct 22 ms 27904 KB Output is correct
13 Correct 22 ms 27904 KB Output is correct
14 Correct 22 ms 27904 KB Output is correct
15 Correct 22 ms 27904 KB Output is correct
16 Correct 22 ms 27904 KB Output is correct
17 Correct 22 ms 27904 KB Output is correct
18 Correct 22 ms 27904 KB Output is correct
19 Correct 23 ms 27904 KB Output is correct
20 Correct 22 ms 27904 KB Output is correct
21 Correct 21 ms 27904 KB Output is correct
22 Correct 23 ms 27904 KB Output is correct
23 Correct 22 ms 27904 KB Output is correct
24 Correct 23 ms 27904 KB Output is correct
25 Correct 22 ms 27904 KB Output is correct
26 Correct 22 ms 27904 KB Output is correct
27 Correct 22 ms 27904 KB Output is correct
28 Correct 23 ms 27904 KB Output is correct
29 Correct 22 ms 27904 KB Output is correct
30 Correct 22 ms 27904 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 27776 KB Output is correct
2 Correct 20 ms 27776 KB Output is correct
3 Correct 20 ms 27776 KB Output is correct
4 Correct 21 ms 27776 KB Output is correct
5 Correct 22 ms 27904 KB Output is correct
6 Correct 22 ms 27904 KB Output is correct
7 Correct 22 ms 27904 KB Output is correct
8 Correct 22 ms 27904 KB Output is correct
9 Correct 23 ms 27904 KB Output is correct
10 Correct 24 ms 27904 KB Output is correct
11 Correct 22 ms 27904 KB Output is correct
12 Correct 22 ms 27904 KB Output is correct
13 Correct 22 ms 27904 KB Output is correct
14 Correct 22 ms 27904 KB Output is correct
15 Correct 22 ms 27904 KB Output is correct
16 Correct 22 ms 27904 KB Output is correct
17 Correct 22 ms 27904 KB Output is correct
18 Correct 22 ms 27904 KB Output is correct
19 Correct 23 ms 27904 KB Output is correct
20 Correct 22 ms 27904 KB Output is correct
21 Correct 21 ms 27904 KB Output is correct
22 Correct 23 ms 27904 KB Output is correct
23 Correct 22 ms 27904 KB Output is correct
24 Correct 23 ms 27904 KB Output is correct
25 Correct 22 ms 27904 KB Output is correct
26 Correct 22 ms 27904 KB Output is correct
27 Correct 22 ms 27904 KB Output is correct
28 Correct 23 ms 27904 KB Output is correct
29 Correct 22 ms 27904 KB Output is correct
30 Correct 22 ms 27904 KB Output is correct
31 Correct 347 ms 38768 KB Output is correct
32 Correct 202 ms 35812 KB Output is correct
33 Correct 362 ms 38128 KB Output is correct
34 Correct 341 ms 38884 KB Output is correct
35 Correct 344 ms 38112 KB Output is correct
36 Correct 380 ms 38376 KB Output is correct
37 Correct 330 ms 38048 KB Output is correct
38 Correct 350 ms 37824 KB Output is correct
39 Correct 294 ms 37748 KB Output is correct
40 Correct 307 ms 38004 KB Output is correct
41 Correct 292 ms 37988 KB Output is correct
42 Correct 298 ms 38496 KB Output is correct
43 Correct 160 ms 38120 KB Output is correct
44 Correct 298 ms 38336 KB Output is correct
45 Correct 288 ms 38388 KB Output is correct
46 Correct 270 ms 38112 KB Output is correct
47 Correct 229 ms 37656 KB Output is correct
48 Correct 223 ms 37468 KB Output is correct
49 Correct 243 ms 37856 KB Output is correct
50 Correct 268 ms 38504 KB Output is correct
51 Correct 243 ms 37856 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1114 ms 76752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 974 ms 127760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 27776 KB Output is correct
2 Correct 20 ms 27776 KB Output is correct
3 Correct 20 ms 27776 KB Output is correct
4 Correct 21 ms 27776 KB Output is correct
5 Correct 22 ms 27904 KB Output is correct
6 Correct 22 ms 27904 KB Output is correct
7 Correct 22 ms 27904 KB Output is correct
8 Correct 22 ms 27904 KB Output is correct
9 Correct 23 ms 27904 KB Output is correct
10 Correct 24 ms 27904 KB Output is correct
11 Correct 22 ms 27904 KB Output is correct
12 Correct 22 ms 27904 KB Output is correct
13 Correct 22 ms 27904 KB Output is correct
14 Correct 22 ms 27904 KB Output is correct
15 Correct 22 ms 27904 KB Output is correct
16 Correct 22 ms 27904 KB Output is correct
17 Correct 22 ms 27904 KB Output is correct
18 Correct 22 ms 27904 KB Output is correct
19 Correct 23 ms 27904 KB Output is correct
20 Correct 22 ms 27904 KB Output is correct
21 Correct 21 ms 27904 KB Output is correct
22 Correct 23 ms 27904 KB Output is correct
23 Correct 22 ms 27904 KB Output is correct
24 Correct 23 ms 27904 KB Output is correct
25 Correct 22 ms 27904 KB Output is correct
26 Correct 22 ms 27904 KB Output is correct
27 Correct 22 ms 27904 KB Output is correct
28 Correct 23 ms 27904 KB Output is correct
29 Correct 22 ms 27904 KB Output is correct
30 Correct 22 ms 27904 KB Output is correct
31 Correct 347 ms 38768 KB Output is correct
32 Correct 202 ms 35812 KB Output is correct
33 Correct 362 ms 38128 KB Output is correct
34 Correct 341 ms 38884 KB Output is correct
35 Correct 344 ms 38112 KB Output is correct
36 Correct 380 ms 38376 KB Output is correct
37 Correct 330 ms 38048 KB Output is correct
38 Correct 350 ms 37824 KB Output is correct
39 Correct 294 ms 37748 KB Output is correct
40 Correct 307 ms 38004 KB Output is correct
41 Correct 292 ms 37988 KB Output is correct
42 Correct 298 ms 38496 KB Output is correct
43 Correct 160 ms 38120 KB Output is correct
44 Correct 298 ms 38336 KB Output is correct
45 Correct 288 ms 38388 KB Output is correct
46 Correct 270 ms 38112 KB Output is correct
47 Correct 229 ms 37656 KB Output is correct
48 Correct 223 ms 37468 KB Output is correct
49 Correct 243 ms 37856 KB Output is correct
50 Correct 268 ms 38504 KB Output is correct
51 Correct 243 ms 37856 KB Output is correct
52 Correct 352 ms 42728 KB Output is correct
53 Correct 359 ms 42728 KB Output is correct
54 Correct 341 ms 38624 KB Output is correct
55 Correct 307 ms 39008 KB Output is correct
56 Correct 310 ms 42468 KB Output is correct
57 Correct 302 ms 38380 KB Output is correct
58 Correct 316 ms 39008 KB Output is correct
59 Correct 313 ms 42468 KB Output is correct
60 Correct 312 ms 38628 KB Output is correct
61 Correct 190 ms 42088 KB Output is correct
62 Correct 342 ms 42728 KB Output is correct
63 Correct 349 ms 42468 KB Output is correct
64 Correct 325 ms 38628 KB Output is correct
65 Correct 317 ms 38624 KB Output is correct
66 Correct 302 ms 38496 KB Output is correct
67 Correct 231 ms 36484 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 27776 KB Output is correct
2 Correct 20 ms 27776 KB Output is correct
3 Correct 20 ms 27776 KB Output is correct
4 Correct 21 ms 27776 KB Output is correct
5 Correct 22 ms 27904 KB Output is correct
6 Correct 22 ms 27904 KB Output is correct
7 Correct 22 ms 27904 KB Output is correct
8 Correct 22 ms 27904 KB Output is correct
9 Correct 23 ms 27904 KB Output is correct
10 Correct 24 ms 27904 KB Output is correct
11 Correct 22 ms 27904 KB Output is correct
12 Correct 22 ms 27904 KB Output is correct
13 Correct 22 ms 27904 KB Output is correct
14 Correct 22 ms 27904 KB Output is correct
15 Correct 22 ms 27904 KB Output is correct
16 Correct 22 ms 27904 KB Output is correct
17 Correct 22 ms 27904 KB Output is correct
18 Correct 22 ms 27904 KB Output is correct
19 Correct 23 ms 27904 KB Output is correct
20 Correct 22 ms 27904 KB Output is correct
21 Correct 21 ms 27904 KB Output is correct
22 Correct 23 ms 27904 KB Output is correct
23 Correct 22 ms 27904 KB Output is correct
24 Correct 23 ms 27904 KB Output is correct
25 Correct 22 ms 27904 KB Output is correct
26 Correct 22 ms 27904 KB Output is correct
27 Correct 22 ms 27904 KB Output is correct
28 Correct 23 ms 27904 KB Output is correct
29 Correct 22 ms 27904 KB Output is correct
30 Correct 22 ms 27904 KB Output is correct
31 Correct 347 ms 38768 KB Output is correct
32 Correct 202 ms 35812 KB Output is correct
33 Correct 362 ms 38128 KB Output is correct
34 Correct 341 ms 38884 KB Output is correct
35 Correct 344 ms 38112 KB Output is correct
36 Correct 380 ms 38376 KB Output is correct
37 Correct 330 ms 38048 KB Output is correct
38 Correct 350 ms 37824 KB Output is correct
39 Correct 294 ms 37748 KB Output is correct
40 Correct 307 ms 38004 KB Output is correct
41 Correct 292 ms 37988 KB Output is correct
42 Correct 298 ms 38496 KB Output is correct
43 Correct 160 ms 38120 KB Output is correct
44 Correct 298 ms 38336 KB Output is correct
45 Correct 288 ms 38388 KB Output is correct
46 Correct 270 ms 38112 KB Output is correct
47 Correct 229 ms 37656 KB Output is correct
48 Correct 223 ms 37468 KB Output is correct
49 Correct 243 ms 37856 KB Output is correct
50 Correct 268 ms 38504 KB Output is correct
51 Correct 243 ms 37856 KB Output is correct
52 Incorrect 1114 ms 76752 KB Output isn't correct
53 Halted 0 ms 0 KB -