oj.uz

Submission #560057

# Submission time Handle Problem Language Result Execution time Memory
560057 2022-05-11T03:27:00 Z Yazan_Alattar Autobahn (COI21_autobahn) C++14
50 / 100
 1000 ms 265464 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 2000007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

vector <ll> v;
ll n, k, x, l[M], t[M], r[M], cnt[M], tot[M], pref[M], ans;

void add(ll pos){
    if(pos < 0 || pos > 1e9) return;
    v.pb(pos);
    v.pb(pos + x - 1);
    v.pb(pos - x + 1);
    return;
}

ll get(ll val){
    return lower_bound(all(v), val) - v.begin() + 1;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k >> x;
    for(int i = 1; i <= n; ++i){
        cin >> l[i] >> t[i] >> r[i];

        for(int j = -2; j <= 2; ++j){
            add(l[i] + j);
            add(l[i] + t[i] + j);
            add(r[i] + j);
        }
    }

    int tmp = v.size();
    for(int i = 1; i <= tmp; ++i) add(v[i - 1]);

    sort(all(v));
    v.erase(unique(all(v)), v.end());

    for(int i = 1; i <= n; ++i){
        int to = get(r[i] + 1);
        ++cnt[get(l[i])];
        --cnt[to];

        ++tot[get(l[i] + t[i])];
        --tot[to];
    }
    for(int i = 1; i <= v.size() + 1; ++i) cnt[i] += cnt[i - 1], tot[i] += tot[i - 1];

    for(int i = 1; i <= v.size(); ++i){
        pref[i] = pref[i - 1];
        if(cnt[i - 1] >= k) pref[i] += (v[i - 1] - v[i - 2]) * tot[i - 1]; // [l, r[
    }

    for(int i = 0; i < v.size(); ++i){
        int posi = i + 1;
        int posj = get(v[i] + x - 1);

        if(posj > v.size()) break;

        ans = max(ans, pref[posj] - pref[posi] + (cnt[posj] >= k) * tot[posj]);
    }
    cout << ans << endl;
    return 0;
}

Compilation message

autobahn.cpp: In function 'int main()':
autobahn.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(int i = 1; i <= v.size() + 1; ++i) cnt[i] += cnt[i - 1], tot[i] += tot[i - 1];
      |                    ~~^~~~~~~~~~~~~~~
autobahn.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i = 1; i <= v.size(); ++i){
      |                    ~~^~~~~~~~~~~
autobahn.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i = 0; i < v.size(); ++i){
      |                    ~~^~~~~~~~~~
autobahn.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         if(posj > v.size()) break;
      |            ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 12 ms 2512 KB Output is correct
13 Correct 14 ms 2512 KB Output is correct
14 Correct 12 ms 2512 KB Output is correct
15 Correct 10 ms 2512 KB Output is correct
16 Correct 9 ms 2512 KB Output is correct
17 Correct 10 ms 2512 KB Output is correct
18 Correct 9 ms 2512 KB Output is correct
19 Correct 9 ms 2512 KB Output is correct
20 Correct 10 ms 2512 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 12 ms 2512 KB Output is correct
13 Correct 14 ms 2512 KB Output is correct
14 Correct 12 ms 2512 KB Output is correct
15 Correct 10 ms 2512 KB Output is correct
16 Correct 9 ms 2512 KB Output is correct
17 Correct 10 ms 2512 KB Output is correct
18 Correct 9 ms 2512 KB Output is correct
19 Correct 9 ms 2512 KB Output is correct
20 Correct 10 ms 2512 KB Output is correct
21 Execution timed out 1097 ms 265464 KB Time limit exceeded
22 Halted 0 ms 0 KB -