CSES - Aalto Competitive Programming 2026 - wk7 - Mon

Submission details
Task:	3SUM
Sender:	aalto26gm_046
Submission time:	2026-10-19 16:26:24 +0300
Language:	C++ (C++20)
Status:	READY
Result:	TIME LIMIT EXCEEDED

Test results
test	verdict	time
#1	ACCEPTED	0.01 s	details
#2	ACCEPTED	0.01 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.35 s	details
#11	ACCEPTED	0.10 s	details
#12	ACCEPTED	0.20 s	details
#13	TIME LIMIT EXCEEDED	--	details
#14	TIME LIMIT EXCEEDED	--	details
#15	TIME LIMIT EXCEEDED	--	details
#16	ACCEPTED	0.06 s	details
#17	ACCEPTED	0.05 s	details
#18	ACCEPTED	0.35 s	details
#19	ACCEPTED	0.35 s	details
#20	ACCEPTED	0.20 s	details
#21	TIME LIMIT EXCEEDED	--	details
#22	TIME LIMIT EXCEEDED	--	details
#23	ACCEPTED	0.00 s	details

Code

#include<bits/stdc++.h>
//#include<unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define FI first
#define SE second
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef map<int,int> mpi;
typedef set<int> sti;
typedef vector<pii> vii;
typedef map<pii,int> mpii;
typedef set<pii> stii;
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int power(int x, int y) { return (!y ? 1 : power(x, y / 2) * power(x, y / 2) * (y % 2 ? x : 1)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
int fastMax(int x, int y) { return (((y-x)>>(32-1))&(x^y))^y; }
int fastMin(int x, int y) { return (((y-x)>>(32-1))&(x^y))^x; }
const int MAXN=2e5+30,MAX_LOG=30,MOD=1e9+7,INF=1e17;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }

int n, m, q;
// vi g[MAXN];
// int visited[MAXN];
// int cap[515][515];

// int dfs(int v, int flow){
//     if(v == n){
//         return flow;
//     }
//     visited[v] = 1;
//     for(int u:g[v]){
//         if(!visited[u] && cap[v][u] > 0){
//             int pushed = dfs(u, min(flow, cap[v][u]));
//             if(pushed > 0){
//                 cap[v][u] -= pushed;
//                 cap[u][v] += pushed;
//                 return pushed;
//             }
//         }
//     }

//     return 0;
// }
int a[MAXN];

int MAIN(){
    int target;
    cin>>n>>target;
    for (int i = 0; i < n; i++){
        cin>>a[i];
    }

    for(int i = 0; i < n- 2; i++){
        unordered_map<int, int> poss;
        poss.reserve(n- i);
        for(int j = i + 1; j < n; j++){
            int need = target - a[i] - a[j];
            if(poss.find(need) != poss.end()){
                cout<<i + 1<<' '<<poss[need]+1<<' '<<j + 1<<endl;
                return 0;
            }
            poss[a[j]] = j;
        }
    }

    cout<<"IMPOSSIBLE"<<endl;

    return 0;
}

int32_t main(){
    IOS;
    int t=1;
    //cin>>t;
    while(t--)MAIN();
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 3 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 2

Verdict: ACCEPTED

input
`3 5 1 3 2` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 3

Verdict: ACCEPTED

input
`3 6 1 3 2` view save

correct output
`1 3 2` view save

user output
`1 2 3` view save

Test 4

Verdict: ACCEPTED

input
`3 7 3 2 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 5

Verdict: ACCEPTED

input
`7 3 2 1 1 2 2 1 1` view save

correct output
`2 3 7` view save

user output
`2 3 6` view save

Test 6

Verdict: ACCEPTED

input
`7 4 1 1 2 2 1 2 1` view save

correct output
`1 2 6` view save

user output
`1 2 3` view save

Test 7

Verdict: ACCEPTED

input
`7 5 1 2 1 2 2 1 1` view save

correct output
`1 2 5` view save

user output
`1 2 4` view save

Test 8

Verdict: ACCEPTED

input
`7 6 2 1 1 1 1 2 2` view save

correct output
`1 6 7` view save

user output
`1 6 7` view save

Test 9

Verdict: ACCEPTED

input
`5000 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1 2 5000` view save

user output
`1 2 3` view save

Test 10

Verdict: ACCEPTED

input
`5000 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 11

Verdict: ACCEPTED

input
`5000 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`714 3518 4240` view save

user output
`714 3518 4240` view save

Test 12

Verdict: ACCEPTED

input
`5000 919900245 663612758 9075403 585385629 98...` view save

correct output
`2787 465 2266` view save

user output
`295 2481 2507` view save

Test 13

Verdict: TIME LIMIT EXCEEDED

input
`5000 999989608 12983 25966 38949 51932 64915 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 14

Verdict: TIME LIMIT EXCEEDED

input
`5000 1000000000 65536 131072 196608 262144 327...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 15

Verdict: TIME LIMIT EXCEEDED

input
`5000 642700000 6427 12854 19281 25708 32135 3...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 16

Verdict: ACCEPTED

input
`5000 919900246 663612758 9075403 585385629 98...` view save

correct output
`193 1698 4019` view save

user output
`76 2564 3319` view save

Test 17

Verdict: ACCEPTED

input
`5000 919900247 663612758 9075403 585385629 98...` view save

correct output
`4258 470 1911` view save

user output
`71 432 4858` view save

Test 18

Verdict: ACCEPTED

input
`5000 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 ...` view save

correct output
`4998 4999 5000` view save

user output
`4998 4999 5000` view save

Test 19

Verdict: ACCEPTED

input
`5000 919900247 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 20

Verdict: ACCEPTED

input
`4999 919900245 9075403 585385629 987230075 83...` view save

correct output
`2786 464 2265` view save

user output
`294 2480 2506` view save

Test 21

Verdict: TIME LIMIT EXCEEDED

input
`5000 1000000000 261323261 25262018 237798562 3...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 22

Verdict: TIME LIMIT EXCEEDED

input
`5000 76305003 1 5088 10175 15262 20349 25436...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 23

Verdict: ACCEPTED

input
`2 6 2 2` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Aalto Competitive Programming 2026 - wk7 - Mon

3SUM

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Tasks

Submissions (aalto26gm_046)