# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919163 | 2024-01-31T11:56:50 Z | TIN | Baloni (COCI15_baloni) | C++17 | 52 ms | 13008 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" const int N = 1e6 + 5; int n; int h[N], pre[N], p[N]; bool b[N]; void Task() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(9); if (fopen(FNAME".inp","r")) { freopen(FNAME".inp","r",stdin); freopen(FNAME".out","w",stdout); } } void Solve() { //Your Code cin >> n; for (int i = 1; i <= n; i++) cin >> h[i]; memset(p, 0, sizeof(p)); memset(pre, 0, sizeof(pre)); memset(b, true, sizeof(b)); for (int i = 1; i <= n; i++) { if (b[pre[h[i] + 1]] || pre[h[i] + 1] == 0) { p[i] = pre[h[i] + 1]; b[pre[h[i] + 1]] = false; } pre[h[i]] = i; } int res = 0; for (int i = 1; i <= n; i++) res += (p[i] == 0); cout << res << '\n'; } int main() { Task(); Solve(); cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms"; return 37^37; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 10840 KB | Output isn't correct |
2 | Incorrect | 2 ms | 11096 KB | Output isn't correct |
3 | Incorrect | 2 ms | 10840 KB | Output isn't correct |
4 | Incorrect | 2 ms | 10840 KB | Output isn't correct |
5 | Incorrect | 52 ms | 12880 KB | Output isn't correct |
6 | Incorrect | 51 ms | 13008 KB | Output isn't correct |
7 | Incorrect | 41 ms | 12880 KB | Output isn't correct |
8 | Incorrect | 40 ms | 12880 KB | Output isn't correct |
9 | Incorrect | 45 ms | 12880 KB | Output isn't correct |
10 | Incorrect | 44 ms | 12736 KB | Output isn't correct |