Submission details
Task:3SUM
Sender:aalto26gm_040
Submission time:2026-10-19 17:00:59 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#3ACCEPTED0.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.01 sdetails
#120.40 sdetails
#130.40 sdetails
#140.40 sdetails
#150.40 sdetails
#160.40 sdetails
#170.40 sdetails
#180.01 sdetails
#190.40 sdetails
#200.40 sdetails
#210.40 sdetails
#220.40 sdetails
#230.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:28:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for (int l = 0; l < coins_values.size(); ++l)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int l = 0; l < coins_values.size(); ++l)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
#include <cmath>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n_target, n_coins;
    cin >> n_coins >> n_target;

    vector<pair<int, vector<int>>> storage(n_target + 1, {-1, {}});
    vector<int> coins_values;
    storage[0].first = 0;

    for(int i = 0; i < n_coins; ++i)
    {
        int temp;
        cin >> temp;
        coins_values.push_back(temp);
        if(temp <= n_target)
            storage[temp].first = 1, storage[temp].second.push_back(i + 1);
    }
    
    for (int i = 1; i <= n_target - 1; ++i)
    {
        for (int l = 0; l < coins_values.size(); ++l)
        {
            int c = coins_values[l];
            if (i-c >= 0 && storage[i-c].first != -1)
            {
                if(storage[i].first == -1)
                {
                    storage[i].first = storage[i-c].first + 1;
                    storage[i].second = storage[i-c].second;
                    storage[i].second.push_back(l + 1);
                }
                else
                {
                    if(storage[i-c].first + 1 < storage[i].first)
                    {
                        storage[i].first = storage[i-c].first + 1;
                        storage[i].second = storage[i-c].second;
                        storage[i].second.push_back(l + 1);
                    }
                }
            }
        }
    }
    for (int l = 0; l < coins_values.size(); ++l)
    {
        int c = coins_values[l];
        if (n_target-c >= 0 && storage[n_target-c].first != -1)
        {
            if(storage[n_target].first == -1 && storage[n_target-c].first + 1 >= 3)
            {
                storage[n_target].first = storage[n_target-c].first + 1;
                storage[n_target].second = storage[n_target-c].second;
                storage[n_target].second.push_back(l + 1);
            }
            else
            {
                if(storage[n_target-c].first + 1 < storage[n_target].first && storage[n_target-c].first + 1 >= 3)
                {
                    storage[n_target].first = storage[n_target-c].first + 1;
                    storage[n_target].second = storage[n_target-c].second;
                    storage[n_target].second.push_back(l + 1);
                }
            }
        }
    }

    if(storage[n_target].first == 3)
    {
        for(auto val : storage[n_target].second)
            cout << val << " ";
    }
    else
        cout << "IMPOSSIBLE" << endl;
}

Test details

Test 1

Verdict:

input
1 3
1

correct output
IMPOSSIBLE

user output
1 1 1 

Test 2

Verdict:

input
3 5
1 3 2

correct output
IMPOSSIBLE

user output
2 1 1 

Test 3

Verdict: ACCEPTED

input
3 6
1 3 2

correct output
1 3 2

user output
3 2 1 

Test 4

Verdict:

input
3 7
3 2 1

correct output
IMPOSSIBLE

user output
3 1 1 

Test 5

Verdict:

input
7 3
2 1 1 2 2 1 1

correct output
2 3 7

user output
IMPOSSIBLE

Test 6

Verdict:

input
7 4
1 1 2 2 1 2 1

correct output
1 2 6

user output
3 4 6 1 1 

Test 7

Verdict:

input
7 5
1 2 1 2 2 1 1

correct output
1 2 5

user output
2 4 5 2 1 

Test 8

Verdict: ACCEPTED

input
7 6
2 1 1 1 1 2 2

correct output
1 6 7

user output
1 6 7 1 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
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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 714 714 

Test 12

Verdict:

input
5000 919900245
663612758 9075403 585385629 98...

correct output
2787 465 2266

user output
(empty)

Test 13

Verdict:

input
5000 999989608
12983 25966 38949 51932 64915 ...

correct output
IMPOSSIBLE

user output
(empty)

Test 14

Verdict:

input
5000 1000000000
65536 131072 196608 262144 327...

correct output
IMPOSSIBLE

user output
(empty)

Test 15

Verdict:

input
5000 642700000
6427 12854 19281 25708 32135 3...

correct output
IMPOSSIBLE

user output
(empty)

Test 16

Verdict:

input
5000 919900246
663612758 9075403 585385629 98...

correct output
193 1698 4019

user output
(empty)

Test 17

Verdict:

input
5000 919900247
663612758 9075403 585385629 98...

correct output
4258 470 1911

user output
(empty)

Test 18

Verdict:

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
IMPOSSIBLE

Test 19

Verdict:

input
5000 919900247
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
IMPOSSIBLE

user output
(empty)

Test 20

Verdict:

input
4999 919900245
9075403 585385629 987230075 83...

correct output
2786 464 2265

user output
(empty)

Test 21

Verdict:

input
5000 1000000000
261323261 25262018 237798562 3...

correct output
IMPOSSIBLE

user output
(empty)

Test 22

Verdict:

input
5000 76305003
1 5088 10175 15262 20349 25436...

correct output
IMPOSSIBLE

user output
(empty)

Test 23

Verdict:

input
2 6
2 2

correct output
IMPOSSIBLE

user output
1 2 1 1