結果
| 問題 | No.2359 A in S ? |
| ユーザー |
 otera
|
| 提出日時 | 2023-06-24 16:09:02 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 363 ms / 2,000 ms |
| コード長 | 6,286 bytes |
| コンパイル時間 | 1,970 ms |
| コンパイル使用メモリ | 200,612 KB |
| 最終ジャッジ日時 | 2025-02-15 02:04:36 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 18 |
ソースコード
/*** author: otera**/#include<bits/stdc++.h>namespace otera {}using namespace std;using namespace otera;struct io_setup {io_setup(int precision = 20) {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(precision);}} io_setup_ {};#define int long longusing ll = long long;using ld = long double;using ull = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;#define repa(i, n) for(int i = 0; i < (n); ++ i)#define repb(i, a, b) for(int i = (a); i < (b); ++ i)#define repc(i, a, b, c) for(int i = (a); i < (b); i += (c))#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)#define rep1a(i, n) for(int i = 0; i <= (n); ++ i)#define rep1b(i, a, b) for(int i = (a); i <= (b); ++ i)#define rep1c(i, a, b, c) for(int i = (a); i <= (b); i += (c))#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)#define rev_repa(i, n) for(int i=(n)-1;i>=0;i--)#define rev_repb(i, a, b) assert((a) > (b));for(int i=(a);i>(b);i--)#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)#define rev_rep1a(i, n) for(int i=(n);i>=1;i--)#define rev_rep1b(i, a, b) assert((a) >= (b));for(int i=(a);i>=(b);i--)#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)#define for_subset(t, s) for(ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))typedef pair<int, int> P;typedef pair<ll, ll> LP;#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define mkp make_pair#define mkt make_tuple#define fr first#define sc second#define all(c) std::begin(c), std::end(c)#define rall(c) std::rbegin(c), std::rend(c)#define lb(c, x) distance(std::begin(c), lower_bound(all(c), (x)))#define ub(c, x) distance(std::begin(c), upper_bound(all(c), (x)))#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));(a).erase(unique(all(a)),std::end(a))#define si(c) (int)(c).size()inline ll popcnt(ull a){ return __builtin_popcountll(a); }#define kth_bit(x, k) ((x>>k)&1)#define unless(A) if(!(A))#define elif else ifll modulo(ll n, ll d){ return (n % d + d) % d; };ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template <class T, class U> using umap = unordered_map<T, U>;template<class T> void scan(T& a){ cin >> a; }template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ cout << ' '; }template<class T> void print(const T& a){ cout << a; }template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }int out(){ cout << '\n'; return 0; }template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x#define debug_1(x1) cout<<#x1<<": "<<x1<<endl#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl#ifdef DEBUG#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...)#define dump(...)#endifconst int K = 400;const int M = 100100;void solve() {INT(n, m);vc<int> l(n), r(n), x(n), y(n);vc<int> cnt(M, 0);vvc<int> check(K, vc<int>(M, 0));rep(i, n) {in(l[i], r[i], x[i], y[i]);int mi = l[i] + (l[i] % x[i] <= y[i] ? y[i] - l[i] % x[i] : y[i] - l[i] % x[i] + x[i]);if(x[i] >= K) {for(int c = mi; c <= r[i]; c += x[i]) {cnt[c] ++;}} else {int ma = r[i] + (r[i] % x[i] <= y[i] ? y[i] - r[i] % x[i] : y[i] - r[i] % x[i] + x[i]) + (r[i] % x[i] == y[i] ? x[i] : 0);check[x[i]][mi] ++;if(ma < M) check[x[i]][ma] --;}}rep(i, K) {rep(j, i, M) {check[i][j] += check[i][j - i];}rep(j, M) {cnt[j] += check[i][j];}}rep(_, m) {INT(a);out(cnt[a]);}}signed main() {int testcase = 1;// in(testcase);while(testcase--) solve();return 0;}