#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,rch,pfx;
void init(int N,vector<int>h)
{
n=N;
gph.resize(n);
for(int i=0;i<n;i++){ // O(n^2)
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;
}
}
}
rch.resize(n,vector<int>(n,inf));
for(int i=0;i<n;i++){
queue<pair<int,int>>q;
vector<bool>vis(n,false);
q.push({0,i});
while(!q.empty()){
pair<int,int> f=q.front();
q.pop();
vis[f.second]=true;
rch[i][f.second]=min(f.first,rch[i][f.second]);
for(auto c:gph[f.second]){
if(!vis[c])q.push({f.first+1,c});
}
}
}
pfx.resize(n,vector<int>(n));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j<=i)pfx[i][j]=0;
else{
if(rch[i][j]==inf)pfx[i][j]=pfx[i][j-1];
else pfx[i][j]=pfx[i][j-1]+1;
}
}
}
rt;
}
int pcs(int i,int c,int d)
{
if(c==d)rt rch[i][c];
int mid=(c+d)/2;
if(pfx[i][mid]==pfx[i][c-1])rt pcs(i,mid+1,d);
else rt pcs(i,c,mid);
}
int minimum_jumps(int a,int b,int c,int d) //O(nlogn)
{
int ans=inf;
for(int i=a;i<=b;i++){
if(pfx[i][d]==pfx[i][c-1])continue;
int num=pcs(i,c,d);
ans=min(ans,num);
}
if(ans==inf)rt -1;
rt ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Execution timed out |
4034 ms |
8444 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
2 ms |
208 KB |
Output is correct |
6 |
Correct |
4 ms |
592 KB |
Output is correct |
7 |
Correct |
2 ms |
464 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
2 ms |
464 KB |
Output is correct |
10 |
Correct |
3 ms |
592 KB |
Output is correct |
11 |
Correct |
4 ms |
592 KB |
Output is correct |
12 |
Correct |
5 ms |
592 KB |
Output is correct |
13 |
Incorrect |
3 ms |
592 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
2 ms |
208 KB |
Output is correct |
6 |
Correct |
4 ms |
592 KB |
Output is correct |
7 |
Correct |
2 ms |
464 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
2 ms |
464 KB |
Output is correct |
10 |
Correct |
3 ms |
592 KB |
Output is correct |
11 |
Correct |
4 ms |
592 KB |
Output is correct |
12 |
Correct |
5 ms |
592 KB |
Output is correct |
13 |
Incorrect |
3 ms |
592 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Runtime error |
533 ms |
1048576 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Runtime error |
483 ms |
1048576 KB |
Execution killed with signal 9 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Runtime error |
483 ms |
1048576 KB |
Execution killed with signal 9 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Execution timed out |
4034 ms |
8444 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |