Submission #1301345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301345		tamir1	Obstacles for a Llama (IOI25_obstacles)	C++20	10 / 100	67 ms	9664 KiB

obstacles

#include <bits/stdc++.h>
#include "obstacles.h"
using namespace std;

static int N, M;
static vector<int> Tval, Hval;
static vector<int> c;
static vector<int> b;

void initialize(vector<int> T, vector<int> H) {
    Tval = T;
    Hval = H;
    N = Tval.size();
    M = Hval.size();

    c.assign(M, 0);
    b.assign(M, -1);

    int d = Tval[0];

    // Blocked if T[0] <= H[i]
    for (int i = 0; i < M; i++) {
        if (d <= Hval[i]) {
          c[i]=1;
        }
    }

    int last = M;

    for (int i = M - 1; i >= 0; i--) {
        if (c[i] == 0) {         // free
            b[i] = last - 1;
        } else {                 // blocked
            last = i;
        }
    }
}

bool can_reach(int L, int R, int S, int D) {
    return b[min(S, D)] >= max(S, D);
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17