oj.uz

답안 #523055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523055 2022-02-06T19:34:32 Z Neacsu_Mihai Trampoline (info1cup20_trampoline) C++14
54 / 100
 268 ms 36956 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define YMAX 1e9
#define NMAX 200000 //doua sute cincizeci de mii

using namespace std;

ifstream fin ("test.in");
ofstream fout ("test.out");

int R, C, N, T;
pair <int, int> s[NMAX + 1];
int t[25][NMAX + 1];
int lg[NMAX + 1];

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 s[node].second;
    }

    for(int i = lg[nr]; 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 YMAX + 1;
    }

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

void computeLg(){
    lg[1] = 0;
    for(int i = 2; i <= NMAX; i++){
        lg[i] = lg[i / 2] + 1;
    }
}


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

    computeLg();

    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 1868 KB 200 token(s): yes count is 21, no count is 179
2 Correct 4 ms 1996 KB 200 token(s): yes count is 70, no count is 130
3 Correct 3 ms 1740 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 18304 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 70 ms 18360 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 86 ms 18276 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 76 ms 18324 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 18940 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 173 ms 18924 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 184 ms 19084 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 175 ms 18916 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 180 ms 18980 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 183 ms 19140 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1612 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 5 ms 1612 KB 5000 token(s): yes count is 3837, no count is 1163
3 Runtime error 5 ms 3144 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 19024 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 256 ms 19032 KB 200000 token(s): yes count is 161254, no count is 38746
3 Runtime error 88 ms 36956 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -