oj.uz

답안 #143253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143253 2019-08-13T12:28:31 Z Bodo171 웜뱃 (IOI13_wombats) C++14
39 / 100
 678 ms 54876 KB 
#include "wombats.h"
#include <iostream>
#include <fstream>
using namespace std;
const int rmax=5001;
const int cmax=50;
const int buck=1;
int h[rmax][cmax],v[rmax][cmax],dp[rmax][cmax];
int opt[cmax][cmax];
int arb[4*(rmax/buck)][cmax][cmax];
int n,m,i,j,start,sgn,len,k;
void recalc(int nod,int st,int dr)
{
    for(start=0;start<m;start++)
    {
        for(i=0;i<m;i++)
            dp[st][i]=(1<<30);
        dp[st][start]=0;
        for(i=st;i<=dr;i++)
        {
            if(i>st)
               for(j=0;j<m;j++)
                  dp[i][j]=(dp[i-1][j]+v[i-1][j]);
            for(j=1;j<m;j++)
                dp[i][j]=min(dp[i][j],dp[i][j-1]+h[i][j-1]);
            for(j=m-2;j>=0;j--)
                dp[i][j]=min(dp[i][j],dp[i][j+1]+h[i][j]);
        }
        for(j=0;j<m;j++)
            arb[nod][start][j]=dp[dr][j];
    }
}
void mrg(int A[][cmax],int trans[],int st[][cmax],int dr[][cmax])
{
    for(i=0;i<m;i++)
      for(j=0;j<m;j++)
        A[i][j]=(1<<30);
    for(i=0;i<m;i++)
        for(j=0;j<m;j++)
        {
            if(st[i][j]+dr[j][i]+trans[j]<A[i][i])
               A[i][i]=st[i][j]+dr[j][i]+trans[j],opt[0][i]=j;
        }
    int l,r;
    for(sgn=-1;sgn<=1;sgn+=2)
        for(len=1;len<m;len++)
            for(i=0;i<m;i++)
                if(i+len*sgn>=0&&i+len*sgn<m)
        {
            l=opt[len-1][i+sgn];r=opt[len-1][i];
            if(l>r) swap(l,r);
            for(k=l;k<=r;k++)
            {
                if(st[i][k]+dr[k][i+len*sgn]+trans[k]<A[i][i+len*sgn])
                {
                    A[i][i+len*sgn]=st[i][k]+dr[k][i+len*sgn]+trans[k];
                    opt[len][i]=k;
                }
            }
        }
}
void update(int nod,int l,int r,int poz)
{
    if(l==r)
    {
        recalc(nod,poz*buck,min((poz+1)*buck-1,n-1));
        return;
    }
    int m=(l+r)/2;
    if(poz<=m) update(2*nod,l,m,poz);
    else update(2*nod+1,m+1,r,poz);
    mrg(arb[nod],v[(m+1)*buck-1],arb[2*nod],arb[2*nod+1]);
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    n=R;m=C;
    for(i=0;i<R;i++)
        for(j=0;j<C-1;j++)
            h[i][j]=H[i][j];
    for(i=0;i<R-1;i++)
        for(j=0;j<C;j++)
            v[i][j]=V[i][j];
    for(int p=0;p<=(n-1)/buck;p++)
        update(1,0,(n-1)/buck,p);
}

void changeH(int P, int Q, int W) {
    h[P][Q]=W;
    update(1,0,(n-1)/buck,P/buck);
}
void changeV(int P, int Q, int W) {
    v[P][Q]=W;
    update(1,0,(n-1)/buck,P/buck);
}

int escape(int V1, int V2) {
    return arb[1][V1][V2];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 46456 KB Output is correct
2 Correct 49 ms 46584 KB Output is correct
3 Correct 119 ms 48120 KB Output is correct
4 Correct 49 ms 46456 KB Output is correct
5 Correct 49 ms 46584 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 3 ms 636 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 80 ms 3064 KB Output is correct
12 Correct 3 ms 760 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 53368 KB Output is correct
2 Correct 59 ms 53496 KB Output is correct
3 Correct 60 ms 53496 KB Output is correct
4 Correct 97 ms 54876 KB Output is correct

Subtask #5
0 / 21.0

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

Subtask #6
0 / 24.0

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