# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
919160 | 2024-01-31T11:52:54 Z | TIN | Baloni (COCI15_baloni) | C++17 | 64 ms | 13652 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" const int N = 1e6 + 5; int n; int h[N]; int pre[N]; int p[N]; bool b[N]; int ST[4 * 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]]) { 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 10588 KB | Output isn't correct |
2 | Incorrect | 3 ms | 10588 KB | Output isn't correct |
3 | Incorrect | 2 ms | 10588 KB | Output isn't correct |
4 | Incorrect | 2 ms | 10784 KB | Output isn't correct |
5 | Incorrect | 64 ms | 13652 KB | Output isn't correct |
6 | Incorrect | 53 ms | 13652 KB | Output isn't correct |
7 | Incorrect | 55 ms | 13148 KB | Output isn't correct |
8 | Incorrect | 41 ms | 13144 KB | Output isn't correct |
9 | Incorrect | 56 ms | 13248 KB | Output isn't correct |
10 | Incorrect | 55 ms | 13268 KB | Output isn't correct |