| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 893375 | 1075508020060209tc | A Game with Grundy (CCO20_day1problem1) | C++14 | 69 ms | 6596 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.
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
//#define Y second
vector<pair<int,int>>event;
int n;int L;int R;int Y;
int ans[500005];
void init(){
cin>>n;
cin>>L>>R>>Y;
for(int i=1;i<=n;i++){
    int a;int p;int q;
    cin>>a>>p>>q;
    int r=(Y+p*a/q)*q/p;
    r=Y*q/p+a;
    int l=(Y-p*a/q)*(-q)/p;
    l=Y*(-q)/p+a;
    if((Y*q)%p==0){r--;l++;}
    l=max(l,L);
    r=min(r,R);
    if(r>=l){
        event.push_back({l,1});
        event.push_back({r+1,-1});
    }
  //  cout<<l<<" "<<r<<"\n";
}
sort(event.begin(),event.end());
int tot=0;
int lst=L;
tot+=event[0].second;
for(int i=1;i<event.size();i++){
    ans[tot]+=event[i].first-event[i-1].first;
    tot+=event[i].second;
}
tot=R-L+1;
for(int i=1;i<=n;i++){
    tot-=ans[i];
    ans[i]+=ans[i-1];
}
for(int i=0;i<=n;i++){
    ans[i]+=tot;
    cout<<ans[i]<<"\n";
}
}
signed main(){
init();
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
