oj.uz

답안 #164733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164733 2019-11-23T05:03:23 Z arnold518 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 423564 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int MAXN = 3e5;
const int MAXVAL = 1e8;
 
struct Query
{
    int t, x, k, p;
    bool operator < (const Query &p)
    {
        if(t!=p.t) return t<p.t;
        return k>p.k;
    }
};
 
int N, K, Q, ans[MAXN+10], SZ, chk;
vector<Query> query;
multiset<int> S[MAXN+10];
set<int> scomp;
vector<int> comp;
 
int getcomp(int x)
{
    //for(auto it : comp) printf("%d ", it); printf("-> %d\n", x);
    //assert(binary_search(comp.begin(), comp.end(), x));
    return lower_bound(comp.begin(), comp.end(), x)-comp.begin();
}
 
priority_queue<int, vector<int>, less<int>> tree1[5*MAXN+10];
priority_queue<int, vector<int>, less<int>> dead1[5*MAXN+10];
 
priority_queue<int, vector<int>, greater<int>> tree2[5*MAXN+10];
priority_queue<int, vector<int>, greater<int>> dead2[5*MAXN+10];
 
ll query1(int x)
{
    int y=x;
    x=getcomp(x);
    int ret=0;
    for(; x>0; x-=(x&-x))
    {
        while(!tree1[x].empty() && !dead1[x].empty() && tree1[x].top()==dead1[x].top()) tree1[x].pop(), dead1[x].pop();
        if(!tree1[x].empty())
        {
            ////printf("QUERY1 %d %d\n", x, tree1[x].top()-y);
            ret=max(ret, tree1[x].top()-y);
        }
    }
    return ret;
}
 
void erase1(int x, int y)
{
    ////printf("ERASE1 %d %d\n", x, y);
    x=getcomp(x);
    for(; x<=SZ; x+=(x&-x))
    {
        dead1[x].push(y);
    }
}
 
void insert1(int x, int y)
{
    //printf("INSERT1 %d %d\n", x, y);
    x=getcomp(x);
    for(; x<=SZ; x+=(x&-x))
    {
        tree1[x].push(y);
    }
}
 
ll query2(int x)
{
    int y=x;
    x=getcomp(x);
    x=SZ-x+1;
    int ret=0;
    for(; x>0; x-=(x&-x))
    {
        while(!tree2[x].empty() && !dead2[x].empty() && tree2[x].top()==dead2[x].top()) tree2[x].pop(), dead2[x].pop();
        if(!tree2[x].empty())
        {
            ////printf("QUERY1 %d %d\n", x, y-tree2[x].top());
            ret=max(ret, y-tree2[x].top());
        }
    }
    return ret;
}
 
void erase2(int x, int y)
{
    swap(x, y);
    ////printf("ERASE2 %d %d\n", x, y);
    x=getcomp(x);
    x=SZ-x+1;
    for(; x<=SZ; x+=(x&-x))
    {
        dead2[x].push(y);
    }
}
 
void insert2(int x, int y)
{
    //printf("INSERT2 %d %d\n", x, y);
    swap(x, y);
    x=getcomp(x);
    x=SZ-x+1;
    for(; x<=SZ; x+=(x&-x))
    {
        tree2[x].push(y);
    }
}
 
int main()
{
    int i, j;
 
    scanf("%d%d%d", &N, &K, &Q);
    for(i=1; i<=N; i++)
    {
        int x, t, a, b;
        scanf("%d%d%d%d", &x, &t, &a, &b); b++; x*=2;
        query.push_back({a, x, t, 1});
        query.push_back({b, x, t, -1});
        scomp.insert(x);
    }
    int last=0;
    for(i=1; i<=Q; i++)
    {
        int l, x;
        scanf("%d%d", &x, &l); x*=2;
        query.push_back({l, x, -i, 0});
        last=max(last, l);
        scomp.insert(x);
    }
    sort(query.begin(), query.end());
 
    scomp.insert(0); scomp.insert(2e8);
    for(auto now : query)
    {
        int x=now.x;
        if(now.p==1)
        {
            if(S[now.k].find(x)==S[now.k].end())
            {
                if(S[now.k].size()!=0)
                {
                    auto it=S[now.k].lower_bound(x);
                    int r=*it, l=*prev(it);
                    if(it==S[now.k].end()) scomp.insert(l+x>>1);
                    else if(it==S[now.k].begin()) scomp.insert(r+x>>1);
                    else
                    {
                        scomp.insert(l+x>>1);
                        scomp.insert(r+x>>1);
                    }
                }
            }
            S[now.k].insert(x);
        }
        else if(now.p==-1)
        {
            S[now.k].erase(S[now.k].find(x));
            if(S[now.k].find(x)==S[now.k].end())
            {
                if(S[now.k].size()!=0)
                {
                    auto it=S[now.k].lower_bound(x);
                    int r=*it, l=*prev(it);
                    if(it==S[now.k].end());
                    else if(it==S[now.k].begin());
                    else scomp.insert(l+r>>1);
                }
            }
        }
    }
 
    comp.push_back(-1);
    for(auto it : scomp) comp.push_back(it);
    SZ=scomp.size();
 
    for(i=1; i<=K; i++) S[i].clear();
 
    for(auto now : query)
    {
        //printf("===============\n");
        if(last<now.t) break;
        int x=now.x;
        if(now.p==0)
        {
            if(chk!=K) ans[-now.k]=-1;
            else ans[-now.k]=max(query1(x), query2(x))>>1;
            //printf("!%d %d %d\n", -now.k, query1(x), query2(x));
        }
        else if(now.p==1)
        {
            if(S[now.k].find(now.x)==S[now.k].end())
            {
                if(S[now.k].size()==0)
                {
                    insert1(0, x);
                    insert2(x, 2e8);
                    chk++;
                }
                else
                {
                    auto it=S[now.k].lower_bound(x);
                    int r=*it, l=*prev(it);
                    if(it==S[now.k].end())
                    {
                        erase2(l, 2e8);
                        insert2(l, l+x>>1);
                        insert1(l+x>>1, x);
                        insert2(x, 2e8);
                    }
                    else if(it==S[now.k].begin())
                    {
                        erase1(0, r);
                        insert1(0, x);
                        insert2(x, r+x>>1);
                        insert1(r+x>>1, r);
                    }
                    else
                    {
                        erase2(l, l+r>>1);
                        erase1(l+r>>1, r);
                        insert2(l, l+x>>1);
                        insert1(l+x>>1, x);
                        insert2(x, x+r>>1);
                        insert1(x+r>>1, r);
                    }
                }
            }
            S[now.k].insert(now.x);
        }
        else if(now.p==-1)
        {
            S[now.k].erase(S[now.k].find(now.x));
            if(S[now.k].find(now.x)==S[now.k].end())
            {
                if(S[now.k].size()==0)
                {
                    erase1(0, x);
                    erase2(x, 2e8);
                    chk--;
                }
                else
                {
                    auto it=S[now.k].lower_bound(x);
                    int r=*it, l=*prev(it);
                    if(it==S[now.k].end())
                    {
                        insert2(l, 2e8);
                        erase2(l, l+x>>1);
                        erase1(l+x>>1, x);
                        erase2(x, 2e8);
                    }
                    else if(it==S[now.k].begin())
                    {
                        insert1(0, r);
                        erase1(0, x);
                        erase2(x, r+x>>1);
                        erase1(r+x>>1, r);
                    }
                    else
                    {
                        insert2(l, l+r>>1);
                        insert1(l+r>>1, r);
                        erase2(l, l+x>>1);
                        erase1(l+x>>1, x);
                        erase2(x, x+r>>1);
                        erase1(x+r>>1, r);
                    }
                }
            }
        }
    }
    for(i=1; i<=Q; i++) printf("%d\n", ans[i]);
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:158:58: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     if(it==S[now.k].end()) scomp.insert(l+x>>1);
                                                         ~^~
new_home.cpp:159:65: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     else if(it==S[now.k].begin()) scomp.insert(r+x>>1);
                                                                ~^~
new_home.cpp:162:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         scomp.insert(l+x>>1);
                                      ~^~
new_home.cpp:163:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         scomp.insert(r+x>>1);
                                      ~^~
new_home.cpp:180:40: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     else scomp.insert(l+r>>1);
                                       ~^~
new_home.cpp:220:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+x>>1);
                                    ~^~
new_home.cpp:221:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+x>>1, x);
                                 ~^~
new_home.cpp:228:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(x, r+x>>1);
                                    ~^~
new_home.cpp:229:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(r+x>>1, r);
                                 ~^~
new_home.cpp:233:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+r>>1);
                                   ~^~
new_home.cpp:234:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+r>>1, r);
                                ~^~
new_home.cpp:235:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+x>>1);
                                    ~^~
new_home.cpp:236:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+x>>1, x);
                                 ~^~
new_home.cpp:237:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(x, x+r>>1);
                                    ~^~
new_home.cpp:238:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(x+r>>1, r);
                                 ~^~
new_home.cpp:262:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+x>>1);
                                   ~^~
new_home.cpp:263:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+x>>1, x);
                                ~^~
new_home.cpp:270:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(x, r+x>>1);
                                   ~^~
new_home.cpp:271:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(r+x>>1, r);
                                ~^~
new_home.cpp:275:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+r>>1);
                                    ~^~
new_home.cpp:276:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+r>>1, r);
                                 ~^~
new_home.cpp:277:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+x>>1);
                                   ~^~
new_home.cpp:278:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+x>>1, x);
                                ~^~
new_home.cpp:279:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(x, x+r>>1);
                                   ~^~
new_home.cpp:280:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(x+r>>1, r);
                                ~^~
