oj.uz

답안 #972788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972788 2024-05-01T07:48:21 Z sleepntsheep 밀림 점프 (APIO21_jumps) C++11
4 / 100
 626 ms 18348 KB 
#include "jumps.h"

#include <vector>
#include <algorithm>

int subtask = -1;

#define MAX_N 200000
#define MAX_M (2*MAX_N)

int N, head[MAX_N], nxt[MAX_M], vv[MAX_M], ng[MAX_N], pg[MAX_N], HI[MAX_N], H[MAX_N];
int dd[MAX_N], pp[MAX_N], jj[MAX_N], dd_[MAX_N], pp_[MAX_N], jj_[MAX_N];

int seg[MAX_N<<2];

void build(int v, int l, int r)
{
    if (l==r)seg[v] = H[l];
    else build(v<<1,l,l+(r-l)/2), build(v<<1|1,l+(r-l)/2+1,r),seg[v]=std::max(seg[v<<1],seg[v<<1|1]);
}

int walk(int v,int l,int r,int x,int y,int k)
{
    if(l==r)return (H[l]<k?l:-1);
    if(seg[v<<1|1]>=k)return walk(v<<1|1,l+(r-l)/2+1,r,x,y,k);
    return walk(v<<1,l,l+(r-l)/2,x,y,k);
}

void link(int u, int v)
{
    static int i = 1;
    nxt[i] = head[u];
    vv[i] = v;
    head[u] = i++;
}

void binlift_connect(int*dd,int*pp,int*jj,int p,int u)
{
    dd[u] = dd[p] + 1;
    pp[u] = p;
    jj[u] = dd[p] - dd[jj[p]] == dd[jj[p]] - dd[jj[jj[p]]] ? jj[jj[p]] : p;
}

void init(int N, std::vector<int> H) {
    ::N = N;
    if (N <= 200) subtask = 2;
    else if (N <= 2000) subtask = 3;
    int flag = 1;
    for (int i = 1; i < N; ++i) if (H[i] != H[i-1] + 1) flag = 0;
    if(flag) subtask = 1;

    static int stk[MAX_N], so;
    so = 0;

    for (int i = 0; i < N; stk[so++] = i++) while (so && H[stk[so-1]] < H[i]) ng[stk[so-1]]=i, link(stk[--so], i);
    while(so)ng[stk[--so]]=-1;
    for (int i = N - 1; i >= 0; stk[so++] = i--) while (so && H[stk[so-1]] < H[i]) pg[stk[so-1]]=i, link(stk[--so], i);
    while(so)pg[stk[--so]]=-1;

    for (int i = 0; i < N; ++i) HI[::H[i]=H[i]-1] = i;

    for (int j = N; j--;)
    {
        int i = HI[j];
        int high = (pg[i] == -1) ? ng[i] : (ng[i] == -1 ? pg[i] : (H[ng[i]] > H[pg[i]] ? ng[i] : pg[i]));
        int low = pg[i] + ng[i] - high;
        if (high != -1) binlift_connect(dd, pp, jj, high, i);
        else pp[i] = jj[i] = i;
        if (low != -1) binlift_connect(dd_, pp_, jj_, low, i);
        else pp_[i] = jj_[i] = i;
    }

    if (subtask == -1) subtask = 4;

    build(1,0,N-1);
}

int Q_COUNTER = 0;

int minimum_jumps(int A, int B, int C, int D) {
    ++Q_COUNTER;

    if (subtask == 1) return (A>D)?-1:(B>=C?0:C-B);

    if (subtask == 4 && Q_COUNTER > 5) subtask = 5;

    if(subtask <= 4)
    {
        static int d[MAX_N], qu[MAX_N], qh=0, qt=0,z=1e9;
        for(int j=0;j<N;++j)d[j]=1e9;
        for (int i = A; i <= B; ++i) d[qu[qh++]=i]=0;
        while(qh-qt) for(int u=qu[qt++],j=head[u];j;j=nxt[j]) if(d[vv[j]]>d[u]+1)d[vv[j]]=d[u]+1,qu[qh++]=vv[j];
        for (int j = C; j <= D; ++j)if(d[j]!=1e9&&d[j]<z)z=d[j];
        return(z<1e9?z:-1);
    }

    if (subtask == 5 && A != B) subtask = 6;
    if (subtask == 6 && C != D) subtask = 7;

    if (subtask == 6) A = walk(1,0,N-1,A,B,H[C]);

    if (subtask == 5 || subtask == 6)
    {
        int u = A, u1;
        for(;pp[u]!=u;)
        {
            if (H[jj[u]]<=H[C])u=jj[u];
            else if(H[pp[u]]<=H[C])u=pp[u];
            else break;
        }
        u1=u;
        for(;pp_[u]!=u;)
        {
            if(H[jj_[u]]<=H[C])u=jj_[u];
            else if(H[pp_[u]]<=H[C])u=pp_[u];
            else break;
        }
        if(u!=C)return -1;
        return dd_[u1]-dd_[u]+dd[A]-dd[u1];
    }

    return -1;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 68 ms 17440 KB Output is correct
4 Correct 554 ms 18296 KB Output is correct
5 Correct 505 ms 16960 KB Output is correct
6 Correct 569 ms 18260 KB Output is correct
7 Correct 426 ms 17352 KB Output is correct
8 Correct 568 ms 18008 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 150 ms 16472 KB Output is correct
5 Correct 569 ms 17524 KB Output is correct
6 Correct 394 ms 13520 KB Output is correct
7 Correct 605 ms 17352 KB Output is correct
8 Correct 346 ms 16216 KB Output is correct
9 Correct 624 ms 17344 KB Output is correct
10 Correct 608 ms 18124 KB Output is correct
11 Incorrect 626 ms 18348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 150 ms 16472 KB Output is correct
5 Correct 569 ms 17524 KB Output is correct
6 Correct 394 ms 13520 KB Output is correct
7 Correct 605 ms 17352 KB Output is correct
8 Correct 346 ms 16216 KB Output is correct
9 Correct 624 ms 17344 KB Output is correct
10 Correct 608 ms 18124 KB Output is correct
11 Incorrect 626 ms 18348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 68 ms 17440 KB Output is correct
4 Correct 554 ms 18296 KB Output is correct
5 Correct 505 ms 16960 KB Output is correct
6 Correct 569 ms 18260 KB Output is correct
7 Correct 426 ms 17352 KB Output is correct
8 Correct 568 ms 18008 KB Output is correct
9 Incorrect 2 ms 12632 KB Output isn't correct
10 Halted 0 ms 0 KB -