# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075343 | 2024-08-26T03:22:12 Z | theehann | Rabbit Carrot (LMIO19_triusis) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define ft first #define se second #define NAME "A" #define file freopen(NAME".INP","r",stdin); freopen(NAME".OUT","w",stdout); #define sdf ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define el cout << "\n" const int MOD = 1e9 + 7, N = 1e5 + 5; int n, m; int32_t main(){ sdf cin >> n >> m; vector<int> a(n+1), b; for(int i = 1;i <= n;++i){ cin >> a[i]; if(a[i] <= m * i){ b.push_back(m*i - a[i]); } } multiset<int> st; for(int i = 0;i < b.size();++i){ auto it = st.upper_bound(b[i]); if(it != st.begin()){ it--; st.erase(it); } st.insert(b[i]); } cout << n - st.size(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |