Submission #105226

#TimeUsernameProblemLanguageResultExecution timeMemory
105226bert30702고대 책들 (IOI17_books)C++17
50 / 100
188 ms12152 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; const int MX = 1e6 + 100; int G[MX]; long long minimum_walk(vector<int> p, int s) { int n = p.size(); while(p[n - 1] == n - 1 and n - 1 > s) n --; long long sum = 0; for(int i = 0; i < n; i ++) { G[p[i]] = max(G[p[i]], i); G[i] = max(G[i], p[i]); sum += abs(i - p[i]); } for(int i = 0; i + 1 < n; i ++) { if(p[i] == i and i < s) continue; int ptr = i + 1; while(ptr <= G[i]) { G[i] = max(G[i], G[ptr]); ptr ++; } if(ptr < n) sum += 2; i = ptr - 1; } return sum; }
#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...