oj.uz

답안 #983582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983582 2024-05-15T18:36:55 Z Nexus 밀림 점프 (APIO21_jumps) C++17
0 / 100
 4000 ms 35416 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=1e6+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 dfs(ll nd,ll dep,ll A,ll B,ll C,ll D)
{
    if(A<=nd && nd<=B)dep=0;
    if(C<=nd && nd<=D)
    {
        if(x==-1)x=dep;
        x=min(x,dep);
        return;
    }
    ++dep;
    for(auto i:v[nd])dfs(i,dep,A,B,C,D);
}

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])dfs(i,0,A,B,C,D);
    }
    return x;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25172 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 8 ms 25176 KB Output is correct
6 Correct 9 ms 25176 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 9 ms 25176 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 9 ms 25176 KB Output is correct
11 Correct 10 ms 25432 KB Output is correct
12 Correct 11 ms 25432 KB Output is correct
13 Correct 23 ms 25688 KB Output is correct
14 Correct 9 ms 25176 KB Output is correct
15 Execution timed out 4083 ms 25256 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25176 KB Output is correct
3 Correct 5 ms 25172 KB Output is correct
4 Correct 5 ms 25176 KB Output is correct
5 Correct 8 ms 25176 KB Output is correct
6 Correct 9 ms 25176 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 9 ms 25176 KB Output is correct
9 Correct 6 ms 25176 KB Output is correct
10 Correct 9 ms 25176 KB Output is correct
11 Correct 10 ms 25432 KB Output is correct
12 Correct 11 ms 25432 KB Output is correct
13 Correct 23 ms 25688 KB Output is correct
14 Correct 9 ms 25176 KB Output is correct
15 Execution timed out 4083 ms 25256 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 21.0

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

Subtask #7
0 / 19.0

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