oj.uz

답안 #920384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920384 2024-02-02T13:59:03 Z hasuhasuiro Autobahn (COI21_autobahn) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, K, X;
    cin >> N >> K >> X;
    vector l(N, 0), r(N, 0), t(N, 0);
    for(int i = 0; i < N; i++) { cin >> l[i] >> t[i] >> r[i]; r[i]++; }
    vector P(0, 0);
    for(int i = 0; i < N; i++) { P.push_back(l[i]), P.push_back(r[i]), P.push_back(l[i]+t[i]); }
    int sizep(size(P));
    for(int i = 0; i < sizep; i++) { P.push_back(P[i]+X), P.push_back(P[i]-X); }
    sort(begin(P), end(P));
    P.erase(unique(begin(P), end(P)), end(P));

    /*
    for(int i = 0; i < size(P); i++) {
        cout << ' ' << P[i];
    }
    cout << endl;
    */

    map<int, int> mp;
    for(int i = 0; i < (int)size(P); i++) { mp[P[i]] = i; }
    vector imos(size(P), 0);
    for(int i = 0; i < N; i++) { imos[mp[l[i]]]++; imos[mp[r[i]]]--; }
    for(int i = 0; i < (int)size(P)-1; i++) { imos[i+1] += imos[i]; }

    vector imos2(size(P), 0LL);
    for(int i = 0; i < N; i++) { imos2[mp[l[i]+t[i]]]++; imos2[mp[r[i]]]--; }
    for(int i = 0; i < (int)size(P)-1; i++) { imos2[i+1] += imos2[i]; }
    for(int i = 0; i < (int)size(P); i++) { if(imos[i] < K) { imos2[i] = 0; } }

    /*
    for(int i = 0; i < size(P); i++) {
        cout << ' ' << imos2[i];
    }
    cout << endl;
    */

    long long ans(0LL), res(0LL);
    for(int i = 0, j = 0; i+1 < (int)size(P); i++) {
        for(; j+1 < (int)size(P); j++) {
            if(P[i]+X <= P[j]) break;
            else res += imos2[mp[P[j]]] * (long long)(P[j+1]-P[j]);
        }
        /* cout << res << ' ' << P[i] << ' ' << P[j] << endl; */
        ans = max(res, ans);
        res -= imos2[mp[P[i]]] * (long long)(P[i+1] - P[i]);
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -