# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423586 | JvThunder | Autobahn (COI21_autobahn) | C++14 | 868 ms | 57120 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>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;
using namespace std;
int n,k,z;
multiset<pair<pair<int,int>,int>> s;
vector<pair<pair<int,int>,int>> val;
void solve()
{
cin >> n >> k >> z;
set<int> all;
for(int i=0;i<n;i++)
{
int l,t,r;
cin >> l >> t >> r;
s.insert({{l,l+t-1},0});
s.insert({{l+t,r},1});
all.insert(l-1);
all.insert(l);
all.insert(max(1,l+t-z));
all.insert(l+t-1);
all.insert(l+t);
all.insert(max(1,r-z+1));
all.insert(r);
all.insert(r+1);
}
priority_queue<pair<int,int>> pq;
int cnt = 0;
auto itr = s.begin();
int prv = 0;
for(auto x:all)
{
if(pq.size()>=k) val.pb({{prv,x-1},cnt});
prv = x;
while(itr!=s.end() && (*itr).fir.fir<=x)
{
if((*itr).sec==1) cnt++;
pq.push({-(*itr).fir.sec,(*itr).sec});
itr++;
}
while(!pq.empty() && -pq.top().fir<x)
{
if(pq.top().sec==1) cnt--;
pq.pop();
}
}
ll sum = 0;
ll mxsum = 0;
int ptr2 = -1;
for(int ptr=0;ptr<val.size();ptr++)
{
while(ptr2+1<val.size() && val[ptr2+1].fir.sec<val[ptr].fir.fir+z)
{
ptr2++;
sum += (ll)val[ptr2].sec*(val[ptr2].fir.sec-val[ptr2].fir.fir+1);
}
mxsum = max(mxsum,sum);
sum -= (ll)val[ptr].sec*(val[ptr].fir.sec-val[ptr].fir.fir+1);
}
cout << mxsum << endl;
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tc=1;
//cin>>tc;
for(int i=1;i<=tc;i++) solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |