oj.uz

Submission #47760

# Submission time Handle Problem Language Result Execution time Memory
47760 2018-05-07T05:11:03 Z Talant Airline Route Map (JOI18_airline) C++17
0 / 100
 574 ms 22656 KB 
#include "Alicelib.h"
//#include "grader.cpp"
#include <cassert>
#include <cstdio>

void Alice( int N, int M, int A[], int B[] ){
	InitG( N, M );
	for (int i = 0; i < M; i ++)
            MakeG( i,A[i], B[i] );
}


#include "Boblib.h"
//#include "grader.cpp"
#include <cassert>
#include <cstdio>

void Bob( int V, int U, int C[], int D[] ){
	InitMap( V, U );
	for (int i = 0; i < U; i ++)
            MakeMap( C[i],D[i] );
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Failed 7 ms 6640 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Failed 7 ms 6640 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 22656 KB Output is correct : V - N = 0
2 Failed 506 ms 19144 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -