oj.uz

Submission #6126

# Submission time Handle Problem Language Result Execution time Memory
6126 2014-06-20T07:52:52 Z gs13068 한자 끝말잇기 (JOI14_kanji) C++
0 / 100
 226 ms 262144 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>>2)&1);
    Tap((j>>1)&1);
    Tap(j&1);
  }
}
#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);
  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]]=V[B[i]][A[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++)
  {
    j=(X[i*3]<<2)&(X[i*3+1]<<1)&X[i*3+2];
    if(j<K)
    {
      answer(S[i],A[j]);
      Answer(j);
      answer(B[j],T[i]);
    }
    else answer(S[i],T[i]);
    Answer(-1);
  }
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 40.0

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

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]
2 Incorrect 68 ms 11724 KB Output isn't correct - Wrong Answer [7]
3 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]
4 Incorrect 65 ms 11724 KB Output isn't correct - Wrong Answer [7]
5 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [7]
6 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
7 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
8 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]
9 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]
10 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
11 Incorrect 66 ms 11724 KB Output isn't correct - Wrong Answer [7]
12 Incorrect 66 ms 11724 KB Output isn't correct - Wrong Answer [7]
13 Incorrect 226 ms 11724 KB Output isn't correct - Wrong Answer [7]
14 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]
15 Incorrect 62 ms 11724 KB Output isn't correct - Wrong Answer [7]
16 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
17 Incorrect 81 ms 11724 KB Output isn't correct - Wrong Answer [7]
18 Incorrect 84 ms 11724 KB Output isn't correct - Wrong Answer [7]
19 Memory limit exceeded 112 ms 262144 KB Memory limit exceeded
20 Incorrect 76 ms 11724 KB Output isn't correct - Wrong Answer [7]
21 Incorrect 98 ms 11724 KB Output isn't correct - Wrong Answer [7]
22 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
23 Incorrect 72 ms 11724 KB Output isn't correct - Wrong Answer [7]
24 Incorrect 69 ms 11724 KB Output isn't correct - Wrong Answer [7]