# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666267 | 2022-11-28T02:36:15 Z | vuavisao | Pancake (NOI12_pancake) | C++14 | 7 ms | 340 KB |
#include<bits/stdc++.h> #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define ll long long using namespace std; const int N = 8 + 10; bool cakeee(int* val); bool special_case_zero(); bool special_case_one(); bool special_case_two(); void solve(); int n; int a[N]; void solve() { cin >> n; for(int i = 1; i <= n; ++ i) cin >> a[i]; a[0] = 1000000000; if(special_case_zero()) { cout << 0; return; } if(special_case_one()) { cout << 1; return; } if(special_case_two()) { cout << 2; return; } // assert(false); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen("Cake.inp", "r")) { freopen("Cake.inp", "r", stdin); freopen("Cake.out", "w", stdout); } int t; cin >> t; while(t--) { solve(); cout << '\n'; } return 0; } bool special_case_zero() { return cakeee(a); } bool special_case_one() { int tmp[N]; for(int i = 1; i <= n; ++ i) { for(int j = 0; j <= n; ++ j) tmp[j] = a[j]; reverse(tmp + i + 1, tmp + n + 1); if(cakeee(tmp)) return true; } return false; } bool special_case_two() { int tmp[N]; for(int i = 1; i <= n; ++ i) { for(int j = 1; j <= n; ++ j) { for(int k = 0; k <= n; ++ k) tmp[k] = a[k]; reverse(tmp + i + 1, tmp + n + 1); reverse(tmp + j + 1, tmp + n + 1); if(cakeee(tmp)) return true; } } return false; } bool cakeee(int* val) { for(int i = 1; i <= n; ++ i) if(val[i] > val[i - 1]) return false; return true; } /// Code by vuavisao
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |