oj.uz

답안 #233118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233118 2020-05-19T11:47:39 Z nvmdava 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 115288 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(){
    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++;
        if(r -> ss <= hel && r -> ff > 0)
            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();

    memset(seg, 0, sizeof seg);
    lol.clear();
    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:52: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 35 ms 55168 KB Output is correct
2 Correct 37 ms 55160 KB Output is correct
3 Correct 36 ms 55160 KB Output is correct
4 Correct 36 ms 55168 KB Output is correct
5 Correct 37 ms 55064 KB Output is correct
6 Correct 38 ms 55296 KB Output is correct
7 Correct 38 ms 55296 KB Output is correct
8 Correct 38 ms 55160 KB Output is correct
9 Correct 39 ms 55296 KB Output is correct
10 Correct 38 ms 55288 KB Output is correct
11 Correct 38 ms 55316 KB Output is correct
12 Correct 39 ms 55288 KB Output is correct
13 Correct 37 ms 55296 KB Output is correct
14 Correct 37 ms 55272 KB Output is correct
15 Correct 39 ms 55264 KB Output is correct
16 Correct 37 ms 55296 KB Output is correct
17 Correct 37 ms 55424 KB Output is correct
18 Correct 38 ms 55288 KB Output is correct
19 Correct 37 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 37 ms 55288 KB Output is correct
22 Correct 37 ms 55288 KB Output is correct
23 Correct 37 ms 55296 KB Output is correct
24 Correct 37 ms 55296 KB Output is correct
25 Correct 37 ms 55296 KB Output is correct
26 Correct 37 ms 55288 KB Output is correct
27 Correct 37 ms 55288 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 37 ms 55288 KB Output is correct
30 Correct 37 ms 55288 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 55168 KB Output is correct
2 Correct 37 ms 55160 KB Output is correct
3 Correct 36 ms 55160 KB Output is correct
4 Correct 36 ms 55168 KB Output is correct
5 Correct 37 ms 55064 KB Output is correct
6 Correct 38 ms 55296 KB Output is correct
7 Correct 38 ms 55296 KB Output is correct
8 Correct 38 ms 55160 KB Output is correct
9 Correct 39 ms 55296 KB Output is correct
10 Correct 38 ms 55288 KB Output is correct
11 Correct 38 ms 55316 KB Output is correct
12 Correct 39 ms 55288 KB Output is correct
13 Correct 37 ms 55296 KB Output is correct
14 Correct 37 ms 55272 KB Output is correct
15 Correct 39 ms 55264 KB Output is correct
16 Correct 37 ms 55296 KB Output is correct
17 Correct 37 ms 55424 KB Output is correct
18 Correct 38 ms 55288 KB Output is correct
19 Correct 37 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 37 ms 55288 KB Output is correct
22 Correct 37 ms 55288 KB Output is correct
23 Correct 37 ms 55296 KB Output is correct
24 Correct 37 ms 55296 KB Output is correct
25 Correct 37 ms 55296 KB Output is correct
26 Correct 37 ms 55288 KB Output is correct
27 Correct 37 ms 55288 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 37 ms 55288 KB Output is correct
30 Correct 37 ms 55288 KB Output is correct
31 Correct 375 ms 63208 KB Output is correct
32 Correct 544 ms 59360 KB Output is correct
33 Correct 390 ms 62560 KB Output is correct
34 Correct 354 ms 63200 KB Output is correct
35 Correct 368 ms 62604 KB Output is correct
36 Correct 406 ms 62944 KB Output is correct
37 Correct 345 ms 62560 KB Output is correct
38 Correct 370 ms 62424 KB Output is correct
39 Correct 301 ms 62324 KB Output is correct
40 Correct 327 ms 62348 KB Output is correct
41 Correct 299 ms 62440 KB Output is correct
42 Correct 296 ms 62688 KB Output is correct
43 Correct 210 ms 60276 KB Output is correct
44 Correct 296 ms 62944 KB Output is correct
45 Correct 286 ms 62836 KB Output is correct
46 Correct 271 ms 62496 KB Output is correct
47 Correct 229 ms 62048 KB Output is correct
48 Correct 219 ms 61780 KB Output is correct
49 Correct 247 ms 62304 KB Output is correct
50 Correct 271 ms 62944 KB Output is correct
51 Correct 248 ms 62308 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 920 ms 85816 KB Output is correct
2 Correct 1462 ms 83496 KB Output is correct
3 Correct 1064 ms 91080 KB Output is correct
4 Correct 929 ms 86240 KB Output is correct
5 Correct 2082 ms 115288 KB Output is correct
6 Correct 1617 ms 86384 KB Output is correct
7 Correct 937 ms 91072 KB Output is correct
8 Correct 877 ms 85312 KB Output is correct
9 Correct 908 ms 84204 KB Output is correct
10 Correct 1114 ms 82500 KB Output is correct
11 Correct 1078 ms 83936 KB Output is correct
12 Correct 1010 ms 82816 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1426 ms 88252 KB Output is correct
2 Execution timed out 5072 ms 61932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 55168 KB Output is correct
2 Correct 37 ms 55160 KB Output is correct
3 Correct 36 ms 55160 KB Output is correct
4 Correct 36 ms 55168 KB Output is correct
5 Correct 37 ms 55064 KB Output is correct
6 Correct 38 ms 55296 KB Output is correct
7 Correct 38 ms 55296 KB Output is correct
8 Correct 38 ms 55160 KB Output is correct
9 Correct 39 ms 55296 KB Output is correct
10 Correct 38 ms 55288 KB Output is correct
11 Correct 38 ms 55316 KB Output is correct
12 Correct 39 ms 55288 KB Output is correct
13 Correct 37 ms 55296 KB Output is correct
14 Correct 37 ms 55272 KB Output is correct
15 Correct 39 ms 55264 KB Output is correct
16 Correct 37 ms 55296 KB Output is correct
17 Correct 37 ms 55424 KB Output is correct
18 Correct 38 ms 55288 KB Output is correct
19 Correct 37 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 37 ms 55288 KB Output is correct
22 Correct 37 ms 55288 KB Output is correct
23 Correct 37 ms 55296 KB Output is correct
24 Correct 37 ms 55296 KB Output is correct
25 Correct 37 ms 55296 KB Output is correct
26 Correct 37 ms 55288 KB Output is correct
27 Correct 37 ms 55288 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 37 ms 55288 KB Output is correct
30 Correct 37 ms 55288 KB Output is correct
31 Correct 375 ms 63208 KB Output is correct
32 Correct 544 ms 59360 KB Output is correct
33 Correct 390 ms 62560 KB Output is correct
34 Correct 354 ms 63200 KB Output is correct
35 Correct 368 ms 62604 KB Output is correct
36 Correct 406 ms 62944 KB Output is correct
37 Correct 345 ms 62560 KB Output is correct
38 Correct 370 ms 62424 KB Output is correct
39 Correct 301 ms 62324 KB Output is correct
40 Correct 327 ms 62348 KB Output is correct
41 Correct 299 ms 62440 KB Output is correct
42 Correct 296 ms 62688 KB Output is correct
43 Correct 210 ms 60276 KB Output is correct
44 Correct 296 ms 62944 KB Output is correct
45 Correct 286 ms 62836 KB Output is correct
46 Correct 271 ms 62496 KB Output is correct
47 Correct 229 ms 62048 KB Output is correct
48 Correct 219 ms 61780 KB Output is correct
49 Correct 247 ms 62304 KB Output is correct
50 Correct 271 ms 62944 KB Output is correct
51 Correct 248 ms 62308 KB Output is correct
52 Correct 334 ms 63924 KB Output is correct
53 Correct 339 ms 63960 KB Output is correct
54 Correct 326 ms 63072 KB Output is correct
55 Correct 292 ms 63204 KB Output is correct
56 Correct 318 ms 63580 KB Output is correct
57 Correct 294 ms 62696 KB Output is correct
58 Correct 300 ms 63200 KB Output is correct
59 Correct 313 ms 63448 KB Output is correct
60 Correct 302 ms 63068 KB Output is correct
61 Correct 142 ms 62436 KB Output is correct
62 Correct 327 ms 64088 KB Output is correct
63 Correct 333 ms 63316 KB Output is correct
64 Correct 323 ms 62948 KB Output is correct
65 Correct 321 ms 62944 KB Output is correct
66 Correct 301 ms 62940 KB Output is correct
67 Correct 180 ms 62308 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 55168 KB Output is correct
2 Correct 37 ms 55160 KB Output is correct
3 Correct 36 ms 55160 KB Output is correct
4 Correct 36 ms 55168 KB Output is correct
5 Correct 37 ms 55064 KB Output is correct
6 Correct 38 ms 55296 KB Output is correct
7 Correct 38 ms 55296 KB Output is correct
8 Correct 38 ms 55160 KB Output is correct
9 Correct 39 ms 55296 KB Output is correct
10 Correct 38 ms 55288 KB Output is correct
11 Correct 38 ms 55316 KB Output is correct
12 Correct 39 ms 55288 KB Output is correct
13 Correct 37 ms 55296 KB Output is correct
14 Correct 37 ms 55272 KB Output is correct
15 Correct 39 ms 55264 KB Output is correct
16 Correct 37 ms 55296 KB Output is correct
17 Correct 37 ms 55424 KB Output is correct
18 Correct 38 ms 55288 KB Output is correct
19 Correct 37 ms 55288 KB Output is correct
20 Correct 38 ms 55296 KB Output is correct
21 Correct 37 ms 55288 KB Output is correct
22 Correct 37 ms 55288 KB Output is correct
23 Correct 37 ms 55296 KB Output is correct
24 Correct 37 ms 55296 KB Output is correct
25 Correct 37 ms 55296 KB Output is correct
26 Correct 37 ms 55288 KB Output is correct
27 Correct 37 ms 55288 KB Output is correct
28 Correct 38 ms 55296 KB Output is correct
29 Correct 37 ms 55288 KB Output is correct
30 Correct 37 ms 55288 KB Output is correct
31 Correct 375 ms 63208 KB Output is correct
32 Correct 544 ms 59360 KB Output is correct
33 Correct 390 ms 62560 KB Output is correct
34 Correct 354 ms 63200 KB Output is correct
35 Correct 368 ms 62604 KB Output is correct
36 Correct 406 ms 62944 KB Output is correct
37 Correct 345 ms 62560 KB Output is correct
38 Correct 370 ms 62424 KB Output is correct
39 Correct 301 ms 62324 KB Output is correct
40 Correct 327 ms 62348 KB Output is correct
41 Correct 299 ms 62440 KB Output is correct
42 Correct 296 ms 62688 KB Output is correct
43 Correct 210 ms 60276 KB Output is correct
44 Correct 296 ms 62944 KB Output is correct
45 Correct 286 ms 62836 KB Output is correct
46 Correct 271 ms 62496 KB Output is correct
47 Correct 229 ms 62048 KB Output is correct
48 Correct 219 ms 61780 KB Output is correct
49 Correct 247 ms 62304 KB Output is correct
50 Correct 271 ms 62944 KB Output is correct
51 Correct 248 ms 62308 KB Output is correct
52 Correct 920 ms 85816 KB Output is correct
53 Correct 1462 ms 83496 KB Output is correct
54 Correct 1064 ms 91080 KB Output is correct
55 Correct 929 ms 86240 KB Output is correct
56 Correct 2082 ms 115288 KB Output is correct
57 Correct 1617 ms 86384 KB Output is correct
58 Correct 937 ms 91072 KB Output is correct
59 Correct 877 ms 85312 KB Output is correct
60 Correct 908 ms 84204 KB Output is correct
61 Correct 1114 ms 82500 KB Output is correct
62 Correct 1078 ms 83936 KB Output is correct
63 Correct 1010 ms 82816 KB Output is correct
64 Correct 1426 ms 88252 KB Output is correct
65 Execution timed out 5072 ms 61932 KB Time limit exceeded
66 Halted 0 ms 0 KB -