제출 #435868

#제출 시각아이디문제언어결과실행 시간메모리
435868Tangent철로 (IOI14_rail)C++17
30 / 100
102 ms1004 KiB
#include "rail.h" #include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vii; typedef vector<ll> vll; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<vii> vvii; typedef vector<vll> vvll; typedef vector<vpii> vvpii; typedef vector<vpll> vvpll; #define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++) #define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--) #define rep(i, n) ffor(i, 0, n) #define forin(x, a) for (auto &x: a) #define all(a) a.begin(), a.end() map<pii, int> memo; int dist(int i, int j) { if (i > j) { swap(i, j); } if (!memo[{i, j}]) { memo[{i, j}] = getDistance(i, j); } return memo[{i, j}]; } void findLocation(int N, int first, int location[], int stype[]) { location[0] = first; stype[0] = 1; int closest = 1, mindist = dist(0, 1); ffor(i, 2, N) { if (dist(0, i) < mindist) { mindist = dist(0, i); closest = i; } } ffor(i, 1, N) { if (i == closest) { location[i] = first + dist(0, i); stype[i] = 2; } else { if (dist(0, i) == dist(0, closest) + dist(closest, i)) { location[i] = first + dist(0, closest) - dist(closest, i); stype[i] = 1; } else { location[i] = first + dist(0, i); stype[i] = 2; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...