oj.uz

답안 #983626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983626 2024-05-15T19:24:12 Z Nexus 밀림 점프 (APIO21_jumps) C++17
0 / 100
 4000 ms 1048576 KB 
#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;
queue<pair<ll,ll>>q;
 
void init(int m,vector<int>h)
{
    n=m;
    for(ll i=0;i<n;++i)a[i]=h[i];
    for(ll i=0;i<n;++i)
    {
        for(ll j=i-1;j>=0;--j)
        {
            if(a[j]>a[i])
            {
                v[i].push_back(j);
                break;
            }
        }
        for(ll j=i+1;j<n;++j)
        {
            if(a[j]>a[i])
            {
                v[i].push_back(j);
                break;
            }
        }
 
    }
}
 
int minimum_jumps(int A, int B, int C, int D)
{
    x=-1;
    for(ll i=A;i<=B;++i)
    {
        if(!vis[i])
        {
            q.push({i,0});
            while(q.size())
            {
                p=q.front();
                q.pop();
                if(C<=p.first && p.first<=D)
                {
                  x=(x==-1?p.second:min(x,p.second));
                  while(q.size())q.pop();
                  break;
                }
                ++p.second;
                for(auto j:v[p.first])q.push({j,p.second});
            }
        }
    }
    return x;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Execution timed out 4059 ms 11420 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 7 ms 6744 KB Output is correct
7 Correct 4 ms 6488 KB Output is correct
8 Correct 7 ms 6488 KB Output is correct
9 Correct 3 ms 6488 KB Output is correct
10 Correct 10 ms 6488 KB Output is correct
11 Correct 11 ms 6488 KB Output is correct
12 Correct 13 ms 6488 KB Output is correct
13 Correct 18 ms 6488 KB Output is correct
14 Correct 7 ms 6488 KB Output is correct
15 Runtime error 1623 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 7 ms 6744 KB Output is correct
7 Correct 4 ms 6488 KB Output is correct
8 Correct 7 ms 6488 KB Output is correct
9 Correct 3 ms 6488 KB Output is correct
10 Correct 10 ms 6488 KB Output is correct
11 Correct 11 ms 6488 KB Output is correct
12 Correct 13 ms 6488 KB Output is correct
13 Correct 18 ms 6488 KB Output is correct
14 Correct 7 ms 6488 KB Output is correct
15 Runtime error 1623 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Execution timed out 4017 ms 38264 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Execution timed out 4048 ms 44612 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Execution timed out 4048 ms 44612 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Execution timed out 4059 ms 11420 KB Time limit exceeded
4 Halted 0 ms 0 KB -