3SUM

warning: unused imports: `Reverse`, `max`, `min`
 --> input/code.rs:1:16
  |
1 | use std::cmp::{max, min, Reverse};
  |                ^^^  ^^^  ^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused imports: `BTreeMap`, `BinaryHeap`, `HashSet`
 --> input/code.rs:2:24
  |
2 | use std::collections::{BTreeMap, BinaryHeap, HashMap, HashSet};
  |                        ^^^^^^^^  ^^^^^^^^^^           ^^^^^^^

warning: unused import: `std::process::exit`
 --> input/code.rs:4:5
  |
4 | use std::process::exit;
  |     ^^^^^^^^^^^^^^^^^^

warning: 3 warnings emitted

use std::cmp::{max, min, Reverse};
use std::collections::{BTreeMap, BinaryHeap, HashMap, HashSet};
use std::io::{self, Read};
use std::process::exit;

macro_rules! input {
    ($it: expr) => {
        $it.next().unwrap().parse().unwrap()
    };
    ($it: expr, $T: ty) => {
        $it.next().unwrap().parse::<$T>().unwrap()
    };
}
/*
mod classes;
mod homework;

fn main() {
    // println!("{}", "-".repeat(20));
    // classes::c13::task2();
    homework::hw5::task2();
    // println!("{}", "-".repeat(20));
}
// */

use std::hash::{Hasher, BuildHasher};

struct IdentityHasher(usize);

impl Hasher for IdentityHasher {
    fn finish(&self) -> u64 {
        self.0 as u64
    }

    fn write(&mut self, _: &[u8]) {}

    fn write_usize(&mut self, i: usize) {
        self.0 = i;
    }
}

struct IdentityHasherBuilder;

impl BuildHasher for IdentityHasherBuilder {
    type Hasher = IdentityHasher;

    fn build_hasher(&self) -> Self::Hasher {
        IdentityHasher(0)
    }
}



fn main() {
    let mut buf = String::new();
    io::stdin().read_to_string(&mut buf).unwrap();

    let mut it = buf.split_whitespace();

    let (n, x): (usize, usize) = (input!(it), input!(it));

    let v: Vec<usize> = (0..n).map(|_| input!(it)).collect();

    for i in 0..n {
        let mut m: HashMap<usize, (usize, usize), IdentityHasherBuilder> =
            HashMap::with_hasher(IdentityHasherBuilder);
        for j in i+1..n {
            if v[i]+v[j]<x {
                m.insert(x-v[i]-v[j], (i, j));
            }
        }
        for j in i+1..n {
            match m.get(&v[j]) {
                None => {}
                Some(x) => {
                    if x.0 != j && x.1 != j {
                        println!("{} {} {}", x.0+1, x.1+1, j+1);
                        return;
                    }
                }
            }
        }
    }
    println!("IMPOSSIBLE");
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: TIME LIMIT EXCEEDED

Test 22

Verdict: TIME LIMIT EXCEEDED

Test 23

Verdict: ACCEPTED