# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284115 | Ruba_K | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 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 "dreaming.h"
#include<bits/stdc++.h>
using namespace std ;
const int NN = 1e5 + 5 ;
vector<pair<int , int > > adj[NN];
long long 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 ;
}