제출 #1343105

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1343105		aritro_	장애물 (IOI25_obstacles)	C++20	10 / 100	74 ms	7444 KiB

obstacles

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

typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

const int maxN=2e5 + 15;
vector<int> segment(maxN);
int T;

void initialize(vector<int>t,vector<int>H){
    int n=H.size();
    T=t[0];
    int cur=0;
    for(int j=0;j<n;j++){
        if(T>H[j]){
            if(j==0||!(T>H[j-1])) cur++;
            segment[j]=cur;
        }else segment[j]=-1;
    }
}

bool can_reach(int L,int R,int S,int D){
    return (segment[S]==segment[D])&&(segment[S]!=-1);
}

• 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