| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 734221 | Amaarsaa | Pancake (NOI12_pancake) | C++14 | 1075 ms | 212 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<bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, ans, p, j, s;
void Dfs(ll a[], ll moves) {
if ( moves >= ans) return;
s = 0;
for (ll i = 1; i < n; i ++) {
if ( a[i] <=a[i + 1]) s = 1;
}
if ( s == 0) {
ans = min(moves, ans);
return;
}
for (ll i = 1; i <= n; i ++) {
reverse(a + i,a +n + 1);
Dfs(a, moves + 1);
reverse(a + i, a + n + 1);
}
return ;
}
int main() {
ll i, t, r;
cin >> t;
while ( t --) {
cin >> n;
ans = 2 * n;
ll a[n + 2];
for (i = 1; i <= n; i ++) {
cin >> a[i];
}
Dfs(a, 0);
cout <<ans << endl;
}
}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... | ||||
