# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241103 | NONAME | Go (COCI18_go) | C++14 | 6 ms | 416 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 111;
int n, k, m, a[N], b[N], t[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k >> m;
for (int i = 0; i < m; ++i)
cin >> a[i] >> b[i] >> t[i];
int cur = 0, ans = 0;
for (int i = 0; i < m && a[i] <= k; ++i) {
int tot = 2 * (k - a[i]);
cur = 0;
int j = i;
while (j < m && a[j] <= k) {
if (k - a[j] < t[j])
cur += b[j];
++j;
}
ans = max(ans, cur);
while (j < m) {
if (tot + a[j] - k < t[j])
cur += b[j];
++j;
}
ans = max(ans, cur);
}
for (int i = m - 1; i >= 0 && a[i] >= k; --i) {
int tot = 2 * (a[i] - k);
cur = 0;
int j = i;
while (j >= 0 && a[j] >= k) {
if (a[j] - k < t[j])
cur += b[j];
--j;
}
ans = max(ans, cur);
while (j >= 0) {
if (tot + k - a[j] < t[j])
cur += b[j];
--j;
}
ans = max(ans, cur);
}
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |