Submission #1253726

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253726		zipdang04	Obstacles for a Llama (IOI25_obstacles)	C++20	10 / 100	74 ms	8264 KiB

obstacles

#include "obstacles.h"

#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> using PQMax = priority_queue<T>;
template <class T> using PQMin = priority_queue<T, vector<T>, greater<T>>;
template <class T1, class T2>
void maximize(T1 &a, T2 b){
    if (b > a) a = b;
}
template <class T1, class T2>
void minimize(T1 &a, T2 b){
    if (b < a) a = b;
}
template <class T>
void read(T &number)
{
    bool negative = false;
    register int c;
    number = 0;
    c = getchar();
    while (c != '-' && !isalnum(c)) c = getchar();
    if (c=='-'){
        negative = true;
        c = getchar();
    }
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
    if (negative)
        number *= -1;
}
template <class T, class ...Ts>
void read(T &a, Ts& ... args){
    read(a);
    read(args...);
}

/*
struct Node
{
    int node, len;
    Node() {node = len = 0;}
    Node(int node, int len) {this -> node = node, this -> len = len;}
};
typedef vector<Node> vg;
*/

#define fi first
#define se second

#define FOR(type, i, a, b) for(type i = (a); i <= (b); i++)
#define REV(type, i, b, a) for(type i = (b); i >= (a); i--)

#define testBit(n, bit) (((n) >> (bit)) & 1)
#define flipBit(n, bit) ((n) ^ (1ll << (bit)))
#define cntBit(n) __builtin_popcount(n)
#define cntBitll(n) __builtin_popcountll(n)
#define log2(n) (31 - __builtin_clz(n))
#define log2ll(n) (63 - __builtin_clzll(n))
#define CURRENT_TIMESTAMP chrono::steady_clock::now().time_since_epoch().count()
#define randomize mt19937_64 mt(CURRENT_TIMESTAMP)

#define MAX 200001
#define MOD 1000000007

int nT, nH;
int T[MAX];
int H[MAX];


namespace Subtask1 {
    bool firstTime = true;
    
    vector<int> prv;
    void preprocess() {
        prv.resize(nH + 1, 0);
        FOR(int, i, 1, nH) 
            prv[i] = (T[1] <= H[i]) ? 0 : (
                (prv[i-1] == 0) ? i : prv[i-1]
            );
    }
    
    bool solve(int S, int D){
        if (firstTime) {
            firstTime = false; 
            preprocess();
        }

        return (prv[D] <= S);
    }
}

void initialize(std::vector<int> _T, std::vector<int> _H) {
    nT = _T.size(), nH = _H.size();
    FOR(int, i, 1, nT) T[i] = _T[i-1];
    FOR(int, i, 1, nH) H[i] = _H[i-1];
    return;
}

bool can_reach(int L, int R, int S, int D) {
    S++, D++; if (S > D) swap(S, D);        // 1S -> 1D
    return Subtask1::solve(S, D);
}

Compilation message (stderr)

obstacles.cpp: In function 'void read(T&)':
obstacles.cpp:30:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   30 |     register int c;
      |                  ^

• 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