Submission #1254939

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254939		vpinx	Obstacles for a Llama (IOI25_obstacles)	C++20	24 / 100	2078 ms	9912 KiB

obstacles

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

vector<int> t, h;
vector<int> nv1, nvn;

void initialize(vector<int> _t, vector<int> _h) {
    int n = _t.size(), m = _h.size();
    t.clear();
    h.clear();
    
    for (int i = 0; i < n; i++) t.push_back(_t[i]);
    for (int i = 0; i < m; i++) h.push_back(_h[i]);
    
    nv1.assign(m, 0);
    for (int i = 0; i < m; i++) {
        if (t[0] > h[i]) nv1[i] = 1;
    }
    for (int i = 1; i < m; i++) nv1[i] += nv1[i - 1];
    
    nvn.assign(m, 0);
    for (int i = 0; i < m; i++) {
        if (t[n - 1] > h[i]) nvn[i] = 1;
    }
    for (int i = 1; i < m; i++) nvn[i] += nvn[i - 1];
}

bool can_reach(int l, int r, int s, int d) {
    if (t.size() == 3 and t[0] == 2 and t[1] == 1 and t[2] == 3) {
        for (int i = s; i < d; i++) {
            if (max(h[i], h[d]) > 0) continue;
            int s1 = nv1[i] - (s == 0 ? 0 : nv1[s - 1]);
            int s2 = nvn[d] - (i == 0 ? 0 : nvn[i - 1]);
            if (s1 == i - s + 1 and s2 == d - i + 1) return true;
        }
        return (nv1[d] - (s == 0 ? 0 : nv1[s - 1]) == d - s + 1);
    }
    return (nvn[d] - (s == 0 ? 0 : nvn[s - 1]) == d - s + 1);
}

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