Submission details
Task:3SUM
Sender:aalto26gm_010
Submission time:2026-10-19 16:34:56 +0300
Language:C++ (C++20)
Status:READY
Result:
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.21 sdetails
#110.21 sdetails
#120.21 sdetails
#13ACCEPTED0.22 sdetails
#14ACCEPTED0.22 sdetails
#15ACCEPTED0.21 sdetails
#160.22 sdetails
#170.22 sdetails
#18ACCEPTED0.21 sdetails
#19ACCEPTED0.21 sdetails
#200.21 sdetails
#21ACCEPTED0.22 sdetails
#22ACCEPTED0.21 sdetails
#23ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'std::vector<int> find_summmands(std::vector<long unsigned int>&, uint64_t, int, int)':
input/code.cpp:6:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     if (pos == numbers.size()) return {};
      |         ~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:11:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 |     if (summands.size() == count-1) {
      |         ~~~~~~~~~~~~~~~~^~~~~~~~~~
input/code.cpp:16:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |     if (summands.size() == count) {
      |         ~~~~~~~~~~~~~~~~^~~~~~~~

Code

#include <iostream>
#include <vector>
#include <cstdint>

std::vector<int> find_summmands(std::vector<uint64_t> &numbers, uint64_t goal, int count, int pos) {
    if (pos == numbers.size()) return {};
    if (count == 1 && numbers[pos] == goal) return {pos+1};
    if (count == 1 && numbers[pos] != goal) return {};

    auto summands = find_summmands(numbers, goal-numbers[pos], count-1, pos+1);
    if (summands.size() == count-1) {
        summands.push_back(pos+1);
        return summands;
    }
    summands = find_summmands(numbers, goal, count, pos+1);
    if (summands.size() == count) {
        return summands;
    }
    return {};
}

int main() {
    int n;
    uint64_t x;
    std::cin >> n >> x;

    std::vector<uint64_t> numbers(n);
    for (auto &number : numbers) {
        std::cin >> number;
    }

    auto summands = find_summmands(numbers, x, 3, 0);
    if (summands.size() == 0) {
        std::cout << "IMPOSSIBLE" << std::endl;
        return 0;
    }
    for (auto summand : summands) {
        std::cout << summand << " ";
    }
}

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

Test 7

Verdict: ACCEPTED

input
7 5
1 2 1 2 2 1 1

correct output
1 2 5

user output
5 4 1 

Test 8

Verdict: ACCEPTED

input
7 6
2 1 1 1 1 2 2

correct output
1 6 7

user output
7 6 1 

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

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:

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:

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:

input
5000 919900246
663612758 9075403 585385629 98...

correct output
193 1698 4019

user output
IMPOSSIBLE

Test 17

Verdict:

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:

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