oj.uz

Submission #6138

# Submission time Handle Problem Language Result Execution time Memory
6138 2014-06-20T09:32:18 Z gs13068 한자 끝말잇기 (JOI14_kanji) C++
0 / 100
 252 ms 12428 KB 
#include "Annalib.h"

static long long D[300][300];
static long long D2[300][300];
static int yes[5];

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,l;
  for(i=0;i<N;i++)for(j=0;j<N;j++)D[i][j]=D2[i][j]=4e18;
  for(i=0;i<N;i++)D[i][i]=D2[i][j]=0;
  for(i=0;i<M;i++)
  {
    D[A[i]][B[i]]=C[i];
    for(j=0;j<K;j++)if(i==U[j])break;
    if(j==k)D2[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];
    if(D2[i][j]>D2[i][k]+D2[k][j])D2[i][j]=D2[i][k]+D2[k][j];
  }
  for(i=0;i<Q;i++)
  {
    k=0;
    for(j=0;j<K;j++)if(D2[S[i]][A[U[j]]]+D[B[U[j]]][T[i]]<D[S[i]][T[i]])yes[k++]=j;
    for(j=0;j<k;j++)if(D[S[i]][A[U[j]]]+C[U[yes[j]]]+D[B[U[j]]][T[i]]==D[S[i]][T[i]])break;
    if(k<4)
    {
      Tap(j>>1);
      Tap(j&1);
    }
    else
    {
      Tap(j>>2);
      Tap((j>>1)&1);
      Tap(j&1);
    }
  }
}

#include "Brunolib.h"

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

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,l;
  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;
  }
  l=0;
  for(i=0;i<Q;i++)
  {
    k=0;
    for(j=0;j<K;j++)if(D[S[i]][A[U[j]]]+D[B[U[j]]][T[i]]<D[S[i]][T[i]])yes[k++]=j;
    if(k<4)
    {
      j=(X[l]<<1)|X[l+1];
      l+=2;
    }
    else
    {
      j=(X[l]<<2)|(X[l+1]<<1)|X[l+2];
      l+=3;
    }
    if(j<k)
    {
      j=yes[j];
      answer(S[i],A[U[j]]);
      Answer(U[j]);
      answer(B[U[j]],T[i]);
    }
    else answer(S[i],T[i]);
    Answer(-1);
  }
}

Compilation message

Anna.cpp: In function 'void Anna(int, int, int*, int*, long long int*, int, int*, int*, int, int*)':
Anna.cpp:9:13: warning: unused variable 'l' [-Wunused-variable]
   int i,j,k,l;
             ^
Anna.cpp:16:5: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if(j==k)D2[A[i]][B[i]]=C[i];
     ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 12428 KB Output is correct - L = 20
2 Incorrect 92 ms 12428 KB Output isn't correct - Wrong Answer [9]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 40.0

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

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 89 ms 12428 KB Output isn't correct - Wrong Answer [9]
2 Incorrect 86 ms 12428 KB Output isn't correct - Wrong Answer [9]
3 Incorrect 85 ms 12428 KB Output isn't correct - L = 120
4 Incorrect 85 ms 12428 KB Output isn't correct - L = 120
5 Incorrect 89 ms 12428 KB Output isn't correct - Wrong Answer [9]
6 Incorrect 89 ms 12428 KB Output isn't correct - Wrong Answer [9]
7 Incorrect 78 ms 12428 KB Output isn't correct - L = 120
8 Incorrect 89 ms 12428 KB Output isn't correct - Wrong Answer [9]
9 Incorrect 78 ms 12428 KB Output isn't correct - Wrong Answer [9]
10 Incorrect 82 ms 12428 KB Output isn't correct - Wrong Answer [9]
11 Incorrect 82 ms 12428 KB Output isn't correct - Wrong Answer [9]
12 Incorrect 86 ms 12428 KB Output isn't correct - L = 120
13 Incorrect 252 ms 12428 KB Output isn't correct - L = 120
14 Incorrect 82 ms 12428 KB Output isn't correct - Wrong Answer [9]
15 Incorrect 82 ms 12428 KB Output isn't correct - Wrong Answer [9]
16 Incorrect 98 ms 12428 KB Output isn't correct - Wrong Answer [9]
17 Incorrect 106 ms 12428 KB Output isn't correct - Wrong Answer [9]
18 Incorrect 112 ms 12428 KB Output isn't correct - Wrong Answer [9]
19 Incorrect 86 ms 12428 KB Output isn't correct - Wrong Answer [9]
20 Incorrect 102 ms 12428 KB Output isn't correct - L = 120
21 Incorrect 118 ms 12428 KB Output isn't correct - Wrong Answer [9]
22 Incorrect 86 ms 12428 KB Output isn't correct - Wrong Answer [9]
23 Incorrect 82 ms 12428 KB Output isn't correct - Wrong Answer [9]
24 Incorrect 75 ms 12428 KB Output isn't correct - Wrong Answer [9]