fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. #define int long long
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebear"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 2e5 + 5;
  39. const int inv6 = 166666668;
  40. int numQuery, total;
  41. int L[2709], H[2709];
  42.  
  43. int C3(int n) {
  44.     return 1LL * n % MOD * (n - 1) % MOD * (n - 2) % MOD * inv6 % MOD;
  45. }
  46.  
  47. int solve(int mask, int sum) {
  48.     REP(i, 4) if (BIT(mask, i)) sum -= H[i] + 1;
  49.     if (sum < 0) return 0;
  50.     return C3(sum + 3);
  51. }
  52.  
  53. void init(void) {
  54.     cin >> numQuery;
  55. }
  56.  
  57. void process(void) {
  58.     while(numQuery--) {
  59.         REP(i, 4) cin >> L[i] >> H[i];
  60.         cin >> total;
  61.         REP(i, 4) {
  62.             total -= L[i];
  63.             H[i] -= L[i];
  64.         }
  65.  
  66.         int ans = 0;
  67.         REP(mask, MASK(4)) ans = (ans + solve(mask, total) * (__builtin_popcount(mask) & 1 ? MOD - 1 : +1) % MOD) % MOD;
  68.         cout << ans << '\n';
  69.     }
  70. }
  71.  
  72. signed main() {
  73.     ios_base::sync_with_stdio(0);
  74.     cin.tie(0); cout.tie(0);
  75.     if (fopen(task".inp", "r")) {
  76.         freopen(task".inp", "r", stdin);
  77.         freopen(task".out", "w", stdout);
  78.     }
  79.     int tc = 1;
  80. //    cin >> tc;
  81.     while(tc--) {
  82.         init();
  83.         process();
  84.     }
  85.     return 0;
  86. }
  87.  
  88.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/PYXhZk
language:
C++14 (gcc 8.3)
created:
13 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!