# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443229 | 2021-07-10T07:59:42 Z | LittleCube | Global Warming (CEOI18_glo) | C++14 | 41 ms | 3676 KB |
#pragma GCC optimize("O3,unroll-loops") #include <bits/stdc++.h> #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define F first #define S second using namespace std; ll N, x, val[200005], ans; signed main() { ios::sync_with_stdio(0), cin.tie(0); cin >> N >> x; for (int i = 1; i <= N; i++) cin >> val[i]; vector<int> v; for (int i = 1; i <= N; i++) { int idx = lower_bound(v.begin(), v.end(), val[i]) - v.begin(); if (idx == v.size()) v.emplace_back(val[i]); else v[idx] = val[i]; } cout << v.size() << '\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 2584 KB | Output is correct |
2 | Correct | 39 ms | 2552 KB | Output is correct |
3 | Correct | 40 ms | 2636 KB | Output is correct |
4 | Correct | 39 ms | 2624 KB | Output is correct |
5 | Correct | 28 ms | 3676 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 1128 KB | Output is correct |
2 | Correct | 10 ms | 1204 KB | Output is correct |
3 | Correct | 10 ms | 1176 KB | Output is correct |
4 | Incorrect | 7 ms | 1228 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 1740 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |