# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
6150 | gs13068 | 한자 끝말잇기 (JOI14_kanji) | C++98 | 225 ms | 11732 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Annalib.h"
#include<algorithm>
#include<cstdio>
static long long D[300][300];
static long long G[60];
static int Y[60];
void Anna(int N,int M,int A[],int B[],long long C[],int Q,int S[],int T[],int K,int U[])
{
long long val=0,mul=1;
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++)
{
for(j=0;j<K;j++)if(i==U[j])break;
if(j==K)D[A[i]][B[i]]=C[i];
}
for(i=0;i<N;i++)D[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];
for(i=0;i<Q;i++)Y[i]=K;
for(i=0;i<K;i++)
{
for(j=0;j<i;j++)
{
l=0;
for(k=0;k<Q;k++)if(Y[k]==j)
{
G[l]=D[B[U[i]]][T[k]]-D[B[U[j]]][T[k]];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |