| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1016857 | vjudge1 | Arranging Shoes (IOI19_shoes) | C++17 | 1101 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
bool check(vector<int> &x){
for(int i = 1; i < x.size(); i += 2){
if((x[i-1] < x[i]) && (x[i-1]*-1 == x[i])) continue;
else return false;
}
return true;
}
vector<vector<int>> moves(vector<int> &a){
vector<vector<int>> ans;
for(int i = 1; i < a.size(); ++i){
vector<int> temp(a.begin(), a.end());
swap(temp[i-1], temp[i]);
ans.push_back(temp);
}
return ans;
}
int bfs(vector<int> &src){
set<vector<int>> visited;
map<vector<int>, int> dist;
queue<vector<int>> q;
visited.insert(src);
dist[src] = 0;
q.push(src);
while(!q.empty()){
vector<int> act = q.front(); q.pop();
if(check(act)) return dist[act];
for(const auto &move : moves(act)){
if(visited.count(move)) continue;
dist[move] = dist[act] + 1;
visited.insert(move);
q.push(move);
}
}
}
long long count_swaps(std::vector<int> s) {
return bfs(s);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
