Submission #571220

#TimeUsernameProblemLanguageResultExecution timeMemory
571220beaconmcDreaming (IOI13_dreaming)C++14
0 / 100
40 ms8044 KiB
#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 #include "dreaming.h" 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]}); } return 18; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...