oj.uz

답안 #159492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
159492 2019-10-23T00:51:32 Z arnold518 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 451948 KB 
#include <bits/stdc++.h>
#pragma gcc optimize "03"
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);
    }
    for(i=1; i<=Q; i++)
    {
        int l, x;
        scanf("%d%d", &x, &l); x*=2;
        query.push_back({l, x, -i, 0});
        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=comp.size()-1;

    for(i=1; i<=K; i++) S[i].clear();

    for(auto now : query)
    {
        //printf("===============\n");
        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:2:0: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
 #pragma gcc optimize "03"
 
new_home.cpp: In function 'int main()':
new_home.cpp:154:58: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     if(it==S[now.k].end()) scomp.insert(l+x>>1);
                                                         ~^~
new_home.cpp:155:65: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     else if(it==S[now.k].begin()) scomp.insert(r+x>>1);
                                                                ~^~
new_home.cpp:158:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         scomp.insert(l+x>>1);
                                      ~^~
new_home.cpp:159:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         scomp.insert(r+x>>1);
                                      ~^~
new_home.cpp:176:40: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                     else scomp.insert(l+r>>1);
                                       ~^~
new_home.cpp:215:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+x>>1);
                                    ~^~
new_home.cpp:216:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+x>>1, x);
                                 ~^~
new_home.cpp:223:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(x, r+x>>1);
                                    ~^~
new_home.cpp:224:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(r+x>>1, r);
                                 ~^~
new_home.cpp:228:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+r>>1);
                                   ~^~
new_home.cpp:229:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+r>>1, r);
                                ~^~
new_home.cpp:230:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+x>>1);
                                    ~^~
new_home.cpp:231:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+x>>1, x);
                                 ~^~
new_home.cpp:232:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(x, x+r>>1);
                                    ~^~
new_home.cpp:233:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(x+r>>1, r);
                                 ~^~
new_home.cpp:257:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+x>>1);
                                   ~^~
new_home.cpp:258:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+x>>1, x);
                                ~^~
new_home.cpp:265:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(x, r+x>>1);
                                   ~^~
new_home.cpp:266:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(r+x>>1, r);
                                ~^~
new_home.cpp:270:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert2(l, l+r>>1);
                                    ~^~
new_home.cpp:271:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         insert1(l+r>>1, r);
                                 ~^~
new_home.cpp:272:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(l, l+x>>1);
                                   ~^~
new_home.cpp:273:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(l+x>>1, x);
                                ~^~
new_home.cpp:274:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase2(x, x+r>>1);
                                   ~^~
new_home.cpp:275:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         erase1(x+r>>1, r);
                                ~^~
