oj.uz

답안 #365525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365525 2021-02-11T19:47:17 Z jasen_penchev Trampoline (info1cup20_trampoline) C++14
0 / 100
 107 ms 21492 KB 
#include <algorithm>
#include <iostream>
#define endl '\n'
using namespace std;

const int MAXN = 200000;
const int LOG = 20;

struct trampoline
{
    int x, y;
};

trampoline a[MAXN + 5];
int Next[MAXN + 5][LOG + 5];

bool cmp(trampoline a, trampoline b)
{
    if (a.x == b.x) return a.y < b.y;
    return a.x < b.x;
}

int main()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int R, C, N;
    cin >> R >> C >> N;

    for (int i = 1; i <= N; ++ i)
    {
        cin >> a[i].x >> a[i].y;
    }

    sort(a + 1, a + N + 1, cmp);

    for (int i = 1; i <= N; ++ i)
    {
        trampoline curr;
        curr.x = a[i].x + 1;
        curr.y = a[i].y;
        int l = 0, r = N + 1, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;

            if (curr.x > a[mid].x or (curr.x == a[mid].x and curr.y > a[mid].y)) l = mid;
            else r = mid;
        }

        if (r == N + 1 or curr.x < a[r].x) Next[i][0] = -1;
        else Next[i][0] = r;
    }

    /*for (int j = 1; j <= LOG; ++ j)
    {
        for (int i = 1; i <= N; ++ i)
        {
            Next[i][j] = Next[Next[i][j - 1]][j - 1];
        }
    }

    int T;
    cin >> T;
    for (int i = 1; i <= T; ++ i)
    {
        int x_start, y_start, x_stop, y_stop;
        cin >> x_start >> y_start >> x_stop >> y_stop;

        if (x_start > x_stop or (x_start == x_stop and y_start > y_stop))
        {
            cout << "No" << endl;
            continue;
        }
        if (x_start == x_stop)
        {
            cout << "Yes" << endl;
            continue;
        }

        trampoline curr;
        curr.x = x_start;
        curr.y = y_start;
        int l = 0, r = N + 1, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;

            if (curr.x > a[mid].x or (curr.x == a[mid].x and curr.y > a[mid].y)) l = mid;
            else r = mid;
        }

        if (r == N + 1 or curr.x < a[r].x)
        {
            cout << "No" << endl;
            continue;
        }

        int t = r;
        x_start = a[t].x;
        y_start = a[t].y;
        for (int j = LOG; j >= 0; -- j)
        {
            if (x_start + (1ll << j) < x_stop)
            {
                t = Next[t][j];
                if (t == -1) break;
                x_start = a[t].x;
                y_start = a[t].y;
            }
        }

        x_start++;

        if (t == -1 or x_start > x_stop or y_start > y_stop) cout << "No" << endl;
        else cout << "Yes" << endl;
    }*/

    return 0;
}

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1260 KB Answer contains longer sequence [length = 200], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 82 ms 21484 KB Answer contains longer sequence [length = 4000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 107 ms 21492 KB Answer contains longer sequence [length = 200000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 876 KB Answer contains longer sequence [length = 5000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 21484 KB Answer contains longer sequence [length = 200000], but output contains 0 elements
2 Halted 0 ms 0 KB -