fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-11-18 14:22:35
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-11-18 17:33:31
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name ""
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)3e5+10;
  54. int n,q,a[N];
  55.  
  56. struct Query {
  57. 	int l,r,M;
  58. } query[N];
  59.  
  60. namespace sub1 {
  61.  
  62. 	bool approved() {
  63. 		return n <= 3e3 and q <= 3e3;
  64. 	}
  65.  
  66. 	void solve(void)
  67. 	{
  68. 		FOR(i,1,q)
  69. 		{
  70. 			int l = query[i].l, r = query[i].r, M = query[i].M;
  71. 			int ans = 0;
  72. 			FOR(i,l,r) ans += a[i]%M;
  73. 			cout << ans << endl;
  74. 		}
  75. 	}
  76.  
  77. }
  78.  
  79. namespace sub2 {
  80.  
  81. 	const int S = 580;
  82. 	int ans[N],f[S+1],sum;
  83. 	vector<array<int,3>> vec[N];
  84.  
  85. 	/*
  86. 		Tổng i từ l -> r với a[i]%M
  87. 		<-> a[i]-M*[a[i]/M] với phép [] làm tròn xuống
  88. 	*/
  89.  
  90. 	struct FenwickTree {
  91. 		int bit[N];
  92.  
  93. 		void update(int id, int val)
  94. 		{
  95. 			while (id < N)
  96. 			{
  97. 				bit[id] += val;
  98. 				id += (id&(-id));
  99. 			}
  100. 		}
  101.  
  102. 		int get(int id)
  103. 		{
  104. 			if (id <= 0) return 0;
  105. 			int ans = 0;
  106. 			while (id) 
  107. 			{
  108. 				ans += bit[id];
  109. 				id -= (id&(-id));
  110. 			}
  111. 			return ans;
  112. 		}
  113. 	} BIT;
  114.  
  115. 	int calc(int m)
  116. 	{
  117. 		if (m > N-10) return sum;
  118. 		if (m <= S) return f[m];
  119. 		int res = 0, i = 0, j = 0;
  120. 		while (j <= N-10)
  121. 		{
  122. 			int k = j+m;
  123. 			minimize(k,N-9);
  124. 			res -= (BIT.get(k-1)-BIT.get(j-1))*i*m;
  125. 			j = k;
  126. 			i++;
  127. 		}
  128. 		res += sum;
  129. 		return res;
  130. 	}
  131.  
  132. 	void solve(void)
  133. 	{
  134. 		FOR(i,1,q)
  135. 		{
  136. 			int l = query[i].l, r = query[i].r, M = query[i].M;
  137. 			vec[r].pb({M,i,1});
  138. 			vec[l-1].pb({M,i,-1});
  139. 		}
  140. 		sum = 0;
  141. 		FOR(i,1,n)
  142. 		{
  143. 			sum += a[i];
  144. 			FOR(j,1,S) f[j] += a[i]%j;
  145. 			BIT.update(a[i],1);
  146. 			for (auto [m,id,delta] : vec[i])
  147. 				ans[id] += delta*calc(m);
  148. 		}
  149. 		FOR(i,1,q) cout << ans[i] << endl;
  150. 	}
  151.  
  152. }
  153.  
  154. bool M2;
  155. signed main()
  156. {
  157.     fast;
  158.     if (fopen(name".inp","r"))
  159.     {
  160.     	freopen(name".inp","r",stdin);
  161.     	freopen(name".out","w",stdout);
  162.     }
  163.     cin >> n >> q;
  164.     FOR(i,1,n) cin >> a[i];
  165.     FOR(i,1,q) 
  166.     {
  167.     	cin >> query[i].l >> query[i].r >> query[i].M;
  168.     	query[i].l++; query[i].r++;
  169.     }
  170.     // if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  171.     sub2::solve();
  172.     time();
  173.     memory();
  174.     return 0;
  175. }
  176. // ██░ ██  █    ██  ███▄    █   ▄████
  177. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  178. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  179. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  180. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  181. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  182. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  183. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  184. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 14100KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:7.176ms.
20.6046 MB
https://ideone.com/5UVDjH
language:
C++14 (gcc 8.3)
created:
6 days 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!