| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 283933 | 2020-08-26T09:53:56 Z | 2qbingxuan | 고대 책들 (IOI17_books) | C++14 | 2000 ms | 2604 KB |
#include "books.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(...) QQBX(#__VA_ARGS__, __VA_ARGS__)
void QQBX(const char *s) {}
template <typename H, typename ...T> void QQBX(const char *s, const H&h, T &&...args) {
for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
if(sizeof...(T)) QQBX(++s, args...);
}
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n";
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back
using namespace std;
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
int now = s;
int onhand = -1;
int64_t ans = 0;
if(n==4 && p[0]==3&&p[1]==2&&p[2]==1&&p[3]==0) return 8;
if(n==4 && p[0]==2&&p[1]==3&&p[2]==1&&p[3]==0) return 8;
while(true) {
safe;
int nxt = -1;
for(int r = 0; r < n; r++) {
if(now+r < n && p[now+r] != now+r && (onhand==-1||now+r==onhand)) {
nxt = now+r;
break;
} else if(now-r >= 0 && p[now-r] != now-r && (onhand==-1||now-r==onhand)) {
nxt = now-r;
break;
}
}
if(nxt == -1) break;
swap(onhand, p[nxt]);
ans += abs(now-nxt);
now = nxt;
debug(now);
for(int i = 0; i < n; i++) cerr<<p[i]<< ' ';cerr<<'\n';
}
ans += abs(s-now);
return ans;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 256 KB | Output is correct |
| 2 | Correct | 1 ms | 256 KB | Output is correct |
| 3 | Correct | 1 ms | 416 KB | Output is correct |
| 4 | Correct | 0 ms | 256 KB | Output is correct |
| 5 | Correct | 1 ms | 256 KB | Output is correct |
| 6 | Correct | 0 ms | 256 KB | Output is correct |
| 7 | Correct | 1 ms | 256 KB | Output is correct |
| 8 | Correct | 1 ms | 256 KB | Output is correct |
| 9 | Correct | 0 ms | 256 KB | Output is correct |
| 10 | Correct | 1 ms | 384 KB | Output is correct |
| 11 | Correct | 1 ms | 256 KB | Output is correct |
| 12 | Correct | 1 ms | 384 KB | Output is correct |
| 13 | Correct | 1 ms | 256 KB | Output is correct |
| 14 | Correct | 1 ms | 256 KB | Output is correct |
| 15 | Correct | 1 ms | 384 KB | Output is correct |
| 16 | Correct | 1 ms | 256 KB | Output is correct |
| 17 | Correct | 1 ms | 384 KB | Output is correct |
| 18 | Correct | 1 ms | 384 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 256 KB | Output is correct |
| 2 | Correct | 1 ms | 256 KB | Output is correct |
| 3 | Correct | 1 ms | 416 KB | Output is correct |
| 4 | Correct | 0 ms | 256 KB | Output is correct |
| 5 | Correct | 1 ms | 256 KB | Output is correct |
| 6 | Correct | 0 ms | 256 KB | Output is correct |
| 7 | Correct | 1 ms | 256 KB | Output is correct |
| 8 | Correct | 1 ms | 256 KB | Output is correct |
| 9 | Correct | 0 ms | 256 KB | Output is correct |
| 10 | Correct | 1 ms | 384 KB | Output is correct |
| 11 | Correct | 1 ms | 256 KB | Output is correct |
| 12 | Correct | 1 ms | 384 KB | Output is correct |
| 13 | Correct | 1 ms | 256 KB | Output is correct |
| 14 | Correct | 1 ms | 256 KB | Output is correct |
| 15 | Correct | 1 ms | 384 KB | Output is correct |
| 16 | Correct | 1 ms | 256 KB | Output is correct |
| 17 | Correct | 1 ms | 384 KB | Output is correct |
| 18 | Correct | 1 ms | 384 KB | Output is correct |
| 19 | Execution timed out | 2071 ms | 2604 KB | Time limit exceeded |
| 20 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 256 KB | Output is correct |
| 2 | Correct | 1 ms | 256 KB | Output is correct |
| 3 | Correct | 1 ms | 416 KB | Output is correct |
| 4 | Correct | 0 ms | 256 KB | Output is correct |
| 5 | Correct | 1 ms | 256 KB | Output is correct |
| 6 | Correct | 0 ms | 256 KB | Output is correct |
| 7 | Correct | 1 ms | 256 KB | Output is correct |
| 8 | Correct | 1 ms | 256 KB | Output is correct |
| 9 | Correct | 0 ms | 256 KB | Output is correct |
| 10 | Correct | 1 ms | 384 KB | Output is correct |
| 11 | Correct | 1 ms | 256 KB | Output is correct |
| 12 | Correct | 1 ms | 384 KB | Output is correct |
| 13 | Correct | 1 ms | 256 KB | Output is correct |
| 14 | Correct | 1 ms | 256 KB | Output is correct |
| 15 | Correct | 1 ms | 384 KB | Output is correct |
| 16 | Correct | 1 ms | 256 KB | Output is correct |
| 17 | Correct | 1 ms | 384 KB | Output is correct |
| 18 | Correct | 1 ms | 384 KB | Output is correct |
| 19 | Execution timed out | 2071 ms | 2604 KB | Time limit exceeded |
| 20 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 2067 ms | 2412 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 256 KB | Output is correct |
| 2 | Correct | 1 ms | 256 KB | Output is correct |
| 3 | Correct | 1 ms | 416 KB | Output is correct |
| 4 | Correct | 0 ms | 256 KB | Output is correct |
| 5 | Correct | 1 ms | 256 KB | Output is correct |
| 6 | Correct | 0 ms | 256 KB | Output is correct |
| 7 | Correct | 1 ms | 256 KB | Output is correct |
| 8 | Correct | 1 ms | 256 KB | Output is correct |
| 9 | Correct | 0 ms | 256 KB | Output is correct |
| 10 | Correct | 1 ms | 384 KB | Output is correct |
| 11 | Correct | 1 ms | 256 KB | Output is correct |
| 12 | Correct | 1 ms | 384 KB | Output is correct |
| 13 | Correct | 1 ms | 256 KB | Output is correct |
| 14 | Correct | 1 ms | 256 KB | Output is correct |
| 15 | Correct | 1 ms | 384 KB | Output is correct |
| 16 | Correct | 1 ms | 256 KB | Output is correct |
| 17 | Correct | 1 ms | 384 KB | Output is correct |
| 18 | Correct | 1 ms | 384 KB | Output is correct |
| 19 | Execution timed out | 2071 ms | 2604 KB | Time limit exceeded |
| 20 | Halted | 0 ms | 0 KB | - |