new_home.cpp:124:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
new_home.cpp:126:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &K, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:130:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &x, &t, &a, &b); b++; x*=2;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:139:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &l); x*=2;
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 202360 KB Output is correct
2 Correct 207 ms 202360 KB Output is correct
3 Correct 208 ms 202232 KB Output is correct
4 Correct 208 ms 202232 KB Output is correct
5 Correct 218 ms 202352 KB Output is correct
6 Correct 210 ms 202616 KB Output is correct
7 Correct 207 ms 202524 KB Output is correct
8 Correct 211 ms 202588 KB Output is correct
9 Correct 215 ms 202616 KB Output is correct
10 Correct 212 ms 202744 KB Output is correct
11 Correct 211 ms 202616 KB Output is correct
12 Correct 212 ms 202636 KB Output is correct
13 Correct 209 ms 202488 KB Output is correct
14 Correct 214 ms 202556 KB Output is correct
15 Correct 220 ms 202620 KB Output is correct
16 Correct 215 ms 202672 KB Output is correct
17 Correct 216 ms 202616 KB Output is correct
18 Correct 216 ms 202488 KB Output is correct
19 Correct 216 ms 202616 KB Output is correct
20 Correct 213 ms 202616 KB Output is correct
21 Correct 211 ms 202428 KB Output is correct
22 Correct 212 ms 202500 KB Output is correct
23 Correct 212 ms 202488 KB Output is correct
24 Correct 212 ms 202740 KB Output is correct
25 Correct 216 ms 202616 KB Output is correct
26 Correct 213 ms 202664 KB Output is correct
27 Correct 215 ms 202468 KB Output is correct
28 Correct 212 ms 202588 KB Output is correct
29 Correct 214 ms 202588 KB Output is correct
30 Correct 210 ms 202492 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 202360 KB Output is correct
2 Correct 207 ms 202360 KB Output is correct
3 Correct 208 ms 202232 KB Output is correct
4 Correct 208 ms 202232 KB Output is correct
5 Correct 218 ms 202352 KB Output is correct
6 Correct 210 ms 202616 KB Output is correct
7 Correct 207 ms 202524 KB Output is correct
8 Correct 211 ms 202588 KB Output is correct
9 Correct 215 ms 202616 KB Output is correct
10 Correct 212 ms 202744 KB Output is correct
11 Correct 211 ms 202616 KB Output is correct
12 Correct 212 ms 202636 KB Output is correct
13 Correct 209 ms 202488 KB Output is correct
14 Correct 214 ms 202556 KB Output is correct
15 Correct 220 ms 202620 KB Output is correct
16 Correct 215 ms 202672 KB Output is correct
17 Correct 216 ms 202616 KB Output is correct
18 Correct 216 ms 202488 KB Output is correct
19 Correct 216 ms 202616 KB Output is correct
20 Correct 213 ms 202616 KB Output is correct
21 Correct 211 ms 202428 KB Output is correct
22 Correct 212 ms 202500 KB Output is correct
23 Correct 212 ms 202488 KB Output is correct
24 Correct 212 ms 202740 KB Output is correct
25 Correct 216 ms 202616 KB Output is correct
26 Correct 213 ms 202664 KB Output is correct
27 Correct 215 ms 202468 KB Output is correct
28 Correct 212 ms 202588 KB Output is correct
29 Correct 214 ms 202588 KB Output is correct
30 Correct 210 ms 202492 KB Output is correct
31 Correct 2236 ms 275912 KB Output is correct
32 Correct 324 ms 207812 KB Output is correct
33 Correct 2238 ms 276836 KB Output is correct
34 Correct 2164 ms 274012 KB Output is correct
35 Correct 2282 ms 277212 KB Output is correct
36 Correct 2299 ms 278888 KB Output is correct
37 Correct 1639 ms 275036 KB Output is correct
38 Correct 1636 ms 276060 KB Output is correct
39 Correct 1235 ms 274428 KB Output is correct
40 Correct 1298 ms 275400 KB Output is correct
41 Correct 1336 ms 253788 KB Output is correct
42 Correct 1237 ms 255236 KB Output is correct
43 Correct 287 ms 211036 KB Output is correct
44 Correct 1329 ms 253288 KB Output is correct
45 Correct 1404 ms 250364 KB Output is correct
46 Correct 1468 ms 243060 KB Output is correct
47 Correct 840 ms 252060 KB Output is correct
48 Correct 875 ms 253260 KB Output is correct
49 Correct 956 ms 254052 KB Output is correct
50 Correct 1004 ms 254676 KB Output is correct
51 Correct 1031 ms 252508 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 202360 KB Output is correct
2 Correct 207 ms 202360 KB Output is correct
3 Correct 208 ms 202232 KB Output is correct
4 Correct 208 ms 202232 KB Output is correct
5 Correct 218 ms 202352 KB Output is correct
6 Correct 210 ms 202616 KB Output is correct
7 Correct 207 ms 202524 KB Output is correct
8 Correct 211 ms 202588 KB Output is correct
9 Correct 215 ms 202616 KB Output is correct
10 Correct 212 ms 202744 KB Output is correct
11 Correct 211 ms 202616 KB Output is correct
12 Correct 212 ms 202636 KB Output is correct
13 Correct 209 ms 202488 KB Output is correct
14 Correct 214 ms 202556 KB Output is correct
15 Correct 220 ms 202620 KB Output is correct
16 Correct 215 ms 202672 KB Output is correct
17 Correct 216 ms 202616 KB Output is correct
18 Correct 216 ms 202488 KB Output is correct
19 Correct 216 ms 202616 KB Output is correct
20 Correct 213 ms 202616 KB Output is correct
21 Correct 211 ms 202428 KB Output is correct
22 Correct 212 ms 202500 KB Output is correct
23 Correct 212 ms 202488 KB Output is correct
24 Correct 212 ms 202740 KB Output is correct
25 Correct 216 ms 202616 KB Output is correct
26 Correct 213 ms 202664 KB Output is correct
27 Correct 215 ms 202468 KB Output is correct
28 Correct 212 ms 202588 KB Output is correct
29 Correct 214 ms 202588 KB Output is correct
30 Correct 210 ms 202492 KB Output is correct
31 Correct 2236 ms 275912 KB Output is correct
32 Correct 324 ms 207812 KB Output is correct
33 Correct 2238 ms 276836 KB Output is correct
34 Correct 2164 ms 274012 KB Output is correct
35 Correct 2282 ms 277212 KB Output is correct
36 Correct 2299 ms 278888 KB Output is correct
37 Correct 1639 ms 275036 KB Output is correct
38 Correct 1636 ms 276060 KB Output is correct
39 Correct 1235 ms 274428 KB Output is correct
40 Correct 1298 ms 275400 KB Output is correct
41 Correct 1336 ms 253788 KB Output is correct
42 Correct 1237 ms 255236 KB Output is correct
43 Correct 287 ms 211036 KB Output is correct
44 Correct 1329 ms 253288 KB Output is correct
45 Correct 1404 ms 250364 KB Output is correct
46 Correct 1468 ms 243060 KB Output is correct
47 Correct 840 ms 252060 KB Output is correct
48 Correct 875 ms 253260 KB Output is correct
49 Correct 956 ms 254052 KB Output is correct
50 Correct 1004 ms 254676 KB Output is correct
51 Correct 1031 ms 252508 KB Output is correct
52 Correct 542 ms 234976 KB Output is correct
53 Correct 520 ms 233664 KB Output is correct
54 Correct 1081 ms 254940 KB Output is correct
55 Correct 1097 ms 249948 KB Output is correct
56 Correct 958 ms 247132 KB Output is correct
57 Correct 1256 ms 251544 KB Output is correct
58 Correct 1075 ms 249272 KB Output is correct
59 Correct 938 ms 246884 KB Output is correct
60 Correct 1375 ms 252340 KB Output is correct
61 Correct 280 ms 212160 KB Output is correct
62 Correct 627 ms 235096 KB Output is correct
63 Correct 862 ms 249052 KB Output is correct
64 Correct 1048 ms 252508 KB Output is correct
65 Correct 1235 ms 255996 KB Output is correct
66 Correct 1317 ms 254844 KB Output is correct
67 Correct 423 ms 219228 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 202360 KB Output is correct
2 Correct 207 ms 202360 KB Output is correct
3 Correct 208 ms 202232 KB Output is correct
4 Correct 208 ms 202232 KB Output is correct
5 Correct 218 ms 202352 KB Output is correct
6 Correct 210 ms 202616 KB Output is correct
7 Correct 207 ms 202524 KB Output is correct
8 Correct 211 ms 202588 KB Output is correct
9 Correct 215 ms 202616 KB Output is correct
10 Correct 212 ms 202744 KB Output is correct
11 Correct 211 ms 202616 KB Output is correct
12 Correct 212 ms 202636 KB Output is correct
13 Correct 209 ms 202488 KB Output is correct
14 Correct 214 ms 202556 KB Output is correct
15 Correct 220 ms 202620 KB Output is correct
16 Correct 215 ms 202672 KB Output is correct
17 Correct 216 ms 202616 KB Output is correct
18 Correct 216 ms 202488 KB Output is correct
19 Correct 216 ms 202616 KB Output is correct
20 Correct 213 ms 202616 KB Output is correct
21 Correct 211 ms 202428 KB Output is correct
22 Correct 212 ms 202500 KB Output is correct
23 Correct 212 ms 202488 KB Output is correct
24 Correct 212 ms 202740 KB Output is correct
25 Correct 216 ms 202616 KB Output is correct
26 Correct 213 ms 202664 KB Output is correct
27 Correct 215 ms 202468 KB Output is correct
28 Correct 212 ms 202588 KB Output is correct
29 Correct 214 ms 202588 KB Output is correct
30 Correct 210 ms 202492 KB Output is correct
31 Correct 2236 ms 275912 KB Output is correct
32 Correct 324 ms 207812 KB Output is correct
33 Correct 2238 ms 276836 KB Output is correct
34 Correct 2164 ms 274012 KB Output is correct
35 Correct 2282 ms 277212 KB Output is correct
36 Correct 2299 ms 278888 KB Output is correct
37 Correct 1639 ms 275036 KB Output is correct
38 Correct 1636 ms 276060 KB Output is correct
39 Correct 1235 ms 274428 KB Output is correct
40 Correct 1298 ms 275400 KB Output is correct
41 Correct 1336 ms 253788 KB Output is correct
42 Correct 1237 ms 255236 KB Output is correct
43 Correct 287 ms 211036 KB Output is correct
44 Correct 1329 ms 253288 KB Output is correct
45 Correct 1404 ms 250364 KB Output is correct
46 Correct 1468 ms 243060 KB Output is correct
47 Correct 840 ms 252060 KB Output is correct
48 Correct 875 ms 253260 KB Output is correct
49 Correct 956 ms 254052 KB Output is correct
50 Correct 1004 ms 254676 KB Output is correct
51 Correct 1031 ms 252508 KB Output is correct
52 Execution timed out 5036 ms 423564 KB Time limit exceeded
53 Halted 0 ms 0 KB -