| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343212 | Nipphitch | Group Photo (JOI21_ho_t3) | C++20 | 1776 ms | 2162688 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=5005;
int n,a[N],ans;
queue <pair <int,vector <int>>> q;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
vector <int> tmp;
for(int i=1;i<=n;i++) tmp.push_back(a[i]);
q.push({0,tmp});
while(!q.empty()){
auto [d_u,u]=q.front();
q.pop();
bool ok=true;
for(int i=0;i+1<n;i++) if(u[i+1]+2<=u[i]) ok=false;
if(ok){
cout << d_u;
break;
}
for(int i=0;i+1<n;i++){
swap(u[i],u[i+1]);
q.push({d_u+1,u});
swap(u[i],u[i+1]);
}
}
}| # | 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... | ||||
