oj.uz

답안 #987888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987888 2024-05-23T18:29:28 Z user736482 Trampoline (info1cup20_trampoline) C++17
81 / 100
 1921 ms 84868 KB 
#include<bits/stdc++.h>
using namespace std;

int R,C,N,T,a,b,c,d;
vector<pair<int,int>> ziel;
vector<int> point[200007];
pair<int,int>nast[200007];
int nast2[200007],pom[200007];
map<int,vector<int>>zielone;
map<pair<int,int>,int>mp;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>R>>C>>N;
    for(int i=0;i<N;i++){
        cin>>a>>b;
        mp[{a,b}]=i;
        ziel.push_back({a,b});
        zielone[a].push_back(b);
    }
    for(auto i=zielone.begin();i!=zielone.end();i++){
        sort((*i).second.begin(),(*i).second.end());
    }
    //cout<<zielone[2][0]<<" "<<zielone[2][1]<<"     ";
    for(int i=0;i<N;i++){
        //cout<<ziel[i].first<<" "<<ziel[i].second<<"   ";
        if((int)zielone[ziel[i].first+1].size()==0 || zielone[ziel[i].first+1][(int)zielone[ziel[i].first+1].size()-1]<ziel[i].second){
            nast[i]=ziel[i];
            nast2[i]=i;
        }
        else{
            nast[i].first=ziel[i].first+1;
            nast[i].second=*lower_bound(zielone[ziel[i].first+1].begin(),zielone[ziel[i].first+1].end(),ziel[i].second);
            //cout<<" "<<(int)zielone[ziel[i].first].size()<<"   ";
        
            nast2[i]=mp[{ziel[i].first+1,*lower_bound(zielone[ziel[i].first+1].begin(),zielone[ziel[i].first+1].end(),ziel[i].second)}];
        }
        point[i].push_back(nast2[i]);
        //cout<<"  "<<nast[i].first<<" "<<nast[i].second<<" "<<nast2[i]<<" "<<i<<"    ";
    }
    for(int j=1;j<N+3;j=j<<1){
        for(int i=0;i<N;i++){
            pom[i]= point[  point[i][point[i].size()-1] ]  [point  [ point[i][point[i].size()-1] ]  .size()-1] ;
        
                        
        }
        for(int i=0;i<N+7;i++)
            point[i].push_back(pom[i]);
       // if(j==4)
        //    return 0;
    }
    //cout<<"\n\n\n";
    cin>>T;
    for(int i=0;i<T;i++){
        cin>>a>>b>>c>>d;
        if(a>c){
            cout<<"No\n";
            continue;
        }
        if(a==c){
            if(b<=d)
                cout<<"Yes\n";
            else
                cout<<"No\n";
            continue;
        }
        c--;
        if(zielone[a].empty() || zielone[a][zielone[a].size()-1]<b){
            if(a==c+1 && b<=d)
                cout<<"Yes\n";
            else
                cout<<"No\n";
            continue;
        }
        int ak=mp[{a,*lower_bound(zielone[a].begin(),zielone[a].end(),b)}];
        int logarithm=0;
        int ak2=1;
        while(ak2*8<=c-a){
            ak2*=2;
            logarithm++;
        }
        //cout<<ak<<" ";
        while(a!=c){
            ak=point[ak][logarithm];
            a+=ak2;
            while(ak2>c-a){
                ak2/=2;
                logarithm--;
            }
        }
        if((ziel[ak].first==c) && (ziel[ak].second<=d))
            cout<<"Yes\n";
        else
            cout<<"No\n";
    }
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9564 KB 200 token(s): yes count is 21, no count is 179
2 Correct 13 ms 9564 KB 200 token(s): yes count is 70, no count is 130
3 Correct 10 ms 9308 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 512 ms 52264 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 528 ms 52260 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 428 ms 51600 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 460 ms 52188 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 577 ms 52036 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 576 ms 52160 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 601 ms 52040 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 776 ms 52692 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 785 ms 52612 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 1024 ms 58768 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 14 ms 17756 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1524 ms 59956 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 1219 ms 55072 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 835 ms 59684 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 1825 ms 84868 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 1142 ms 71124 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 845 ms 63880 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 850 ms 63680 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 867 ms 63768 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 1516 ms 70564 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 1679 ms 70396 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 1921 ms 77472 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 618 ms 63716 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 643 ms 63824 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 834 ms 64188 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 675 ms 63764 KB 200000 token(s): yes count is 129674, no count is 70326