oj.uz

Submission #1076002

# Submission time Handle Problem Language Result Execution time Memory
1076002 2024-08-26T10:22:36 Z Abito Ancient Books (IOI17_books) C++17
12 / 100
 2000 ms 1048576 KB 
#include "books.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
using namespace std;
// first n is permutation , n is index, n+1 is book in hand
int n;
map<vector<int>,int> dis;
void bfs(vector<int> s){
	deque<vector<int>> q;
	q.push_front(s);
	dis[s]=0;
	while (!q.empty()){
		vector<int> v=q.front(),to;
		q.pop_front();
		// switch books
		to=v;
		to[v[n]]=v[n+1];
		to[n+1]=v[v[n]];
		if (dis.find(to)==dis.end()){
			dis[to]=dis[v];
			q.push_front(to);
		}
		// walk forward
		if (v[n]+1<n){
			to=v;
			to[n]=v[n]+1;
			if (dis.find(to)==dis.end()){
				dis[to]=dis[v]+1;
				q.push_back(to);
			}
		}
		//walk backwards
		if (v[n]-1>=0){
			to=v;
			to[n]=v[n]-1;
			if (dis.find(to)==dis.end()){
				dis[to]=dis[v]+1;
				q.push_back(to);
			}
		}
	}
}
long long minimum_walk(std::vector<int32_t> p, int32_t s) {
	n=p.size();
	vector<int> v;
	for (int i=0;i<n;i++) v.pb(i);
	v.pb(s);
	v.pb(n);
	bfs(v);
	v=p;
	v.pb(s);
	v.pb(n);
	return dis[v];
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Runtime error 1867 ms 1048576 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Runtime error 1867 ms 1048576 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 470572 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Runtime error 1867 ms 1048576 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -