fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28.  
  29. int main(){
  30. #ifndef ONLINE_JUDGE
  31. freopen("input.txt", "r", stdin);
  32. freopen("output.txt", "w", stdout);
  33. #endif
  34. int n, x; cin >> n >> x;
  35. vii a(n);
  36. for(int i = 0; i < n; i++){
  37. cin >> a[i].fi;
  38. a[i].se = i;
  39. }
  40. sort(all(a));
  41. for(int i = 0; i < n - 3; i++){
  42. for(int j = i + 1; j < n - 2; j++){
  43. int l = j + 1, r = n - 1;
  44. int y = x - a[i].fi - a[j].fi;
  45. while(l < r){
  46. int tmp = a[l].fi + a[r].fi;
  47. if(tmp == y){
  48. cout << a[i].se+1 <<" " << a[j].se+1 <<" " << a[l].se+1<<" "<<a[r].se+1<<endl;
  49. return 0;
  50. }
  51. else if(tmp < y){
  52. ++l;
  53. }
  54. else --r;
  55. }
  56. }
  57. }
  58. cout <<"IMPOSSIBLE\n";
  59. return 0;
  60. }
Runtime error #stdin #stdout #stderr 0s 5668KB
stdin
Standard input is empty
stdout
Standard output is empty
stderr
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc