-
Notifications
You must be signed in to change notification settings - Fork 1
/
1642.cpp
50 lines (50 loc) · 1.12 KB
/
1642.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
void solve() {
int n, m;
cin >> n >> m;
vector<pair<int,int>>v;
f(n) {
int x;
cin >> x;
v.pb({x,i + 1});
}
sort(all(v));
for (int i = 0 ; i < n ; i++) {
for (int j = i + 1 ; j < n ; j++) {
int l = j + 1, r = n - 1;
ll tar = m - v[i].F - v[j].F;
while (r > l) {
if (v[l].F + v[r].F > tar) {
r--;
}
else if (v[l].F + v[r].F < tar) {
l++;
}
else {
cout << v[i].S <<' '<<v[l].S<<' '<<v[r].S<<' '<<v[j].S<<endl;
exit(0);
}
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
while (t--) {
solve();
}
cout << "IMPOSSIBLE\n";
}