# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571215 | 2022-06-01T14:51:12 Z | beaconmc | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #pragma GCC optimize("O3") typedef long long ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) #define double long double using namespace std; vector<pair<ll, ll>> edges[100005]; int travelTime(int n, int m, int L, int a[], int b[], int t[]){ FOR(i,0,m){ edges[a[i]].push_back({b[i], t[i]}); edges[b[i]].push_back({a[i], t[i]}); } }