oj.uz

답안 #1088666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088666 2024-09-14T18:33:44 Z alexander707070 새 집 (APIO18_new_home) C++14
12 / 100
 5000 ms 66752 KB 
#include<bits/stdc++.h>
#define MAXN 600007
using namespace std;

const int bucket_sz=1000000,inf=1e9+7;

int n,k,q,x,t,l,r,pt,ans[MAXN];

struct event{
    int x,type,tim,id;

    inline friend bool operator < (event fr,event sc){
        if(fr.tim!=sc.tim)return fr.tim<sc.tim;
        else return fr.type<sc.type;
    }
}s[MAXN];

bool cmp(event fr,event sc){
    return fr.x<sc.x;
}

multiset<int> stores[MAXN];
set< pair<int,int> > ss;
vector< pair<int,int> > st,ts;

vector<event> z,ask;

int sp[MAXN],tim,last[MAXN];
vector<int> poss;
priority_queue<int> pq;

int mins(){
    pair<int,int> p=*ss.begin();
    return p.first;
}

int maxs(){
    pair<int,int> p=*ss.rbegin();
    return p.first;
}

int calc(int x,int t){
    if(stores[t].empty())return inf;

    auto it=stores[t].lower_bound(x);

    int p1=-inf,p2=-inf;

    if(it!=stores[t].end())p1=*it;
    if(it!=stores[t].begin()){
        it--; p2=*it;
    }

    return min(abs(x-p1),abs(x-p2));
}

void solve(){

    tim++; ask.clear();
    for(event e:z){
        if(e.type==0 or e.type==2){
            sp[e.id]=tim;
        }else{
            ask.push_back(e);
        }
    }

    poss.clear(); st.clear(); ts.clear();
    for(int i=1;i<=k;i++){
        if(sp[i]==tim)poss.push_back(i);
        else{
            vector<int> w;
            for(int f:stores[i]){
                w.push_back(f);
            }

            if(w.empty()){
                st.push_back({0,inf});
                ts.push_back({inf,2*inf});
                break;
            }

            st.push_back({0,w[0]});
            for(int f=0;f<w.size()-1;f++){
                int pos=(w[f]+w[f+1])/2+(w[f]+w[f+1])%2;
                int val=(w[f+1]-w[f])/2;

                st.push_back({pos,pos+val});
                ts.push_back({pos-(w[f]+w[f+1])%2,val-(pos-(w[f]+w[f+1])%2)});
            }
            ts.push_back({inf,-w.back()});
        }
    }

    if(!st.empty()){
        sort(st.begin(),st.end());
        sort(ts.begin(),ts.end());
        sort(ask.begin(),ask.end(),cmp);

        int pt=0;
        while(!pq.empty())pq.pop();

        for(int i=0;i<ask.size();i++){
            while(pt<st.size() and st[pt].first<=ask[i].x){
                pq.push(st[pt].second);
                pt++;
            }

            ans[ask[i].id]=max(ans[ask[i].id],pq.top()-ask[i].x);
        }

        pt=ts.size()-1;
        while(!pq.empty())pq.pop();

        for(int i=ask.size()-1;i>=0;i--){
            while(pt>=0 and ts[pt].first>=ask[i].x){
                pq.push(ts[pt].second);
                pt--;
            }

            ans[ask[i].id]=max(ans[ask[i].id],pq.top()+ask[i].x);
        }
    }

    for(event e:z){
        if(e.type==0){
            stores[e.id].insert(e.x);
        }else if(e.type==2){
            stores[e.id].erase(stores[e.id].find(e.x));
        }else{
            for(int i:poss){
                ans[e.id]=max(ans[e.id],calc(e.x,i));
            }
        }
    }
}

int main(){

    cin>>n>>k>>q;
    for(int i=1;i<=n;i++){
        cin>>x>>t>>l>>r;

        pt++; s[pt]={x,0,l,t};
        pt++; s[pt]={x,2,r,t};
    }

    for(int i=1;i<=q;i++){
        cin>>x>>t;

        pt++; s[pt]={x,1,t,i};
    }

    sort(s+1,s+pt+1);

    for(int i=1;i<=pt;i++){
        z.push_back(s[i]);

        if(z.size()==bucket_sz){
            solve(); z.clear();
        }
    }

    if(!z.empty()){
        solve(); z.clear();
    }

    for(int i=1;i<=q;i++){
        if(ans[i]>=inf)cout<<"-1\n";
        else cout<<ans[i]<<"\n";
    }

    return 0;
}

