제출 #113560

#제출 시각아이디문제언어결과실행 시간메모리
113560E869120고대 책들 (IOI17_books)C++14
50 / 100
160 ms18996 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; int n, cnt[1000009]; long long minimum_walk(vector<int> p, int s) { n = p.size(); int maxn = 0; for (int i = 0; i < n; i++) { int u = i, v = p[i]; if (u > v) swap(u, v); if (u != v) { maxn = max(maxn, max(u, v)); } cnt[u]++; cnt[v]--; } for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1]; long long sum = 0; for (int i = 0; i < n; i++) sum += 1LL * abs(p[i] - i); for (int i = 0; i < maxn; i++) { if (cnt[i] == 0) sum += 2; } 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...