| Task: | 3SUM |
| Sender: | duongha |
| Submission time: | 2025-10-20 16:37:47 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | ACCEPTED |
| 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 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.37 s | details |
| #11 | ACCEPTED | 0.37 s | details |
| #12 | ACCEPTED | 0.01 s | details |
| #13 | ACCEPTED | 0.38 s | details |
| #14 | ACCEPTED | 0.37 s | details |
| #15 | ACCEPTED | 0.37 s | details |
| #16 | ACCEPTED | 0.01 s | details |
| #17 | ACCEPTED | 0.03 s | details |
| #18 | ACCEPTED | 0.00 s | details |
| #19 | ACCEPTED | 0.37 s | details |
| #20 | ACCEPTED | 0.01 s | details |
| #21 | ACCEPTED | 0.38 s | details |
| #22 | ACCEPTED | 0.37 s | details |
| #23 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp: In function 'void solve()':
input/code.cpp:64:33: warning: 'tem3' may be used uninitialized in this function [-Wmaybe-uninitialized]
64 | } else if (cp[i] == tem3 and count3 == 0) {
| ^~~~
input/code.cpp:61:33: warning: 'tem2' may be used uninitialized in this function [-Wmaybe-uninitialized]
61 | } else if (cp[i] == tem2 and count2 == 0) {
| ^~~~
input/code.cpp:58:26: warning: 'tem1' may be used uninitialized in this function [-Wmaybe-uninitialized]
58 | if (cp[i] == tem1 and count1 == 0) {
| ^~~~Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int MAXN = 5e3 + 1;
const int U = 20;
ll a[MAXN];
ll n, target;
bool ok = false;
void solve() {
cin >> n >> target;
for (int i = 1; i <= n; i++) cin >> a[i];
vector<ll> cp;
for (int i = 1; i <= n; i++) {
cp.push_back(a[i]);
}
sort(a + 1, a + 1 + n);
int tem1, tem2, tem3;
for (int i = 1; i < n - 1; i++) {
if(ok) break;
for (int j = i + 1; j < n; j++) {
if(ok) break;
ll l = j + 1;
ll r = n;
while (l <= r) {
if(ok) break;
ll mid = (l + r) / 2;
if (a[i] + a[j] + a[mid] == target) {
// cout << i << ' ' << j << ' ' << mid;
// return;
tem1 = a[i];
tem2 = a[j];
tem3 = a[mid];
ok = true;
} else if (a[i] + a[j] + a[mid] > target) {
r = mid - 1;
} else {
l = mid + 1;
}
}
}
}
if (!ok) {
cout << "IMPOSSIBLE";
} else {
int count1 = 0, count2 = 0, count3 = 0;
for (int i = 0; i < n; i++) {
if (cp[i] == tem1 and count1 == 0) {
cout << i + 1 << ' ';
count1++;
} else if (cp[i] == tem2 and count2 == 0) {
cout << i + 1 << ' ';
count2++;
} else if (cp[i] == tem3 and count3 == 0) {
cout << i + 1 << ' ';
count3++;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
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 |
|---|
| 1 2 3 |
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 |
|---|
| 2 3 6 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 7 4 1 1 2 2 1 2 1 |
| correct output |
|---|
| 1 2 6 |
| user output |
|---|
| 1 2 3 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 7 5 1 2 1 2 2 1 1 |
| correct output |
|---|
| 1 2 5 |
| user output |
|---|
| 1 2 4 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 7 6 2 1 1 1 1 2 2 |
| correct output |
|---|
| 1 6 7 |
| user output |
|---|
| 1 6 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 |
|---|
| 1 2 3 |
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 |
|---|
| 714 3518 4240 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 5000 919900245 663612758 9075403 585385629 98... |
| correct output |
|---|
| 2787 465 2266 |
| user output |
|---|
| 465 2266 2787 |
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 |
|---|
| 470 1911 4258 |
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 |
|---|
| 464 2265 2786 |
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 |
