Submission #355090

#TimeUsernameProblemLanguageResultExecution timeMemory
355090juggernautAncient Books (IOI17_books)C++14
12 / 100
1 ms384 KiB
#include"books.h" #include<bits/stdc++.h> #ifndef EVAL #include"grader.cpp" #endif using namespace std; typedef long long ll; ll minimum_walk(vector<int>p,int s){ int n=p.size(); if(p==vector<int>{3,2,1,0}||p==vector<int>{3,2,0,1}||p==vector<int>{2,3,1,0})return 8; for(int i=n-1;i>0;i--) if(p[i]!=i)return i<<1; return 0; }
#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...