fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define dd double
  5. #define ld long double
  6. #define pi 3.14159265359
  7. #define ull unsigned long long
  8. #define yes cout<<"YES\n"
  9. #define no cout<<"NO\n"
  10. #define el "\n"
  11. #define Arwa ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  12. #define fix(x) cout<<fixed<<setprecision(x)
  13. ll gcd(ll a,ll b) {return b==0?a:gcd(b,a%b);}
  14. ll lcm(int a,int b) {return a/gcd(a,b)*b;}
  15. bool prime(ll n)
  16. {
  17. if(n==2) return true;
  18. if(n%2==0||n==1) return false;
  19. else { for(ll i=3; i*i<=n; i+=2) {if(n%i==0) return false;}}return true;
  20. }
  21. //here we go again
  22. int main()
  23. {
  24. Arwa
  25. int t=1;
  26. //cin>>t;
  27. while(t--)
  28. {
  29. int n,k,neg[1000005]={},pos[1000005]={};
  30. ll c=0;
  31. cin>>n>>k;
  32. int arr[n];
  33. for(int i=0;i<n;i++)
  34. cin>>arr[i];
  35. for(int i=0;i<n;i++)
  36. {
  37. if(arr[i]<0)
  38. neg[abs(arr[i])]++;
  39. else pos[arr[i]]++;
  40. }
  41. for(int i=0;i<n;i++)
  42. {
  43. if(arr[i]<0)
  44. {
  45. if(neg[abs(arr[i])])
  46. {
  47. if(k-arr[i]>=0&&k-arr[i]<=1000000)
  48. {
  49. if(pos[k-arr[i]])
  50. {
  51. c+=pos[k-arr[i]];
  52. neg[abs(arr[i])]--;
  53. }
  54. }
  55. if(k-arr[i]<0&&k-arr[i]>=-1000000)
  56. {
  57. if(neg[k-arr[i]])
  58. {
  59. c+=neg[abs(k-arr[i])];
  60. neg[abs(arr[i])]--;
  61. }
  62. }
  63.  
  64. }
  65. }
  66. if(arr[i]>=0)
  67. {
  68. if(pos[arr[i]])
  69. {
  70. if(k-arr[i]>=0&&k-arr[i]<=1000000)
  71. {
  72. if(pos[k-arr[i]])
  73. {
  74. c+=pos[k-arr[i]];
  75. pos[arr[i]]--;
  76. }
  77. }
  78. if(k-arr[i]<0&&k-arr[i]>=-1000000)
  79. {
  80. if(neg[abs(k-arr[i])])
  81. {
  82. c+=neg[abs(k-arr[i])];
  83. pos[arr[i]]--;
  84. }
  85. }
  86. }
  87. }
  88. }
  89. cout<<c<<el;
  90. }
  91. return 0;
  92. }
Success #stdin #stdout 0.01s 11304KB
stdin
Standard input is empty
stdout
0