Submission #1202351

#TimeUsernameProblemLanguageResultExecution timeMemory
1202351Kavelmydex밀림 점프 (APIO21_jumps)C++20
4 / 100
265 ms1956 KiB
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define vi vector<int>  
#define pi pair<int,int>
#define pb push_back
#define sz(x) ((int)x.size())
#define sp ' '
#define endl "\n"
#define all(x) (x).begin(),(x).end()
#define rep(i,x,n) for(int i=x; i<=n; ++i)
#define For(i,n) rep(i,0,n-1)   
#define ff first 
#define ss second
#define ld long double
#define mp make_pair

const ll mxN=6e5+10,OO=2e9,mod=1e9+7;
ll exp(ll b,ll p){
  ll res=1;
  while(p>0){
    if(p&1)res=res*b%mod;
    b=b*b%mod;
    p/=2;
  }
  return res;
}
const ll inv=exp(6,mod-2);  
const int dx[]{0,0,-1,1}, dy[]{1,-1,0,0};
    
void cmn(int &a,int b){a = min(a,b);}
void cmx(int &a,int b){a = max(a,b);}

void init(int N, std::vector<int> H) {

}

int minimum_jumps(int A, int B, int C, int D) {
  return C-B;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...