Submission #755542

#TimeUsernameProblemLanguageResultExecution timeMemory
755542PanosPask전선 연결 (IOI17_wiring)C++14
13 / 100
25 ms3788 KiB
#include "wiring.h" #include <math.h> using namespace std; typedef long long ll; int n, m; long long min_total_length(std::vector<int> r, std::vector<int> b) { n = r.size(); m = b.size(); if (r.back() < b.front()) { ll ans = 0; int rfocal = r.back(); int bfocal = b.front(); int i = 0; while (i < n && i < m) { int rpoint = r[n - 1 - i]; int bpoint = b[i]; ans += abs(rpoint - bpoint); i++; } for (int cur = i; cur < n; cur++) { ans += abs(r[n - 1 - cur] - bfocal); } for (int cur = i; cur < m; cur++) { ans += abs(b[cur] - rfocal); } return ans; } return -1; }
#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...