oj.uz

Submission #6127

# Submission time Handle Problem Language Result Execution time Memory
6127 2014-06-20T07:54:01 Z gs13068 한자 끝말잇기 (JOI14_kanji) C++
0 / 100
 1000 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]]=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]]=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++)
  {
    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 Execution timed out 1000 ms 11724 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Memory limit exceeded 85 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Memory limit exceeded 92 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Memory limit exceeded 116 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Memory limit exceeded 105 ms 262144 KB Memory limit exceeded
2 Memory limit exceeded 82 ms 262144 KB Memory limit exceeded
3 Memory limit exceeded 114 ms 262144 KB Memory limit exceeded
4 Memory limit exceeded 98 ms 262144 KB Memory limit exceeded
5 Memory limit exceeded 105 ms 262144 KB Memory limit exceeded
6 Memory limit exceeded 109 ms 262144 KB Memory limit exceeded
7 Memory limit exceeded 116 ms 262144 KB Memory limit exceeded
8 Memory limit exceeded 105 ms 262144 KB Memory limit exceeded
9 Memory limit exceeded 111 ms 262144 KB Memory limit exceeded
10 Memory limit exceeded 92 ms 262144 KB Memory limit exceeded
11 Memory limit exceeded 79 ms 262144 KB Memory limit exceeded
12 Execution timed out 1000 ms 11724 KB Execution timed out
13 Incorrect 229 ms 11724 KB Output isn't correct - Wrong Answer [9]
14 Memory limit exceeded 75 ms 262144 KB Memory limit exceeded
15 Execution timed out 1000 ms 11724 KB Execution timed out
16 Incorrect 78 ms 11724 KB Output isn't correct - Wrong Answer [9]
17 Incorrect 81 ms 11724 KB Output isn't correct - Wrong Answer [9]
18 Incorrect 95 ms 11724 KB Output isn't correct - Wrong Answer [9]
19 Memory limit exceeded 112 ms 262144 KB Memory limit exceeded
20 Incorrect 75 ms 11724 KB Output isn't correct - Wrong Answer [9]
21 Incorrect 106 ms 11724 KB Output isn't correct - Wrong Answer [9]
22 Memory limit exceeded 98 ms 262144 KB Memory limit exceeded
23 Memory limit exceeded 119 ms 262144 KB Memory limit exceeded
24 Memory limit exceeded 98 ms 262144 KB Memory limit exceeded