제출 #283870

#제출 시각아이디문제언어결과실행 시간메모리
283870emanIaicepsaAncient Books (IOI17_books)C++14
0 / 100
1 ms256 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; int n; long long minimum_walk(std::vector<int> p, int s) { n = p.size(); for(int i=n-1;i>0;i--){ if(p[i] != i) return i*2; } 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...