#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<N;i++)D[i][i]=0;
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);
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;
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(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;
}
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[U[j]]);
Answer(U[j]);
answer(B[U[j]],T[i]);
}
else answer(S[i],T[i]);
Answer(-1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
65 ms |
11724 KB |
Output is correct - L = 30 |
2 |
Correct |
72 ms |
11724 KB |
Output is correct - L = 30 |
3 |
Correct |
66 ms |
11724 KB |
Output is correct - L = 30 |
4 |
Correct |
58 ms |
11724 KB |
Output is correct - L = 30 |
5 |
Correct |
58 ms |
11724 KB |
Output is correct - L = 30 |
6 |
Correct |
68 ms |
11724 KB |
Output is correct - L = 30 |
7 |
Correct |
62 ms |
11724 KB |
Output is correct - L = 30 |
8 |
Correct |
75 ms |
11724 KB |
Output is correct - L = 30 |
9 |
Correct |
81 ms |
11724 KB |
Output is correct - L = 30 |
10 |
Correct |
89 ms |
11724 KB |
Output is correct - L = 30 |
11 |
Correct |
72 ms |
11724 KB |
Output is correct - L = 3 |
12 |
Correct |
216 ms |
11724 KB |
Output is correct - L = 30 |
13 |
Correct |
66 ms |
11724 KB |
Output is correct - L = 30 |
14 |
Correct |
68 ms |
11724 KB |
Output is correct - L = 3 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
58 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
66 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
58 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
2 |
Incorrect |
58 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
3 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
4 |
Incorrect |
69 ms |
11724 KB |
Output isn't correct - Wrong Answer [6] |
5 |
Incorrect |
68 ms |
11724 KB |
Output isn't correct - L = 180 |
6 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - L = 180 |
7 |
Incorrect |
69 ms |
11724 KB |
Output isn't correct - L = 180 |
8 |
Incorrect |
79 ms |
11724 KB |
Output isn't correct - L = 180 |
9 |
Incorrect |
59 ms |
11724 KB |
Output isn't correct - L = 180 |
10 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - L = 180 |
11 |
Incorrect |
76 ms |
11724 KB |
Output isn't correct - L = 180 |
12 |
Incorrect |
66 ms |
11724 KB |
Output isn't correct - L = 180 |
13 |
Incorrect |
231 ms |
11724 KB |
Output isn't correct - L = 180 |
14 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - L = 180 |
15 |
Incorrect |
66 ms |
11724 KB |
Output isn't correct - L = 180 |
16 |
Incorrect |
75 ms |
11724 KB |
Output isn't correct - L = 180 |
17 |
Incorrect |
81 ms |
11724 KB |
Output isn't correct - L = 180 |
18 |
Incorrect |
95 ms |
11724 KB |
Output isn't correct - L = 180 |
19 |
Incorrect |
69 ms |
11724 KB |
Output isn't correct - L = 180 |
20 |
Incorrect |
78 ms |
11724 KB |
Output isn't correct - L = 180 |
21 |
Incorrect |
102 ms |
11724 KB |
Output isn't correct - L = 180 |
22 |
Incorrect |
66 ms |
11724 KB |
Output isn't correct - L = 180 |
23 |
Incorrect |
62 ms |
11724 KB |
Output isn't correct - L = 180 |
24 |
Incorrect |
58 ms |
11724 KB |
Output isn't correct - L = 180 |