oj.uz

답안 #6134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
6134 2014-06-20T08:34:12 Z gs13068 한자 끝말잇기 (JOI14_kanji) C++
0 / 100
 206 ms 11724 KB 
#include "Annalib.h"

static long long D[300][300];

void Anna(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[])
{
  int i,j,k;
  for(i=0;i<N;i++)for(j=0;j<N;j++)D[i][j]=4e18;
  for(i=0;i<N;i++)D[i][i]=0;
  for(i=0;i<M;i++)D[A[i]][B[i]]=C[i];
  for(k=0;k<N;k++)for(i=0;i<N;i++)for(j=0;j<N;j++)if(D[i][j]>D[i][k]+D[k][j])D[i][j]=D[i][k]+D[k][j];
  for(i=0;i<Q;i++)
  {
    for(j=0;j<K;j++)if(D[S[i]][A[U[j]]]+C[U[j]]+D[B[U[j]]][T[i]]==D[S[i]][T[i]])break;
    if(j<2)
    {
      Tap(0);
      Tap(j&1);
    }
    else
    {
      Tap(1);
      Tap(j&1);
      Tap(j>>2);
    }
  }
}

#include "Brunolib.h"

static long long D[300][300];
static int V[300][300];

static void answer(int i,int j)
{
  if(V[i][j]>0)Answer(V[i][j]-1);
  if(V[i][j]<0)
  {
    answer(i,-V[i][j]-1);
    answer(-V[i][j]-1,j);
  }
}

void Bruno(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[],int L,int X[])
{
  int i,j,k;
  for(i=0;i<N;i++)for(j=0;j<N;j++)D[i][j]=4e18;
  for(i=0;i<M;i++)if(C[i]>0)
  {
    D[A[i]][B[i]]=C[i];
    V[A[i]][B[i]]=i+1;
  }
  for(i=0;i<N;i++)
  {
    D[i][i]=0;
    V[i][i]=0;
  }
  for(k=0;k<N;k++)for(i=0;i<N;i++)for(j=0;j<N;j++)if(D[i][j]>D[i][k]+D[k][j])
  {
    D[i][j]=D[i][k]+D[k][j];
    V[i][j]=-k-1;
  }
  k=0;
  for(i=0;i<Q;i++)
  {
    if(X[k]==0)
    {
      j=X[k+1];
      k+=2;
    }
    else
    {
      j=((X[k]<<2)|(X[k+1]<<1)|X[k+2])-2;
      k+=3;
    }
    if(j<K)
    {
      answer(S[i],A[U[j]]);
      Answer(U[j]);
      answer(B[U[j]],T[i]);
    }
    else answer(S[i],T[i]);
    Answer(-1);
  }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 11724 KB Output isn't correct - Wrong Answer [9]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 11724 KB Output isn't correct - Wrong Answer [9]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 58 ms 11724 KB Output isn't correct - Wrong Answer [9]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [9]
2 Incorrect 58 ms 11724 KB Output isn't correct - Wrong Answer [9]
3 Incorrect 58 ms 11724 KB Output isn't correct - L = 165
4 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
5 Incorrect 58 ms 11724 KB Output isn't correct - Wrong Answer [9]
6 Incorrect 55 ms 11724 KB Output isn't correct - Wrong Answer [9]
7 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
8 Incorrect 65 ms 11724 KB Output isn't correct - L = 179
9 Incorrect 59 ms 11724 KB Output isn't correct - Wrong Answer [9]
10 Incorrect 58 ms 11724 KB Output isn't correct - Wrong Answer [9]
11 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
12 Incorrect 62 ms 11724 KB Output isn't correct - L = 180
13 Incorrect 206 ms 11724 KB Output isn't correct - L = 180
14 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
15 Incorrect 68 ms 11724 KB Output isn't correct - L = 176
16 Incorrect 92 ms 11724 KB Output isn't correct - L = 180
17 Incorrect 96 ms 11724 KB Output isn't correct - L = 124
18 Incorrect 89 ms 11724 KB Output isn't correct - Wrong Answer [9]
19 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [9]
20 Incorrect 81 ms 11724 KB Output isn't correct - L = 180
21 Incorrect 96 ms 11724 KB Output isn't correct - L = 180
22 Incorrect 65 ms 11724 KB Output isn't correct - Wrong Answer [9]
23 Incorrect 58 ms 11724 KB Output isn't correct - Wrong Answer [9]
24 Incorrect 59 ms 11724 KB Output isn't correct - Wrong Answer [9]