| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 881092 | HoriaHaivas | Trampoline (info1cup20_trampoline) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
"care a facut teste cu Lattice reduction attack e ciudat"
"linistiti va putin"
- 2023 -
*/
#include<bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
using namespace std;
struct trambuline_dorian_popa
{
int indice;
int l;
int c;
int lnorm;
};
bool cmp(trambuline_dorian_popa a, trambuline_dorian_popa b)
{
return a.l<b.l;
}
bool cmp2(trambuline_dorian_popa a, trambuline_dorian_popa b)
{
return a.c<b.c;
}
trambuline_dorian_popa v[200001];
int up[18][200001];
vector<trambuline_dorian_popa> nivel[200001];
unordered_map<int,int> mp;
unordered_map<int,int> mp2;
int main()
{
ifstream fin("secvp.in");
ofstream fout("secvp.out");
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,t,i,j,row,col,x,r,pas,x1,y1,x2,y2;
cin >> row >> col >> n;
for (j=1; j<=n; j++)
{
cin >> v[j].l >> v[j].c;
v[j].indice=j;
}
sort(v+1,v+1+n,cmp);
x=0;
for (j=1; j<=n; j++)
{
if (j==1 || v[j].l!=v[j-1].l)
{
if (x!=0)
sort(nivel[x].begin(),nivel[x].end(),cmp2);
x++;
}
v[j].lnorm=x;
nivel[x].push_back(v[j]);
mp[x]=v[j].l;
mp2[v[j].l]=x;
}
sort(nivel[x].begin(),nivel[x].end(),cmp2);
for (j=1; j<=n; j++)
{
if (mp2[v[j].l+1]==v[j].lnorm+1)
{
r=-1;
pas=(1<<17);
while (pas)
{
if (r+pas<nivel[v[j].lnorm+1].size() && v[j].c>nivel[v[j].lnorm+1][r+pas].c)
r+=pas;
pas=pas/2;
}
r++;
if (r==nivel[v[j].lnorm+1].size())
up[0][j]=j;
else
up[0][j]=nivel[v[j].lnorm+1][r].indice;
}
else
{
up[0][j]=j;
}
}
for (j=1; j<=17; j++)
{
for (i=1; i<=n; i++)
{
up[j][i]=up[j-1][up[j-1][i]];
}
}
cin >> t;
for (j=1; j<=t; j++)
{
cin >> x1 >> y1 >> x2 >> y2;
if (x1==x2 && y1<=y2)
{
cout << "Yes\n";
continue;
}
if (x1>x2 || y1>y2)
{
cout << "No\n";
continue;
}
if (mp2[x1]!=0)
{
r=-1;
pas=(1<<17);
while(pas)
{
if (r+pas<nivel[mp2[x1]].size() && y1>nivel[mp2[x1]][r+pas].c)
r+=pas;
pas=pas/2;
}
r++;
if (!(is_sorted(nivel[mp2[x1]].begin(),nivel[mp2[x1]].end())))
exit(1);
if (r==nivel[mp2[x1]].size())
{
if (x1==x2 && y1<=y2)
{
cout << "Yes\n";
continue;
}
else
{
cout << "No\n";
continue;
}
}
else
{
i=nivel[mp2[x1]][r].indice;
pas=17;
while(pas)
{
if (v[up[pas][i]].l+1<=x2)
i=up[pas][i];
pas--;
}
if (v[i].l+1==x2 && v[i].c<=y2)
{
cout << "Yes\n";
continue;
}
else
{
cout << "No\n";
continue;
}
}
}
else
{
if (x1==x2 && y1<=y2)
{
cout << "Yes\n";
continue;
}
else
{
cout << "No\n";
continue;
}
}
}
}