# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092536 | sleepntsheep | A Game with Grundy (CCO20_day1problem1) | C11 | 0 ms | 0 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<stdio.h>
#include<map>
using namespace std;
#define N 100005
int n,l,r,y,cn,f[N];
int main(){
scanf("%d%d%d%d",&n,&l,&r,&y);
map<int,int>e;
for(int x,v,h,i=0;i<n;++i){
scanf("%d%d%d",&x,&v,&h);
int w=(y*h-1)/v;
int st=max(l,x-w),ed=min(r+1,x+w+1);
++e[st],--e[ed];
}
int x0=l;
for(auto[x,ii]:e){
f[cn]+=x-x0;
x0=x;cn+=ii;
}
f[cn]+=r-x0+1;
for(int i=0;i<=n;++i)printf("%d\n",f[i]),f[i+1]+=f[i];
}