Submission #983648

#TimeUsernameProblemLanguageResultExecution timeMemory
983648NexusRainforest Jumps (APIO21_jumps)C++17
0 / 100
84 ms7752 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const ll N=2e5+9,M=2e18+9,mod=1e9+7; bool vis[N]; pair<ll,ll>p; vector<ll>v[N]; ll a[N],n,x,y,z; priority_queue<pair<ll,ll>>q; void init(int m,vector<int>h) { n=m; } int minimum_jumps(int A, int B, int C, int D) { if(D==n-1)return 1; 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...