# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571211 | beaconmc | 꿈 (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 <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<vector<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]});
}
}