fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-06-04 20:44:52
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-06-05 15:42:22
  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. int n,k,l,r;
  54.  
  55. namespace sub1 {
  56.  
  57. 	bool approved()
  58. 	{
  59. 		return k == 1 or k == n;
  60. 	}
  61.  
  62. 	void solve(void)
  63. 	{
  64. 		cout << (r+l)*(r-l+1)/2;
  65. 	}
  66.  
  67. }
  68.  
  69. namespace sub2 {
  70.  
  71. 	bool approved()
  72. 	{
  73. 		return n <= 1e6;
  74. 	}
  75.  
  76. 	void solve(void)
  77. 	{
  78. 		int ans = 0, cnt = l%k, sub = l%k-1;
  79. 		bool check = ((l/k+(l%k != 0))%2 == 0);
  80. 		// cout << check << " " << sub << endl;
  81. 		FOR(i,l,r)
  82. 		{
  83. 			if (!check) 
  84. 				ans += i, cnt++;
  85. 			else 
  86. 			{
  87. 				// cout << i+k-2*sub-1 << " " << cnt << " " << sub << endl;
  88. 				ans += i+k-2*sub-1;
  89. 				cnt++;
  90. 				sub++;
  91. 			}
  92. 			if (cnt == k+1) 
  93. 			{
  94. 				cnt = 1;
  95. 				check ^= 1;
  96. 				sub = 0;
  97. 			}
  98. 		}
  99. 		cout << ans;
  100. 	}
  101.  
  102. }
  103.  
  104. namespace sub3 {
  105.  
  106. 	int sum(int l, int r) {
  107. 		return (l+r)*(r-l+1)/2;
  108. 	}
  109.  
  110. 	int f(int x)
  111. 	{
  112. 		int div = (x%k == 0?x/k:x/k+1);
  113. 		if (div&1) return sum(1,x);
  114. 		else
  115. 		{
  116. 			int y = x-(div-1)*k;
  117. 			return sum(1,(div-1)*k)+sum(div*k-y+1,div*k);
  118. 		}
  119. 	}
  120.  
  121. 	void solve(void)
  122. 	{
  123. 		cout << f(r)-f(l-1);
  124. 	}
  125.  
  126. }
  127.  
  128. bool M2;
  129. signed main()
  130. {
  131.     fast;
  132.     if (fopen(name".inp","r"))
  133.     {
  134.     	freopen(name".inp","r",stdin);
  135.     	freopen(name".out","w",stdout);
  136.     }
  137.     cin >> n >> k >> l >> r;
  138.     if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  139.     if (sub2::approved()) return sub2::solve(), time(), memory(), 0;
  140.     sub3::solve();
  141.     time();
  142.     memory();
  143.     return 0;
  144. }
  145. // ██░ ██  █    ██  ███▄    █   ▄████
  146. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  147. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  148. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  149. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  150. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  151. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  152. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  153. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 5296KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:5.605ms.
3.8147e-05 MB
https://ideone.com/NSTXhS
language:
C++14 (gcc 8.3)
created:
4 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!