oj.uz

답안 #881621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881621 2023-12-01T15:49:31 Z HoriaHaivas Trampoline (info1cup20_trampoline) C++14
100 / 100
 521 ms 56668 KB 
/*
    "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;
    }
    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].indice=j;
        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 (r==nivel[mp2[x1]].size())
            {
                
                    cout << "No\n";
                    continue;
                
            }
            else
            {
                i=nivel[mp2[x1]][r].indice;
                pas=17;
                while(pas>=0)
                {
                    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
        {
            
                cout << "No\n";
                continue;
            
        }
    }
}

Compilation message

trampoline.cpp: In function 'int main()':
trampoline.cpp:75:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<trambuline_dorian_popa>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                 if (r+pas<nivel[v[j].lnorm+1].size() && v[j].c>nivel[v[j].lnorm+1][r+pas].c)
      |                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
trampoline.cpp:80:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<trambuline_dorian_popa>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             if (r==nivel[v[j].lnorm+1].size())
      |                 ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
trampoline.cpp:117:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<trambuline_dorian_popa>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |                 if (r+pas<nivel[mp2[x1]].size() && y1>nivel[mp2[x1]][r+pas].c)
      |                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
trampoline.cpp:122:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<trambuline_dorian_popa>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             if (r==nivel[mp2[x1]].size())
      |                 ~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 21432 KB 200 token(s): yes count is 21, no count is 179
2 Correct 6 ms 21336 KB 200 token(s): yes count is 70, no count is 130
3 Correct 5 ms 21396 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 29248 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 62 ms 29272 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 60 ms 27728 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 63 ms 29300 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 36388 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 368 ms 36040 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 438 ms 35812 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 421 ms 36640 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 444 ms 36796 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 521 ms 42588 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21592 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 8 ms 21596 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 10 ms 22108 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 9 ms 21368 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 8 ms 21628 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 9 ms 21596 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 43524 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 451 ms 38724 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 378 ms 35544 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 497 ms 56668 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 406 ms 43180 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 411 ms 36412 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 391 ms 36744 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 418 ms 35540 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 391 ms 42612 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 467 ms 42604 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 448 ms 48424 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 338 ms 35360 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 384 ms 36388 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 415 ms 36724 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 327 ms 36460 KB 200000 token(s): yes count is 129674, no count is 70326