Submission #241105

# Submission time Handle Problem Language Result Execution time Memory
241105 2020-06-22T16:25:15 Z NONAME Go (COCI18_go) C++14
90 / 100
5 ms 384 KB
#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];

vector <pair <int, pair <int, int> > > v;

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];
        v.push_back(make_pair(a[i], make_pair(b[i], t[i])));
    }
    
    sort(v.begin(), v.end());
    
    for (int i = 0; i < m; ++i)
        a[i] = v[i].first, b[i] = v[i].second.first, t[i] = v[i].second.second;
    
    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
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Incorrect 5 ms 384 KB Output isn't correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct