제출 #1792

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1792	2013-07-15 15:12:45	ainta	웜뱃 (IOI13_wombats)	C++98	76 / 100	20000 ms	54348 KiB

wombats

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "wombats.h"
#define SZ 64
#define INF 999999999
int D[128][201][201],bucket_sz,h[5010][210],v[5010][210],TP[100][210][210],r,c;
void Do(int num,int a)
{
  int i,j,k,bsz=bucket_sz;
  if(a+bsz>r)bsz=r-a;
  for(i=0;i<=bsz;i++)
    for(j=0;j<c;j++)
      for(k=0;k<c;k++)
        TP[i][j][k]=INF;
  for(i=0;i<c;i++)TP[0][i][i]=0;
  for(i=0;i<bsz;i++)
  {
    for(j=0;j<c;j++){
      for(k=1;k<c;k++)
        if(TP[i][j][k]>TP[i][j][k-1]+h[a+i][k-1])
          TP[i][j][k]=TP[i][j][k-1]+h[a+i][k-1];
      for(k=c-2;k>=0;k--)
        if(TP[i][j][k]>TP[i][j][k+1]+h[a+i][k])
          TP[i][j][k]=TP[i][j][k+1]+h[a+i][k];
    }
    for(j=0;j<c;j++)
      for(k=0;k<c;k++)
        TP[i+1][j][k]=TP[i][j][k]+v[a+i][k];
  }
  for(i=0;i<c;i++)
    for(j=0;j<c;j++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 0 / 24