new_home.cpp:122:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
new_home.cpp:124: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:128: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:136: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 184 ms 202292 KB Output is correct
2 Correct 181 ms 202360 KB Output is correct
3 Correct 180 ms 202232 KB Output is correct
4 Correct 202 ms 202360 KB Output is correct
5 Correct 186 ms 202312 KB Output is correct
6 Correct 186 ms 202588 KB Output is correct
7 Correct 188 ms 202632 KB Output is correct
8 Correct 185 ms 202516 KB Output is correct
9 Correct 182 ms 202492 KB Output is correct
10 Correct 188 ms 202684 KB Output is correct
11 Correct 183 ms 202488 KB Output is correct
12 Correct 187 ms 202588 KB Output is correct
13 Correct 191 ms 202520 KB Output is correct
14 Correct 188 ms 202592 KB Output is correct
15 Correct 190 ms 202616 KB Output is correct
16 Correct 200 ms 202820 KB Output is correct
17 Correct 187 ms 202544 KB Output is correct
18 Correct 185 ms 202564 KB Output is correct
19 Correct 194 ms 202724 KB Output is correct
20 Correct 185 ms 202600 KB Output is correct
21 Correct 182 ms 202320 KB Output is correct
22 Correct 184 ms 202388 KB Output is correct
23 Correct 184 ms 202500 KB Output is correct
24 Correct 204 ms 202544 KB Output is correct
25 Correct 186 ms 202588 KB Output is correct
26 Correct 185 ms 202616 KB Output is correct
27 Correct 184 ms 202464 KB Output is correct
28 Correct 186 ms 202564 KB Output is correct
29 Correct 184 ms 202500 KB Output is correct
30 Correct 185 ms 202488 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 202292 KB Output is correct
2 Correct 181 ms 202360 KB Output is correct
3 Correct 180 ms 202232 KB Output is correct
4 Correct 202 ms 202360 KB Output is correct
5 Correct 186 ms 202312 KB Output is correct
6 Correct 186 ms 202588 KB Output is correct
7 Correct 188 ms 202632 KB Output is correct
8 Correct 185 ms 202516 KB Output is correct
9 Correct 182 ms 202492 KB Output is correct
10 Correct 188 ms 202684 KB Output is correct
11 Correct 183 ms 202488 KB Output is correct
12 Correct 187 ms 202588 KB Output is correct
13 Correct 191 ms 202520 KB Output is correct
14 Correct 188 ms 202592 KB Output is correct
15 Correct 190 ms 202616 KB Output is correct
16 Correct 200 ms 202820 KB Output is correct
17 Correct 187 ms 202544 KB Output is correct
18 Correct 185 ms 202564 KB Output is correct
19 Correct 194 ms 202724 KB Output is correct
20 Correct 185 ms 202600 KB Output is correct
21 Correct 182 ms 202320 KB Output is correct
22 Correct 184 ms 202388 KB Output is correct
23 Correct 184 ms 202500 KB Output is correct
24 Correct 204 ms 202544 KB Output is correct
25 Correct 186 ms 202588 KB Output is correct
26 Correct 185 ms 202616 KB Output is correct
27 Correct 184 ms 202464 KB Output is correct
28 Correct 186 ms 202564 KB Output is correct
29 Correct 184 ms 202500 KB Output is correct
30 Correct 185 ms 202488 KB Output is correct
31 Correct 1881 ms 272876 KB Output is correct
32 Correct 294 ms 206636 KB Output is correct
33 Correct 1852 ms 273972 KB Output is correct
34 Correct 1755 ms 270880 KB Output is correct
35 Correct 1918 ms 274164 KB Output is correct
36 Correct 1908 ms 275992 KB Output is correct
37 Correct 1511 ms 271932 KB Output is correct
38 Correct 1460 ms 273216 KB Output is correct
39 Correct 1216 ms 271592 KB Output is correct
40 Correct 1259 ms 272492 KB Output is correct
41 Correct 1224 ms 250716 KB Output is correct
42 Correct 1130 ms 252212 KB Output is correct
43 Correct 259 ms 208736 KB Output is correct
44 Correct 1196 ms 250472 KB Output is correct
45 Correct 1302 ms 247484 KB Output is correct
46 Correct 1383 ms 239976 KB Output is correct
47 Correct 804 ms 249180 KB Output is correct
48 Correct 874 ms 250560 KB Output is correct
49 Correct 1053 ms 251148 KB Output is correct
50 Correct 996 ms 251756 KB Output is correct
51 Correct 971 ms 249564 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 202292 KB Output is correct
2 Correct 181 ms 202360 KB Output is correct
3 Correct 180 ms 202232 KB Output is correct
4 Correct 202 ms 202360 KB Output is correct
5 Correct 186 ms 202312 KB Output is correct
6 Correct 186 ms 202588 KB Output is correct
7 Correct 188 ms 202632 KB Output is correct
8 Correct 185 ms 202516 KB Output is correct
9 Correct 182 ms 202492 KB Output is correct
10 Correct 188 ms 202684 KB Output is correct
11 Correct 183 ms 202488 KB Output is correct
12 Correct 187 ms 202588 KB Output is correct
13 Correct 191 ms 202520 KB Output is correct
14 Correct 188 ms 202592 KB Output is correct
15 Correct 190 ms 202616 KB Output is correct
16 Correct 200 ms 202820 KB Output is correct
17 Correct 187 ms 202544 KB Output is correct
18 Correct 185 ms 202564 KB Output is correct
19 Correct 194 ms 202724 KB Output is correct
20 Correct 185 ms 202600 KB Output is correct
21 Correct 182 ms 202320 KB Output is correct
22 Correct 184 ms 202388 KB Output is correct
23 Correct 184 ms 202500 KB Output is correct
24 Correct 204 ms 202544 KB Output is correct
25 Correct 186 ms 202588 KB Output is correct
26 Correct 185 ms 202616 KB Output is correct
27 Correct 184 ms 202464 KB Output is correct
28 Correct 186 ms 202564 KB Output is correct
29 Correct 184 ms 202500 KB Output is correct
30 Correct 185 ms 202488 KB Output is correct
31 Correct 1881 ms 272876 KB Output is correct
32 Correct 294 ms 206636 KB Output is correct
33 Correct 1852 ms 273972 KB Output is correct
34 Correct 1755 ms 270880 KB Output is correct
35 Correct 1918 ms 274164 KB Output is correct
36 Correct 1908 ms 275992 KB Output is correct
37 Correct 1511 ms 271932 KB Output is correct
38 Correct 1460 ms 273216 KB Output is correct
39 Correct 1216 ms 271592 KB Output is correct
40 Correct 1259 ms 272492 KB Output is correct
41 Correct 1224 ms 250716 KB Output is correct
42 Correct 1130 ms 252212 KB Output is correct
43 Correct 259 ms 208736 KB Output is correct
44 Correct 1196 ms 250472 KB Output is correct
45 Correct 1302 ms 247484 KB Output is correct
46 Correct 1383 ms 239976 KB Output is correct
47 Correct 804 ms 249180 KB Output is correct
48 Correct 874 ms 250560 KB Output is correct
49 Correct 1053 ms 251148 KB Output is correct
50 Correct 996 ms 251756 KB Output is correct
51 Correct 971 ms 249564 KB Output is correct
52 Correct 481 ms 231896 KB Output is correct
53 Correct 471 ms 230504 KB Output is correct
54 Correct 910 ms 251776 KB Output is correct
55 Correct 957 ms 246848 KB Output is correct
56 Correct 848 ms 244092 KB Output is correct
57 Correct 1150 ms 248608 KB Output is correct
58 Correct 948 ms 246208 KB Output is correct
59 Correct 819 ms 243700 KB Output is correct
60 Correct 1035 ms 249308 KB Output is correct
61 Correct 258 ms 209772 KB Output is correct
62 Correct 471 ms 231900 KB Output is correct
63 Correct 755 ms 245780 KB Output is correct
64 Correct 884 ms 249308 KB Output is correct
65 Correct 1049 ms 252784 KB Output is correct
66 Correct 1146 ms 251840 KB Output is correct
67 Correct 408 ms 217960 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 202292 KB Output is correct
2 Correct 181 ms 202360 KB Output is correct
3 Correct 180 ms 202232 KB Output is correct
4 Correct 202 ms 202360 KB Output is correct
5 Correct 186 ms 202312 KB Output is correct
6 Correct 186 ms 202588 KB Output is correct
7 Correct 188 ms 202632 KB Output is correct
8 Correct 185 ms 202516 KB Output is correct
9 Correct 182 ms 202492 KB Output is correct
10 Correct 188 ms 202684 KB Output is correct
11 Correct 183 ms 202488 KB Output is correct
12 Correct 187 ms 202588 KB Output is correct
13 Correct 191 ms 202520 KB Output is correct
14 Correct 188 ms 202592 KB Output is correct
15 Correct 190 ms 202616 KB Output is correct
16 Correct 200 ms 202820 KB Output is correct
17 Correct 187 ms 202544 KB Output is correct
18 Correct 185 ms 202564 KB Output is correct
19 Correct 194 ms 202724 KB Output is correct
20 Correct 185 ms 202600 KB Output is correct
21 Correct 182 ms 202320 KB Output is correct
22 Correct 184 ms 202388 KB Output is correct
23 Correct 184 ms 202500 KB Output is correct
24 Correct 204 ms 202544 KB Output is correct
25 Correct 186 ms 202588 KB Output is correct
26 Correct 185 ms 202616 KB Output is correct
27 Correct 184 ms 202464 KB Output is correct
28 Correct 186 ms 202564 KB Output is correct
29 Correct 184 ms 202500 KB Output is correct
30 Correct 185 ms 202488 KB Output is correct
31 Correct 1881 ms 272876 KB Output is correct
32 Correct 294 ms 206636 KB Output is correct
33 Correct 1852 ms 273972 KB Output is correct
34 Correct 1755 ms 270880 KB Output is correct
35 Correct 1918 ms 274164 KB Output is correct
36 Correct 1908 ms 275992 KB Output is correct
37 Correct 1511 ms 271932 KB Output is correct
38 Correct 1460 ms 273216 KB Output is correct
39 Correct 1216 ms 271592 KB Output is correct
40 Correct 1259 ms 272492 KB Output is correct
41 Correct 1224 ms 250716 KB Output is correct
42 Correct 1130 ms 252212 KB Output is correct
43 Correct 259 ms 208736 KB Output is correct
44 Correct 1196 ms 250472 KB Output is correct
45 Correct 1302 ms 247484 KB Output is correct
46 Correct 1383 ms 239976 KB Output is correct
47 Correct 804 ms 249180 KB Output is correct
48 Correct 874 ms 250560 KB Output is correct
49 Correct 1053 ms 251148 KB Output is correct
50 Correct 996 ms 251756 KB Output is correct
51 Correct 971 ms 249564 KB Output is correct
52 Execution timed out 5126 ms 451948 KB Time limit exceeded
53 Halted 0 ms 0 KB -