oj.uz

답안 #523018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523018 2022-02-06T18:51:47 Z Neacsu_Mihai Trampoline (info1cup20_trampoline) C++14
100 / 100
 320 ms 21344 KB 
/*
    Am schimbat niste chestii sa vad daca merge
*/
#include <iostream>
#include <vector>
#include <algorithm>

#define NMAX 200005 //doua sute cincizeci de mii

using namespace std;

int R, C, N, T;
pair <int, int> s[NMAX + 1];
int t[25][NMAX + 1];
int cautareBinara(int x,int y)
{
    int st=1,dr=N,mij=0,ras=0;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (s[mij].first>x) {dr=mij-1;}
        else if (s[mij].first<x) {st=mij+1;}
        else if (s[mij].second<y) {st=mij+1;}
        else {dr=mij-1; ras=mij;}
    }
    return ras;
}
/*
int cautareBinara(int x, int y){

        //Imi returneaza, din lista de trambuline verzi, numarul celei de pe linia x, cu lowerboundul ei = y
        //daca nu exista niciunul pe linia x, returneaza 0


    int lo = 0;
    int hi = N + 1;
    int ans = 0;

    while(hi - lo > 1){
        int mid = lo + (hi - lo) / 2;

        if(s[mid].first > x){
            hi = mid;
        }
        else if(s[mid].first < x){
            lo = mid;
        }
        else if(s[mid].second < y){
            lo = mid;
        }
        else {
            ans = mid;
            hi = mid;
        }
    }

    return ans;
}*/

/*
int stramos(int node, int nr){
    if(nr == 0){
        return node;
    }

    for(int i = 19; i >= 0; i--){
        if( (1 << i) <= nr ){
            node = t[i][node];
            nr -= (1 << i);
        }
    }
    ///daca node ajunge sa fie 0, inseamna ca nu exista al nr-lea stramos al lui node
    ///dar la mine trebuie sa existe ca sa zic 'Yes', ca altfel inseamna ca nu am destule trambuline pe drum
    ///adica inseamna ca nu am trambuline de la (xs, xf) destule
    ///si atunci vreau sa returnez ceva care sa ma faca sa afisez 'No', adica returnez un 'y' f mare, pentru ca eu urmeaza sa il compar cu yf
    if(node == 0){
        return 2000000000;
    }

    return s[node].second; ///returneaza 'y'-ul celui de-al 'nr'-ulea stramos al lui 'node'
}*/

int stramos(int nod,int lvl)
{
    for (int i=19;i>=0;--i)
    {
        if ((1<<i)<=lvl)
        {
            nod=t[i][nod];
            lvl-=(1<<i);
        }
    }
    if (nod==0) return 2000000000;
    return s[nod].second;
}

int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);

    cin >> R >> C >> N; ///globale

    for(int i = 1; i <= N; i++){
        cin >> s[i].first >> s[i].second;
    }
    sort(s + 1, s + N + 1);

    for(int i = 1; i <= N; i++){
        int aux = cautareBinara(s[i].first + 1, s[i].second);
        t[0][i] = aux;
    }
    for(int i = 1; i <= 19; i++){
        for(int j = 1; j <= N; j++){
            t[i][j] = t[i - 1][ t[i - 1][j] ];
        }
    }


    cin >> T; ///global
    for(int Q = 1; Q <= T; Q++){

        int xs, ys, xf, yf;
        cin >> xs >> ys >> xf >> yf;

        if(xf == xs){ ///caz special ca altfel am niste valori cu -1 si nu are sens
            if(ys <= yf){
                cout << "Yes\n";
            }
            else {
                cout << "No\n";
            }
        }
        else if(xs > xf || ys > yf){
            cout << "No\n";
        }
        else {
            int st = cautareBinara(xs, ys); ///caut cel mai din stanga valid de pe linia 'xs'
            if(st == 0){
                cout << "No\n";
            }
            else if( stramos(st, xf - 1 - xs) <= yf ){ ///verific al 'xf - 1 - xs'-lea stramos al acestuia si verific daca e mai mic ca 'yf'
                cout << "Yes\n";
            }
            else {
                cout << "No\n";
            }
        }
    }

    return 0;
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 17496 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 66 ms 18140 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 68 ms 18156 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 85 ms 18152 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 18124 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 204 ms 21184 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 209 ms 21196 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 210 ms 21108 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 225 ms 21092 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 215 ms 21208 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 844 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 6 ms 1096 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 5 ms 1100 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 5 ms 1108 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 8 ms 1180 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 5 ms 1100 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 18212 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 274 ms 21344 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 219 ms 21204 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 320 ms 21244 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 249 ms 21164 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 222 ms 21232 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 208 ms 21184 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 207 ms 21184 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 267 ms 21108 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 281 ms 21192 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 280 ms 21056 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 201 ms 21008 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 189 ms 21060 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 240 ms 21008 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 185 ms 20944 KB 200000 token(s): yes count is 129674, no count is 70326