fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  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 "investitie"
  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. int numComp, numDay, numQuery, perm[N], nxt[33][N];
  40. ll sum[33][N];
  41.  
  42. ll calcSum(int i, int k) {
  43.     ll ans = 0;
  44.     while(k > 0) {
  45.         int j = __builtin_ctz(k);
  46.         ans += sum[j][i];
  47.         i = nxt[j][i];
  48.         k ^= MASK(j);
  49.     }
  50.     return ans;
  51. }
  52.  
  53. void init(void) {
  54.     cin >> numComp >> numDay;
  55.     FOR(i, 1, numComp) cin >> perm[i];
  56.     cin >> numQuery;
  57. }
  58.  
  59. void process(void) {
  60.     FOR(i, 1, numComp) {
  61.         nxt[0][i] = perm[i];
  62.         sum[0][i] = perm[i];
  63.     }
  64.     FOR(j, 1, 30) FOR(i, 1, numComp) {
  65.         nxt[j][i] = nxt[j - 1][nxt[j - 1][i]];
  66.         sum[j][i] = sum[j - 1][i] + sum[j - 1][nxt[j - 1][i]];
  67.     }
  68.  
  69.     while(numQuery--) {
  70.         int lday, rday, lcomp, rcomp;
  71.         cin >> lday >> rday >> lcomp >> rcomp;
  72.         ll ans = 0;
  73.         FOR(i, lcomp, rcomp) ans += calcSum(i, rday) - calcSum(i, lday - 1);
  74.         cout << ans << '\n';
  75.     }
  76. }
  77.  
  78. int main() {
  79.     ios_base::sync_with_stdio(0);
  80.     cin.tie(0); cout.tie(0);
  81.     if (fopen(task".in", "r")) {
  82.         freopen(task".in", "r", stdin);
  83.         freopen(task".out", "w", stdout);
  84.     }
  85.     int tc = 1;
  86. //    cin >> tc;
  87.     while(tc--) {
  88.         init();
  89.         process();
  90.     }
  91.     return 0;
  92. }
  93.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/YKZQVZ
language:
C++14 (gcc 8.3)
created:
1 day 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!