제출 #390502

#제출 시각아이디문제언어결과실행 시간메모리
390502alireza_kaviani고대 책들 (IOI17_books)C++11
50 / 100
151 ms15940 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; typedef long long ll; const int MAXN = 1e6 + 10; int n; ll ans , ps[MAXN]; ll minimum_walk(vector<int> p, int s) { n = p.size(); for(int i = 0 ; i < n ; i++){ ps[min(p[i] , i)]++; ps[max(p[i] , i)]--; } partial_sum(ps , ps + MAXN , ps); while(ps[n] == 0) n--; for(int i = 0 ; i <= n ; i++){ ans += max(2ll , ps[i]); } return ans; }
#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...