oj.uz

답안 #522705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
522705 2022-02-05T13:13:44 Z alexdumitru Trampoline (info1cup20_trampoline) C++14
0 / 100
 349 ms 18976 KB 
#include <bits/stdc++.h>

using namespace std;
pair<int,int> a[200005];
int n,i,t,j,l2[200005],sx,sy,fx,fy,r,c,lift[200005][20],pu[25];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>r>>c>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i].first>>a[i].second;
        if(i>1)
            l2[i]=l2[i>>1]+1;
    }
    sort(a+1,a+n+1);
    pu[0]=1;
    for(i=1;i<20;i++)
        pu[i]=pu[i-1]<<1;
    for(i=1;i<=n;i++)
    {
        int st=i+1;
        int dr=n;
        int poz=0;
        while(st<=dr)
        {
            int m=(st+dr)/2;
            if(a[m].first==a[i].first)
                st=m+1;
            else {
                if(a[m].first-a[i].first>1)
                    dr=m-1;
                else {
                    if(a[m].second>=a[i].second)
                    {
                        poz=m;
                        dr=m-1;
                    }
                    else st=m+1;
                }
            }
        }
        if(a[poz].first-a[i].first==1)
            lift[i][0]=poz;
    }
    for(j=1;j<=l2[n];j++)
        for(i=1;i<=n;i++)
            lift[i][j]=lift[lift[i][j-1]][j-1];
    cin>>t;
    while(t--)
    {
        cin>>sx>>sy>>fx>>fy;
        if(sx>fx)
        {
            cout<<"No\n";
        }
        else if(sx==fx)
        {
            cout<<"Yes\n";
        }
        else {
            if(sy>fy)
            {
                cout<<"No\n";
                continue;
            }
            int k=0;
            int st=1;
            int dr=n;
            int poz=0;
            while(st<=dr)
            {
                int m=(st+dr)/2;
                if(a[m].first<sx)
                    st=m+1;
                else if(a[m].first>sx)
                    dr=m-1;
                else {
                    if(a[m].second>=sy)
                    {
                        poz=m;
                        dr=m-1;
                    }
                    else st=m+1;
                }
            }
            k=poz;
            if(!k||a[k].second>fy)
            {
                cout<<"No\n";
                continue;
            }
            for(j=l2[n];j>=0;j--)
            {
                pair<int,int> x = a[lift[k][j]];
                if(lift[k][j]&&x.first<fx)
                {
                    k=lift[k][j];
                }
                else if(lift[k][j]&&x.first==fx)
                {
                    k=lift[k][j];
                    break;
                }
            }
            if(a[k].first>=fx-1&&a[k].second<=fy)
                cout<<"Yes\n";
            else cout<<"No\n";
        }
    }
    return 0;
}

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1100 KB expected YES, found NO [68th token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 86 ms 18256 KB expected YES, found NO [1822nd token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 196 ms 18876 KB expected YES, found NO [4th token]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 716 KB expected YES, found NO [1st token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 349 ms 18976 KB expected YES, found NO [1st token]
2 Halted 0 ms 0 KB -