Submission #1264445

#TimeUsernameProblemLanguageResultExecution timeMemory
1264445sohamsen15Pancake (NOI12_pancake)C++20
4 / 25
4 ms328 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; cin >> t; while (t--) { int n, curr = 0, ans = 0; cin >> n; vector<int> a(n); for (auto &x: a) cin >> x; map<int, int> m; for (auto x: a) m[x] = 1; for (auto [x, _]: m) m[x] = curr++; for (int i = 0; i < n; i++) a[i] = m[a[i]]; for (int i = 0; i < n - 1; i++) if (a[i] == n - 1 - i) continue; else ans++, reverse(a.begin() + i, a.end()); cout << ans << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...