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 ll long long
#define endl "\n"
using namespace std;
const ll N=2009;
int main() {
ll n,k,x;
cin>>n>>k>>x;
ll count[N]={0};
ll ans[N]={0};
for(int i=0;i<n;i++){
ll x,y,z;
cin>>x>>y>>z;
x--;
// y--;
count[x]++;
count[z]--;
ans[min(z+1,x+y)]++;
ans[z]--;
}
for(int i=1;i<N;i++){
count[i]+=count[i-1];
ans[i]+=ans[i-1];
}
ll answer=0;
for(int i=0;i<1009;i++){
ll cou=0;
for(int j=i;j<i+x;j++){
if(count[j]>=k)
cou+=ans[j];
}
answer=max(answer,cou);
}
cout<<answer<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |