제출 #429002

#제출 시각아이디문제언어결과실행 시간메모리
429002Dremix10고대 책들 (IOI17_books)C++17
0 / 100
1 ms292 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pi; typedef pair<ll,ll> pl; #define endl '\n' #define F first #define S second #define all(x) (x).begin(),(x).end() const int N = 3e5+1; const ll INF = 2e18; const int MOD = 1e9+7; long long minimum_walk(vector<int> p, int s) { int i,n = p.size(); ll ans = 0; bool ok[n] = {}; i = 0; int cnt = 0; while(cnt < n){ while(ok[i]){ i++; ans++; } int fin = i; ans += abs(p[i] - i); i = p[i]; ok[i] = true; cnt++; while(i != fin){ ans += abs(p[i] - i); i = p[i]; ok[i] = true; cnt++; } } ans += 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...