Submission #708119

#TimeUsernameProblemLanguageResultExecution timeMemory
708119CyanmondAncient Books (IOI17_books)C++17
50 / 100
124 ms22764 KiB
#include "books.h" #include <bits/stdc++.h> using i64 = long long; void chmax(i64 &a, i64 b) { if (a < b) a = b; } long long minimum_walk(std::vector<int> p, int s) { const int n = (int)p.size(); std::vector<i64> imos(n); for (int i = 0; i < n; ++i) { int a = i, b = p[i]; if (a > b) std::swap(a, b); ++imos[a]; --imos[b]; } for (int i = 0; i < n - 1; ++i) imos[i + 1] += imos[i]; i64 baseCost = std::accumulate(imos.begin(), imos.end(), 0ll); i64 x = 0, c = 0; for (int i = 0; i < n; ++i) { if (imos[i] == 0) { ++c; } if (imos[i] != 0) { x += c; c = 0; } } return baseCost + 2 * x; }
#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...