# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978123 | 2024-05-08T21:30:43 Z | Isam | Global Warming (CEOI18_glo) | C++17 | 2000 ms | 2664 KB |
#include<bits/stdc++.h> using namespace std; #define eb emplace_back #define intt long long #define all(x) begin(x),end(x) constexpr int sz = 2e5 + 5; constexpr intt inf = 1E18 + 7; int n, x, t[sz]; signed main(){ ios_base::sync_with_stdio(0), cin.tie(0); cin >> n >> x; for(register int i = 1; i <= n; ++i){ cin >> t[i]; } vector<intt> dp(n+1, inf); dp[0] = -inf; for(register int i = 1; i <= n; ++i){ int l = upper_bound(all(dp), t[i]) - dp.begin(); if(dp[l] > t[i] && dp[l-1] < t[i]) dp[l] = t[i]; } int ans(1); for(register int i = 1; i <= n; ++i) if(dp[i] ^ inf) ans = i; if(x == 0) return cout << ans << '\n', 0; for(register int i = n; i >= 1; --i){ t[i] += x; dp.assign(n + 1, inf); dp[0] = -inf; for(register int j = 1; j <= n; ++j){ int l = upper_bound(all(dp), t[j]) - dp.begin(); if(dp[l] > t[j] && dp[l-1] < t[j]) dp[l] = t[j]; } for(register int j = max(i - 1, ans + 1); j <= n; ++j) if(dp[i] ^ inf) ans = max(ans, i); } cout << ans << '\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 2664 KB | Output is correct |
2 | Correct | 26 ms | 2648 KB | Output is correct |
3 | Correct | 26 ms | 2652 KB | Output is correct |
4 | Correct | 26 ms | 2652 KB | Output is correct |
5 | Correct | 20 ms | 2652 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2068 ms | 860 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2050 ms | 1628 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |