제출 #917598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917598		hariaakas646	밀림 점프 (APIO21_jumps)	C++14	0 / 100	0 ms	344 KiB

jumps

        #include "jumps.h"
        #include <bits/stdc++.h>
         
        using namespace std;
         
        #define scd(t) scanf("%d", &t)
        #define sclld(t) scanf("%lld", &t)
        #define forr(i, l, r) for(int i=l; i<r; i++)
        #define frange(i, l) forr(i, 0, l)
        #define pb push_back
        #define mp make_pair
        #define f first
        #define s second
        #define all(x) x.begin(), x.end()
         
        typedef vector<int> vi;
        typedef pair<int, int> pii;
        typedef vector<pii> vii;
        typedef long long lli;
        typedef vector<vi> vvi;
        typedef vector<lli> vll;
        typedef vector<bool> vb;
        typedef set<int> seti;
        typedef multiset<int> mseti;
         
        vvi graph;
        int n;
         
        void init(int N, std::vector<int> h) {
          n = N;
          graph = vvi(n);
          deque<int> dq;
          frange(i, n) {
            while(dq.size() && h[i] >= h[dq.back()]) dq.pop_back();
            if(dq.size()) graph[i].pb(dq.back());
            dq.pb(i);
          }
         
          dq = {};
         
          for(int i=n-1; i>=0; i--) {
            while(dq.size() && h[i] >= h[dq.back()]) dq.pop_back();
            if(dq.size()) graph[i].pb(dq.back());
            dq.pb(i);
          }
         
        }
         
        int minimum_jumps(int A, int B, int C, int D) {
         
          // queue<pii> q;
          // forr(i, A, B+1) q.push(mp(i, 0));
          // vb vis(n);
         
          // while(q.size()) {
          //   auto p = q.front();
          //   q.pop();
         
          //   if(C <= p.f && p.f <= D) return p.s;
          //   if(vis[p.f]) continue;
          //   vis[p.f] = true;
         
          //   for(auto e : graph[p.f]) {
          //     q.push(mp(e, p.s+1));
          //   }
          // }
         
          if(D < A)
            return -1;
          else return max(0, C - D);
        }

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