| Task: | 3SUM |
| Sender: | aalto26gm_047 |
| Submission time: | 2026-10-19 21:59:32 +0300 |
| Language: | Rust (2021) |
| 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 | WRONG ANSWER | 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.16 s | details |
| #11 | ACCEPTED | 0.15 s | details |
| #12 | ACCEPTED | 0.01 s | details |
| #13 | ACCEPTED | 0.15 s | details |
| #14 | ACCEPTED | 0.16 s | details |
| #15 | ACCEPTED | 0.15 s | details |
| #16 | ACCEPTED | 0.01 s | details |
| #17 | ACCEPTED | 0.01 s | details |
| #18 | ACCEPTED | 0.00 s | details |
| #19 | ACCEPTED | 0.15 s | details |
| #20 | ACCEPTED | 0.01 s | details |
| #21 | ACCEPTED | 0.15 s | details |
| #22 | ACCEPTED | 0.15 s | details |
| #23 | ACCEPTED | 0.00 s | details |
Code
#![allow(unused)]
use std::io;
fn take_tuple() -> (usize, usize) {
let mut input = String::new();
io::stdin().read_line(&mut input).unwrap();
let mut it = input
.trim()
.split_whitespace()
.map(|x| x.parse::<usize>().unwrap());
(it.next().unwrap(), it.next().unwrap())
}
fn take_vector() -> Vec<(usize, usize)> {
let mut input = String::new();
io::stdin().read_line(&mut input).unwrap();
let arr: Vec<(usize, usize)> = input
.trim()
.split_whitespace()
.map(|x| x.parse::<usize>().unwrap())
.enumerate()
.collect();
return arr;
}
fn main() {
let (n, x): (usize, usize) = take_tuple();
if n < 3 {
println!("IMPOSSIBLE");
return;
}
let mut arr: Vec<(usize, usize)> = take_vector();
let mut p1 = 0;
let mut p2 = n - 1;
let mut p3 = 1;
arr.sort_unstable_by_key(|(_, v)| *v);
let mut sum = arr[p1].1 + arr[p2].1 + arr[p3].1;
while sum != x {
if sum < x {
p1 += 1;
} else {
if p2 > 0 {
p2 -= 1;
}
}
if p1 >= p2 {
p3 += 1;
if p3 == n {
println!("IMPOSSIBLE");
return;
}
p1 = 0;
p2 = n - 1;
sum = arr[p1].1 + arr[p2].1 + arr[p3].1;
continue;
}
if p1 == p3 {
p1 += 1;
}
if p2 == p3 {
p2 -= 1;
}
sum = arr[p1].1 + arr[p2].1 + arr[p3].1;
}
println!("{} {} {}", arr[p1].0 + 1, arr[p3].0 + 1, arr[p2].0 + 1)
}
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: WRONG ANSWER
| input |
|---|
| 3 7 3 2 1 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| 3 1 1 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 7 3 2 1 1 2 2 1 1 |
| correct output |
|---|
| 2 3 7 |
| user output |
|---|
| 2 3 7 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 7 4 1 1 2 2 1 2 1 |
| correct output |
|---|
| 1 2 6 |
| user output |
|---|
| 1 2 6 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 7 5 1 2 1 2 2 1 1 |
| correct output |
|---|
| 1 2 5 |
| user output |
|---|
| 2 3 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 |
|---|
| 1 2 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 4240 714 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 5000 919900245 663612758 9075403 585385629 98... |
| correct output |
|---|
| 2787 465 2266 |
| user output |
|---|
| 465 2787 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 |
|---|
| 1698 193 4019 |
Test 17
Verdict: ACCEPTED
| input |
|---|
| 5000 919900247 663612758 9075403 585385629 98... |
| correct output |
|---|
| 4258 470 1911 |
| user output |
|---|
| 470 4258 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 |
|---|
| 464 2786 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 |
