이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;
const ll mxN=2e5+5;
const ll inf=1e18;
ll n;
vll h;
vll adj[mxN];
ll r[mxN];
ll l[mxN];
vll dis;
void init(int tn, vector<int> th){
n=tn;
h.resize(n);
for(ll i=0;i<n;i++){
h[i]=th[i];
}
}
int minimum_jumps(int a, int b, int c, int d){
return c-b;
}
/*int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, q;
cin>>n>>q;
int h[n];
for(ll i=0;i<n;i++){
cin>>h[i];
}
init(n, h);
for(ll i=0;i<q;i++){
int a, b, c, d;
cin>>a>>b>>c>>d;
cout<<minimum_jumps(a, b, c, d)<<'\n';
}
return 0;
}*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |