oj.uz

Submission #284116

# Submission time Handle Problem Language Result Execution time Memory
284116 2020-08-26T20:56:41 Z Ruba_K Dreaming (IOI13_dreaming) C++14
0 / 100
 31 ms 4984 KB 
#include "dreaming.h"
#include<bits/stdc++.h>

using namespace std ;

const int NN = 1e5 + 5 ;
vector<pair<int , int > > adj[NN];


int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    long long sum = 0 ;
    for(int i = 0 ; i < M ; i ++)
        sum += T[i];

    return sum + L ;



}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -