# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284115 | 2020-08-26T20:56:17 Z | Ruba_K | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KB |
#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 ; }