fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. vector<int> consistency(int n, int k){
  33.  
  34. unordered_map<int, int> mp;
  35. for(int i=0; i<n; i++){
  36. if(mp.count(k-a[i])){
  37. int j = mp[k-a[i]];
  38.  
  39. return {j, i};
  40. }
  41. mp[a[i]] = i;
  42. }
  43. return {-1, -1};
  44. }
  45.  
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60. vector<int> practice(int n, int k){
  61.  
  62.  
  63. }
  64.  
  65.  
  66.  
  67.  
  68.  
  69. void solve() {
  70.  
  71. int n, k;
  72. cin>> n >> k;
  73.  
  74. a.resize(n);
  75. for(int i=0; i<n; i++) cin >> a[i];
  76.  
  77. auto ans = consistency(n, k);
  78.  
  79. cout << ans[0] << " " << ans[1] << endl;
  80.  
  81.  
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88. int32_t main() {
  89. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  90.  
  91. int t = 1;
  92. // cin >> t;
  93. while (t--) {
  94. solve();
  95. }
  96.  
  97. return 0;
  98. }
Success #stdin #stdout 0.01s 5316KB
stdin
4 9
2 7 11 15 
stdout
0 1