제출 #563568

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
563568		WKYH	밀림 점프 (APIO21_jumps)	C++14	21 / 100	4070 ms	13600 KiB

jumps

#include<bits/stdc++.h>
#define qc ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rt return
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef long double ld;
const long long mod=1e9+7;
const long long inf=INT_MAX;
using namespace std;
ll gcd(ll a,ll b){if(b==0)rt a;rt gcd(b,a%b);}

int n;
vector<vector<int>>gph;
void init(int N,vector<int>h)
{
    n=N;
    gph.resize(n);
    for(int i=0;i<n;i++){
        for(int j=i-1;j>=0;j--){
            if(h[j]>h[i]){
                gph[i].push_back(j);
                break;
            }
        }
        for(int j=i+1;j<n;j++){
            if(h[j]>h[i]){
                gph[i].push_back(j);
                break;
            }
        }
    }
    rt;
}
int minimum_jumps(int a,int b,int c,int d)
{
    queue<pair<int,int>>q; // num,ind
    vector<bool>vis(n,false);
    for(int i=a;i<=b;i++){
        q.push({0,i});
        vis[i]=true;
    }
    while(!q.empty()){
        int x=q.front().first, y=q.front().second;
        q.pop();
        if(y>=c&&y<=d)rt x;
        for(auto c:gph[y]){
            if(!vis[c]){
                q.push({x+1,c});
                vis[c]=1;
            }
        }
    }
    rt -1;
}

• Subtask 1: 0 / 4
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19