/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10

*/

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:84:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for(int f=0;f<w.size()-1;f++){
      |                         ~^~~~~~~~~~~
new_home.cpp:103:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |         for(int i=0;i<ask.size();i++){
      |                     ~^~~~~~~~~~~
new_home.cpp:104:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             while(pt<st.size() and st[pt].first<=ask[i].x){
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28508 KB Output is correct
2 Correct 11 ms 28624 KB Output is correct
3 Correct 11 ms 28508 KB Output is correct
4 Correct 11 ms 28624 KB Output is correct
5 Correct 11 ms 28644 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 12 ms 28644 KB Output is correct
8 Correct 15 ms 28508 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 13 ms 28508 KB Output is correct
12 Correct 13 ms 28508 KB Output is correct
13 Correct 13 ms 28664 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 16 ms 28508 KB Output is correct
16 Correct 12 ms 28644 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 13 ms 28508 KB Output is correct
19 Correct 14 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 15 ms 28508 KB Output is correct
22 Correct 15 ms 28648 KB Output is correct
23 Correct 14 ms 28508 KB Output is correct
24 Correct 14 ms 28504 KB Output is correct
25 Correct 14 ms 28504 KB Output is correct
26 Correct 15 ms 28732 KB Output is correct
27 Correct 18 ms 28504 KB Output is correct
28 Correct 12 ms 28504 KB Output is correct
29 Correct 13 ms 28508 KB Output is correct
30 Correct 12 ms 28548 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28508 KB Output is correct
2 Correct 11 ms 28624 KB Output is correct
3 Correct 11 ms 28508 KB Output is correct
4 Correct 11 ms 28624 KB Output is correct
5 Correct 11 ms 28644 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 12 ms 28644 KB Output is correct
8 Correct 15 ms 28508 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 13 ms 28508 KB Output is correct
12 Correct 13 ms 28508 KB Output is correct
13 Correct 13 ms 28664 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 16 ms 28508 KB Output is correct
16 Correct 12 ms 28644 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 13 ms 28508 KB Output is correct
19 Correct 14 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 15 ms 28508 KB Output is correct
22 Correct 15 ms 28648 KB Output is correct
23 Correct 14 ms 28508 KB Output is correct
24 Correct 14 ms 28504 KB Output is correct
25 Correct 14 ms 28504 KB Output is correct
26 Correct 15 ms 28732 KB Output is correct
27 Correct 18 ms 28504 KB Output is correct
28 Correct 12 ms 28504 KB Output is correct
29 Correct 13 ms 28508 KB Output is correct
30 Correct 12 ms 28548 KB Output is correct
31 Correct 1815 ms 41468 KB Output is correct
32 Correct 95 ms 37576 KB Output is correct
33 Correct 197 ms 39604 KB Output is correct
34 Correct 1471 ms 39712 KB Output is correct
35 Correct 820 ms 41608 KB Output is correct
36 Correct 212 ms 41396 KB Output is correct
37 Correct 169 ms 39604 KB Output is correct
38 Correct 127 ms 39608 KB Output is correct
39 Correct 123 ms 39480 KB Output is correct
40 Correct 134 ms 39596 KB Output is correct
41 Correct 269 ms 39784 KB Output is correct
42 Correct 336 ms 39604 KB Output is correct
43 Correct 300 ms 41144 KB Output is correct
44 Correct 248 ms 39804 KB Output is correct
45 Correct 187 ms 39864 KB Output is correct
46 Correct 121 ms 39868 KB Output is correct
47 Correct 109 ms 39356 KB Output is correct
48 Correct 106 ms 39104 KB Output is correct
49 Correct 119 ms 39484 KB Output is correct
50 Correct 239 ms 39604 KB Output is correct
51 Correct 111 ms 39392 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28508 KB Output is correct
2 Correct 11 ms 28624 KB Output is correct
3 Correct 11 ms 28508 KB Output is correct
4 Correct 11 ms 28624 KB Output is correct
5 Correct 11 ms 28644 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 12 ms 28644 KB Output is correct
8 Correct 15 ms 28508 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 13 ms 28508 KB Output is correct
12 Correct 13 ms 28508 KB Output is correct
13 Correct 13 ms 28664 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 16 ms 28508 KB Output is correct
16 Correct 12 ms 28644 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 13 ms 28508 KB Output is correct
19 Correct 14 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 15 ms 28508 KB Output is correct
22 Correct 15 ms 28648 KB Output is correct
23 Correct 14 ms 28508 KB Output is correct
24 Correct 14 ms 28504 KB Output is correct
25 Correct 14 ms 28504 KB Output is correct
26 Correct 15 ms 28732 KB Output is correct
27 Correct 18 ms 28504 KB Output is correct
28 Correct 12 ms 28504 KB Output is correct
29 Correct 13 ms 28508 KB Output is correct
30 Correct 12 ms 28548 KB Output is correct
31 Correct 1815 ms 41468 KB Output is correct
32 Correct 95 ms 37576 KB Output is correct
33 Correct 197 ms 39604 KB Output is correct
34 Correct 1471 ms 39712 KB Output is correct
35 Correct 820 ms 41608 KB Output is correct
36 Correct 212 ms 41396 KB Output is correct
37 Correct 169 ms 39604 KB Output is correct
38 Correct 127 ms 39608 KB Output is correct
39 Correct 123 ms 39480 KB Output is correct
40 Correct 134 ms 39596 KB Output is correct
41 Correct 269 ms 39784 KB Output is correct
42 Correct 336 ms 39604 KB Output is correct
43 Correct 300 ms 41144 KB Output is correct
44 Correct 248 ms 39804 KB Output is correct
45 Correct 187 ms 39864 KB Output is correct
46 Correct 121 ms 39868 KB Output is correct
47 Correct 109 ms 39356 KB Output is correct
48 Correct 106 ms 39104 KB Output is correct
49 Correct 119 ms 39484 KB Output is correct
50 Correct 239 ms 39604 KB Output is correct
51 Correct 111 ms 39392 KB Output is correct
52 Execution timed out 5062 ms 40032 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28508 KB Output is correct
2 Correct 11 ms 28624 KB Output is correct
3 Correct 11 ms 28508 KB Output is correct
4 Correct 11 ms 28624 KB Output is correct
5 Correct 11 ms 28644 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 12 ms 28644 KB Output is correct
8 Correct 15 ms 28508 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 13 ms 28508 KB Output is correct
12 Correct 13 ms 28508 KB Output is correct
13 Correct 13 ms 28664 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 16 ms 28508 KB Output is correct
16 Correct 12 ms 28644 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 13 ms 28508 KB Output is correct
19 Correct 14 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 15 ms 28508 KB Output is correct
22 Correct 15 ms 28648 KB Output is correct
23 Correct 14 ms 28508 KB Output is correct
24 Correct 14 ms 28504 KB Output is correct
25 Correct 14 ms 28504 KB Output is correct
26 Correct 15 ms 28732 KB Output is correct
27 Correct 18 ms 28504 KB Output is correct
28 Correct 12 ms 28504 KB Output is correct
29 Correct 13 ms 28508 KB Output is correct
30 Correct 12 ms 28548 KB Output is correct
31 Correct 1815 ms 41468 KB Output is correct
32 Correct 95 ms 37576 KB Output is correct
33 Correct 197 ms 39604 KB Output is correct
34 Correct 1471 ms 39712 KB Output is correct
35 Correct 820 ms 41608 KB Output is correct
36 Correct 212 ms 41396 KB Output is correct
37 Correct 169 ms 39604 KB Output is correct
38 Correct 127 ms 39608 KB Output is correct
39 Correct 123 ms 39480 KB Output is correct
40 Correct 134 ms 39596 KB Output is correct
41 Correct 269 ms 39784 KB Output is correct
42 Correct 336 ms 39604 KB Output is correct
43 Correct 300 ms 41144 KB Output is correct
44 Correct 248 ms 39804 KB Output is correct
45 Correct 187 ms 39864 KB Output is correct
46 Correct 121 ms 39868 KB Output is correct
47 Correct 109 ms 39356 KB Output is correct
48 Correct 106 ms 39104 KB Output is correct
49 Correct 119 ms 39484 KB Output is correct
50 Correct 239 ms 39604 KB Output is correct
51 Correct 111 ms 39392 KB Output is correct
52 Incorrect 429 ms 66752 KB Output isn't correct
53 Halted 0 ms 0 KB -