제출 #297022

#제출 시각아이디문제언어결과실행 시간메모리
297022Gurban고대 책들 (IOI17_books)C++17
12 / 100
1 ms384 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; long long minimum_walk(vector<int> p, int s) { if(s == 0){ if(p.size()==1) return 0; else if(p.size()==2){ if(p[0] != 0) return 2; return 0; } else if(p.size()==3){ vector<int> v={0,1,2}; if(p==v) return 0; v={0,2,1}; if(p==v) return 4; v={1,0,2}; if(p==v) return 2; v={1,2,0}; if(p==v) return 4; v={2,0,1}; if(p==v) return 4; v={2,1,0}; if(p==v) return 4; } else { vector<int> v={0,1,2,3}; if(p==v) return 0; v={0,1,3,2}; if(p==v) return 6; v={0,2,1,3}; if(p==v) return 4; v={0,2,3,1}; if(p==v) return 6; v={0,3,1,2}; if(p==v) return 6; v={0,3,2,1}; if(p==v) return 6; v={1,0,2,3}; if(p==v) return 2; v={1,0,3,2}; if(p==v) return 8; v={1,2,0,3}; if(p==v) return 4; v={1,2,3,0}; if(p==v) return 6; v={1,3,0,2}; if(p==v) return 6; v={1,3,2,0}; if(p==v) return 6; v={2,0,1,3}; if(p==v) return 4; v={2,0,3,1}; if(p==v) return 6; v={2,1,0,3}; if(p==v) return 4; v={2,1,3,0}; if(p==v) return 6; v={2,3,0,1}; if(p==v) return 10; v={2,3,1,0}; if(p==v) return 8; v={3,0,1,2}; if(p==v) return 6; v={3,0,2,1}; if(p==v) return 6; v={3,1,0,2}; if(p==v) return 6; v={3,1,2,0}; if(p==v) return 6; v={3,2,0,1}; if(p==v) return 8; v={3,2,1,0}; if(p==v) return 8; } } 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...