oj.uz

Submission #6122

# Submission time Handle Problem Language Result Execution time Memory
6122 2014-06-20T07:36:13 Z gs13068 한자 끝말잇기 (JOI14_kanji) C++
0 / 100
 89 ms 12076 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]=1e18;
  for(i=0;i<M;i++)D[A[i]][B[i]]=D[B[i]][A[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;
    Tap(j&4);
    Tap(j&2);
    Tap(j&1);
  }
}
#include "Brunolib.h"

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

static void answer(int i,int j)
{
  if(V[i][j]>0)Answer(V[i][j]);
  else
  {
    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]=1e18;
  for(i=0;i<M;i++)if(C[i]>0)
  {
    D[A[i]][B[i]]=D[B[i]][A[i]]=C[i];
    V[A[i]][B[i]]=i+1;
  }
  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;
  }
  for(i=0;i<Q;i++)
  {
    answer(S[i],A[(X[i*3]<<2)&(X[i*3+1]<<1)&X[i*3+2]]);
    Answer((X[i*3]<<2)&(X[i*3+1]<<1)&X[i*3+2]);
    answer(A[(X[i*3]<<2)&(X[i*3+1]<<1)&X[i*3+2]],T[i]);
    Answer(-1);
  }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 12076 KB Output isn't correct - Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 12076 KB Output isn't correct - Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 12076 KB Output isn't correct - Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
2 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
3 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
4 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]
5 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
6 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
7 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
8 Incorrect 39 ms 12076 KB Output isn't correct - Wrong Answer [1]
9 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
10 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
11 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]
12 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]
13 Incorrect 89 ms 12076 KB Output isn't correct - Wrong Answer [1]
14 Incorrect 39 ms 12076 KB Output isn't correct - Wrong Answer [1]
15 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
16 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]
17 Incorrect 43 ms 12076 KB Output isn't correct - Wrong Answer [1]
18 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]
19 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
20 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
21 Incorrect 46 ms 12076 KB Output isn't correct - Wrong Answer [1]
22 Incorrect 33 ms 12076 KB Output isn't correct - Wrong Answer [1]
23 Incorrect 29 ms 12076 KB Output isn't correct - Wrong Answer [1]
24 Incorrect 36 ms 12076 KB Output isn't correct - Wrong Answer [1]