Submission #767308

#TimeUsernameProblemLanguageResultExecution timeMemory
767308raysh07고대 책들 (IOI17_books)C++17
0 / 100
1 ms296 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; long long minimum_walk(vector<int> a, int s) { if (s != 0) return 0; long long ans = 0; int n = a.size(); vector <bool> solved(n, false); int cnt = 0; int x = s; for (int i = 0; i < n; i++){ if (a[i] == i) { solved[i] = true; cnt++; } } while (cnt < n){ // cout << s << " " << ans << "\n"; if (solved[s]){ s++; ans++; continue; } int ok = abs(a[s] - s); // cout << ok << "\n"; ans += ok; solved[s] = true; cnt++; s = a[s]; } ans += abs(x - s); return ans; } // int main(){ // int n, s; cin >> n >> s; // vector <int> a(n); // for (auto &x : a) cin >> x; // cout << minimum_walk(a, s) << "\n"; // }
#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...