| Task: | 3SUM |
| Sender: | aalto26gm_025 |
| Submission time: | 2026-10-19 17:26:38 +0300 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | WRONG ANSWER | 0.00 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.25 s | details |
| #11 | WRONG ANSWER | 0.25 s | details |
| #12 | WRONG ANSWER | 0.11 s | details |
| #13 | ACCEPTED | 0.25 s | details |
| #14 | ACCEPTED | 0.25 s | details |
| #15 | ACCEPTED | 0.25 s | details |
| #16 | WRONG ANSWER | 0.10 s | details |
| #17 | WRONG ANSWER | 0.10 s | details |
| #18 | ACCEPTED | 0.02 s | details |
| #19 | ACCEPTED | 0.25 s | details |
| #20 | WRONG ANSWER | 0.10 s | details |
| #21 | ACCEPTED | 0.25 s | details |
| #22 | ACCEPTED | 0.25 s | details |
| #23 | ACCEPTED | 0.00 s | details |
Code
#include <algorithm>
#include <iostream>
#include <vector>
#include <climits>
#include <cstdint>
using namespace std;
#define DEBUG std::cout<<"LINE"<<__LINE__;
#define IN(A) int A;std::cin>>A;
template<typename T> void printV(vector<T> V) {
for (int i=0;i<V.size()-1;i++) {
cout<<V[i]<<" ";
}
cout<<V[V.size()-1];
cout<<endl;
}
int64_t max3(int64_t a,int64_t b,int64_t c) {
return max(a,max(b,c));
}
struct compute {
int tests=1;
vector<pair<int,int>> data;
vector<bool> visited;
bool start() {
IN(n);
IN(x);
data.assign(n,{});
readV(n);
std::sort(data.begin(),data.end());
for (int i=data.size()-1;i>1;i--) {
for (int j=i-1;j>0;j--) {
int a=0;
int b=j-1;
int v=x-data[i].first-data[j].first;
if (v<1) continue;
while (a<=b) {
int k=(a+b)/2;
if (data[k].first==v) {
cout<<data[i].second<<" "<<data[j].second<<" "<<data[k].second<<endl;
return true;
}
if (data[k].first>v) {
a=k+1;
} else {
b=k-1;
}
}
}
}
cout<<"IMPOSSIBLE"<<endl;
return true;
}
void readV(int n) {
for (int i=0;i<n;i++) {
cin>>data[i].first;
data[i].second=i+1;
}
}
void testloop(){
while (tests-->0) {
start();
}
}
};
int main() {
compute comp;
comp.start();
}
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 |
|---|
| 7 6 2 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 7 4 1 1 2 2 1 2 1 |
| correct output |
|---|
| 1 2 6 |
| user output |
|---|
| 6 7 2 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 7 5 1 2 1 2 2 1 1 |
| correct output |
|---|
| 1 2 5 |
| user output |
|---|
| 5 4 6 |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 7 6 2 1 1 1 1 2 2 |
| correct output |
|---|
| 1 6 7 |
| user output |
|---|
| IMPOSSIBLE |
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 |
|---|
| 5000 4999 2499 |
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: WRONG ANSWER
| 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 |
|---|
| IMPOSSIBLE |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 5000 919900245 663612758 9075403 585385629 98... |
| correct output |
|---|
| 2787 465 2266 |
| user output |
|---|
| IMPOSSIBLE |
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: WRONG ANSWER
| input |
|---|
| 5000 919900246 663612758 9075403 585385629 98... |
| correct output |
|---|
| 193 1698 4019 |
| user output |
|---|
| IMPOSSIBLE |
Test 17
Verdict: WRONG ANSWER
| input |
|---|
| 5000 919900247 663612758 9075403 585385629 98... |
| correct output |
|---|
| 4258 470 1911 |
| user output |
|---|
| IMPOSSIBLE |
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 |
|---|
| 5000 4999 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: WRONG ANSWER
| input |
|---|
| 4999 919900245 9075403 585385629 987230075 83... |
| correct output |
|---|
| 2786 464 2265 |
| user output |
|---|
| IMPOSSIBLE |
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 |
