Submission #1199126

#TimeUsernameProblemLanguageResultExecution timeMemory
1199126dostsAncient Books (IOI17_books)C++20
0 / 100
1 ms328 KiB
#include "books.h" #include <bits/stdc++.h> #define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() using namespace std; int minimum_walk(std::vector<int32_t> p, int32_t s) { assert(!s); int cur = 0; int n = p.size(); int32_t hold = -1; int walk = 0; int done = 0; for (int i = 0;i<n;i++) if (p[i] == i) done++; return 2*(n-done); }
#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...