#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"
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[])
{
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
43 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
2 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
3 |
Incorrect |
43 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
4 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
5 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
6 |
Incorrect |
39 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
7 |
Incorrect |
46 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
8 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
9 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
10 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
11 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
12 |
Incorrect |
39 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
13 |
Incorrect |
103 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
14 |
Incorrect |
43 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
15 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
16 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
17 |
Incorrect |
39 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
18 |
Incorrect |
39 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
19 |
Incorrect |
29 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
20 |
Incorrect |
49 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
21 |
Incorrect |
49 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
22 |
Incorrect |
33 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
23 |
Incorrect |
36 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |
24 |
Incorrect |
39 ms |
10668 KB |
Output isn't correct - Wrong Answer [1] |