CSES - Aalto Competitive Programming 2024 - wk7 - Mon - Results
Submission details
Task:3SUM
Sender:joaquimballester
Submission time:2024-10-21 16:48:26 +0300
Language:C++ (C++11)
Status:READY
Result:ACCEPTED
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.01 sdetails
#10ACCEPTED0.08 sdetails
#11ACCEPTED0.08 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.08 sdetails
#14ACCEPTED0.08 sdetails
#15ACCEPTED0.08 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.08 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.08 sdetails
#22ACCEPTED0.08 sdetails
#23ACCEPTED0.00 sdetails

Code

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
	int n, x;
	cin >> n >> x;
	vector<pair<int, int>> v;
	for (int i = 1; i <= n; i++) {
		int a;
		cin >> a;
		pair<int, int> p = make_pair(a,i);
		v.push_back(p);
	}
	sort(begin(v), end(v));
	for (int i = 0; i < n; i++) {
		int l = 0;
		int r = n - 1;
		while (l != r) {
			int obj = x - v.at(i).first;
			if (l != i and r != i and v.at(l).first + 
                v.at(r).first == obj) {
				cout << v.at(i).second << " " << v.at(l).second << " "<< v.at(r).second << endl;
				return 0;
			}
			if (v.at(l).first + v.at(r).first < obj) {
				l++;
			} else {
				r--;
			}
		}
	}
	cout << "IMPOSSIBLE" << endl;

}

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
1 3 2

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 2 7

Test 6

Verdict: ACCEPTED

input
7 4
1 1 2 2 1 2 1

correct output
1 2 6

user output
2 1 6

Test 7

Verdict: ACCEPTED

input
7 5
1 2 1 2 2 1 1

correct output
1 2 5

user output
1 2 5

Test 8

Verdict: ACCEPTED

input
7 6
2 1 1 1 1 2 2

correct output
1 6 7

user output
6 1 7

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 1 5000

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 714 4240

Test 12

Verdict: ACCEPTED

input
5000 919900245
663612758 9075403 585385629 98...

correct output
2787 465 2266

user output
2787 465 2266

Test 13

Verdict: ACCEPTED

input
5000 999989608
12983 25966 38949 51932 64915 ...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 14

Verdict: ACCEPTED

input
5000 1000000000
65536 131072 196608 262144 327...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 15

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 16

Verdict: ACCEPTED

input
5000 919900246
663612758 9075403 585385629 98...

correct output
193 1698 4019

user output
193 1698 4019

Test 17

Verdict: ACCEPTED

input
5000 919900247
663612758 9075403 585385629 98...

correct output
4258 470 1911

user output
4258 470 1911

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
4998 4999 5000

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: ACCEPTED

input
4999 919900245
9075403 585385629 987230075 83...

correct output
2786 464 2265

user output
2786 464 2265

Test 21

Verdict: ACCEPTED

input
5000 1000000000
261323261 25262018 237798562 3...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 22

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 23

Verdict: ACCEPTED

input
2 6
2 2

correct output
IMPOSSIBLE

user output
IMPOSSIBLE