| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1166560 | monkey133 | A Game with Grundy (CCO20_day1problem1) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
ll n, le, ri, y;
cin >> n >> le >> ri >> y;
vector<ll> pos(n);
vector<pi> slope(n);
map<ll, ll> dx;
for (ll i=0; i<n; ++i)
{
cin >> pos[i] >> slope[i].f >> slope[i].s;
ll l, r;
if ((y * slope[i].s )%slope[i].f == 0) l = pos[i] - (y * slope[i].s )/slope[i].f + 1;
else l = pos[i] - (y * slope[i].s )/slope[i].f;
if ((y * slope[i].s )%slope[i].f == 0) r = pos[i] + (y * slope[i].s )/slope[i].f;
else r = pos[i] + (y * slope[i].s )/slope[i].f +1;
//show2(l,r);
l = max(l, le);
if (l > r) continue;
dx[l]++;
dx[r]--;
}
ll now = le;
vector<ll> ans(n + 1, 0);
ll ps = 0;
dx[r + 1] += 0;
for (auto it = dx.begin(); it!=dx.end(); ++it)
{
//show(it->f);
ll until = min(ri, it->f-1);
if (until < now) break;
ans[ps]+= until-now + 1;
now = until + 1;
ps += it->s;
}
for (ll i=1; i<=n; ++i) ans[i] += ans[i-1];
for (ll i=0; i<=n; ++i) cout << ans[i] << endl;
return 0;
}