Submission details
Task:3SUM
Sender:usvafe
Submission time:2025-10-20 17:41:06 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.31 sdetails
#10ACCEPTED0.31 sdetails
#11ACCEPTED0.34 sdetails
#12--details
#13--details
#14--details
#15--details
#16--details
#17--details
#18ACCEPTED0.02 sdetails
#19ACCEPTED0.31 sdetails
#20--details
#21--details
#22--details
#23ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>
using namespace std;

vector<int> aa;
map<int, vector<pair<int, int>>> mm;
set<int> mms;

int main() {
	int n, x;
	cin >> n >> x;
	for (int i=0; i<n; i++) {
		int a;
		cin >> a;
		aa.push_back(a);
		for (int j=0; j<(int)aa.size(); j++) {
			if (j == i || aa[i] + aa[j] >= x) continue;
			mm[(aa[j]+aa[i])].push_back(make_pair(j, i));
			mms.insert(aa[j]+aa[i]);
		}
	}
	for (int i=0; i<(int)aa.size(); i++) {
		int rem = x - aa[i];
		if (!mms.count(rem)) continue;
		for (auto p : mm[rem]) {
			if (i != p.first && i != p.second) { 
				cout << p.first+1 << " " << p.second+1 << " " << i+1 << endl;
				return 0;
				
			}
		}
	}
	
	cout << "IMPOSSIBLE" << endl;
	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1 3
1

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 2

Verdict: ACCEPTED

input
3 5
1 3 2

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 3

Verdict: ACCEPTED

input
3 6
1 3 2

correct output
1 3 2

user output
2 3 1

Test 4

Verdict: ACCEPTED

input
3 7
3 2 1

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 5

Verdict: ACCEPTED

input
7 3
2 1 1 2 2 1 1

correct output
2 3 7

user output
3 6 2

Test 6

Verdict: ACCEPTED

input
7 4
1 1 2 2 1 2 1

correct output
1 2 6

user output
2 3 1

Test 7

Verdict: ACCEPTED

input
7 5
1 2 1 2 2 1 1

correct output
1 2 5

user output
2 4 1

Test 8

Verdict: ACCEPTED

input
7 6
2 1 1 1 1 2 2

correct output
1 6 7

user output
6 7 1

Test 9

Verdict: ACCEPTED

input
5000 3
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1 2 5000

user output
2 3 1

Test 10

Verdict: ACCEPTED

input
5000 4
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 11

Verdict: ACCEPTED

input
5000 6
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
714 3518 4240

user output
3518 4240 714

Test 12

Verdict:

input
5000 919900245
663612758 9075403 585385629 98...

correct output
2787 465 2266

user output
(empty)

Test 13

Verdict:

input
5000 999989608
12983 25966 38949 51932 64915 ...

correct output
IMPOSSIBLE

user output
(empty)

Test 14

Verdict:

input
5000 1000000000
65536 131072 196608 262144 327...

correct output
IMPOSSIBLE

user output
(empty)

Test 15

Verdict:

input
5000 642700000
6427 12854 19281 25708 32135 3...

correct output
IMPOSSIBLE

user output
(empty)

Test 16

Verdict:

input
5000 919900246
663612758 9075403 585385629 98...

correct output
193 1698 4019

user output
(empty)

Test 17

Verdict:

input
5000 919900247
663612758 9075403 585385629 98...

correct output
4258 470 1911

user output
(empty)

Test 18

Verdict: ACCEPTED

input
5000 6
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 ...

correct output
4998 4999 5000

user output
4999 5000 4998

Test 19

Verdict: ACCEPTED

input
5000 919900247
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 20

Verdict:

input
4999 919900245
9075403 585385629 987230075 83...

correct output
2786 464 2265

user output
(empty)

Test 21

Verdict:

input
5000 1000000000
261323261 25262018 237798562 3...

correct output
IMPOSSIBLE

user output
(empty)

Test 22

Verdict:

input
5000 76305003
1 5088 10175 15262 20349 25436...

correct output
IMPOSSIBLE

user output
(empty)

Test 23

Verdict: ACCEPTED

input
2 6
2 2

correct output
IMPOSSIBLE

user output
IMPOSSIBLE