CSES - Aalto Competitive Programming 2026 - wk2 - Wed

Submission details
Task:	LibBot
Sender:	aalto26bw_008
Submission time:	2026-09-09 16:45:35 +0300
Language:	C++ (C++20)
Status:	READY
Result:	WRONG ANSWER

Test results
test	verdict	time
#1	WRONG ANSWER	0.01 s	details
#2	ACCEPTED	0.01 s	details
#3	WRONG ANSWER	0.01 s	details
#4	WRONG ANSWER	0.01 s	details
#5	WRONG ANSWER	0.01 s	details
#6	ACCEPTED	0.01 s	details
#7	WRONG ANSWER	0.01 s	details
#8	ACCEPTED	0.01 s	details
#9	WRONG ANSWER	0.01 s	details
#10	ACCEPTED	0.01 s	details
#11	WRONG ANSWER	0.01 s	details
#12	ACCEPTED	0.01 s	details
#13	ACCEPTED	0.01 s	details
#14	ACCEPTED	0.01 s	details
#15	ACCEPTED	0.01 s	details
#16	ACCEPTED	0.01 s	details
#17	WRONG ANSWER	0.01 s	details
#18	WRONG ANSWER	0.01 s	details
#19	WRONG ANSWER	0.01 s	details
#20	ACCEPTED	0.01 s	details
#21	ACCEPTED	0.01 s	details
#22	ACCEPTED	0.01 s	details
#23	ACCEPTED	0.01 s	details
#24	ACCEPTED	0.01 s	details
#25	ACCEPTED	0.01 s	details
#26	ACCEPTED	0.01 s	details
#27	ACCEPTED	0.01 s	details
#28	ACCEPTED	0.01 s	details
#29	ACCEPTED	0.01 s	details
#30	ACCEPTED	0.01 s	details
#31	ACCEPTED	0.01 s	details
#32	ACCEPTED	0.01 s	details
#33	ACCEPTED	0.01 s	details
#34	ACCEPTED	0.01 s	details
#35	ACCEPTED	0.01 s	details
#36	ACCEPTED	0.01 s	details
#37	ACCEPTED	0.01 s	details
#38	ACCEPTED	0.01 s	details
#39	ACCEPTED	0.01 s	details
#40	ACCEPTED	0.01 s	details
#41	ACCEPTED	0.01 s	details

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#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())
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
const int MAXN=200000+30,MAX_LOG=40,INF=1e18+10,MOD=1e9+7;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int power(int x,int y){
    if(y==0)return 1;
    int c=power(x,y/2);
    c=(c*c)%MOD;
    if(y%2)c=(c*x)%MOD;
    return c;
}


// vector<int> g[MAXN];
// int visited[MAXN];
// int color[MAXN];
// int max_color = 1;
// int is_impossible = 0;

// vector<pair<int,int>> edges;
// int dfs(int v, int root){
//     visited[v]=1;

//     int ones = 0;
//     int twos = 0;
//     int is_leaf = 1;
//     for(int u:g[v]){
//         // cout <<v<<"pp pp"<<u<<" " <<visited[u]<<endl;
//         if(!visited[u]){
//             is_leaf = 0;
//             int c = dfs(u, root);
//             if (c == 1) ones++;
//             else twos ++;
//         }
//         else{
//             int c = color [u];
//             // cout <<c<<endl;
//             if (c != 0){
//                 if (c == 1) ones++;
//                 else twos ++; 
//             }
//         }
//     }

//     if(is_leaf){
//         // cout<<v<<" kk"<<g[v].size()<<endl;

//         color[v] = 1;
//         return 1;
//     }

//     // cout<<ones<<" "<<twos<<"--- "<<v<<endl;
//     if (ones>0 && twos >0){
//         is_impossible=1;
//         return 1;
//     }
//     else if (ones>=0){
//         color[v]=2;
//         return 2;
//     }
//     else{
//         color[v]=1;
//         return 1;
//     }
// }




// int a[MAXN];
// int b[MAXN];
int n, m;



string fetch(int idx, int n) {
    int coordinates[5];
    for (int i = 4; i >= 0; i--) {
        coordinates[i] = idx % n + 1;
        idx /= n;
    }

    cout << "FETCH " << coordinates[0] << '.' << coordinates[1] << '.' << coordinates[2] << '.' << coordinates[3] << '.' << coordinates[4] << '\n' << flush;

    string response, title;
    cin >> response >> title;
    return title;
}

int first_at_least(const string &value, int total, int n) {
    int low = 0;
    int high = total;
    while(low< high) {
        int mid = low + (high - low) / 2;
        if (fetch(mid, n) < value) {
            low = mid + 1;
        } 
        else {
            high = mid;
        }
    }
    return low;
}

int MAIN(){
    string command;
    string target;
    cin >> command >> n;
    cin >> command >> target;

    int total = 1;
    for (int i = 0; i < 5; i++) {
        total *= n;
    }

    int first = first_at_least(target, total, n);
    int after = first_at_least(target + '{', total, n);
    cout << "GOT " << (after - first) << '\n' << flush;
    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    // cin>>t;
    while(t--)MAIN();
    return 0;
}

Test details

Test 1

Verdict: WRONG ANSWER

input
`2 9 kdg dl 6 kdg 3 kdgwl 1 ...` view save

correct output
(empty)

user output
`SIZE 2 COUNT kdg FETCH 2.1.1.1.1 FOUND kdgyi FETCH 1.2.1.1.1 ...` view save

Test 2

Verdict: ACCEPTED

input
`3 15 irwkfl c 26 d 27 e 11 ...` view save

correct output
(empty)

user output
`SIZE 3 COUNT irwkfl FETCH 2.2.2.2.2 FOUND fuuics FETCH 3.1.3.1.3 ...` view save

Test 3

Verdict: WRONG ANSWER

input
`4 34 gcnmkobrd bcytu 60 bheb 64 bhebp 26 ...` view save

correct output
(empty)

user output
`SIZE 4 COUNT gcnmkobrd FETCH 3.1.1.1.1 FOUND h FETCH 2.1.1.1.1 ...` view save

Test 4

Verdict: WRONG ANSWER

input
`5 52 faoluuicsn a 1 cufqs 30 d 44 ...` view save

correct output
(empty)

user output
`SIZE 5 COUNT faoluuicsn FETCH 3.3.3.3.3 FOUND o FETCH 2.2.2.2.2 ...` view save

Test 5

Verdict: WRONG ANSWER

input
`6 75 okokxlluuicsnw a 1 b 51 bxcufq 145 ...` view save

correct output
(empty)

user output
`SIZE 6 COUNT okokxlluuicsnw FETCH 4.1.1.1.1 FOUND okhkxlluurcsnwcvbheipdry...` view save

Test 6

Verdict: ACCEPTED

input
`7 105 jibgewnvmqnpbxvirxmgf a 1 aqykhme 32 atusxwa 119 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT jibgewnvmqnpbxvirxmgf FETCH 4.4.4.4.4 FOUND n FETCH 2.6.2.6.2 ...` view save

Test 7

Verdict: WRONG ANSWER

input
`8 124 djnofmgdbfj afpc 66 apj 204 apjgsu 105 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT djnofmgdbfj FETCH 5.1.1.1.1 FOUND mdaecaalyy FETCH 3.1.1.1.1 ...` view save

Test 8

Verdict: ACCEPTED

input
`9 166 qonvyqgibutxey a 94 act 683 afngrwb 20 ...` view save

correct output
(empty)

user output
`SIZE 9 COUNT qonvyqgibutxey FETCH 5.5.5.5.5 FOUND ox FETCH 7.7.7.7.8 ...` view save

Test 9

Verdict: WRONG ANSWER

input
`10 211 zuek axof 303 axofdxjyeevjxifd 397 axofvxnleg 539 ...` view save

correct output
(empty)

user output
`SIZE 10 COUNT zuek FETCH 6.1.1.1.1 FOUND moh FETCH 8.6.1.1.1 ...` view save

Test 10

Verdict: ACCEPTED

input
`10 216 hskapswvzfrbijqwgotkothu aayuulyq 436 aayuulyqcs 205 aayuulyqcsgjqffbfix 530 ...` view save

correct output
(empty)

user output
`SIZE 10 COUNT hskapswvzfrbijqwgotkothu FETCH 6.1.1.1.1 FOUND jogii FETCH 3.6.1.1.1 ...` view save

Test 11

Verdict: WRONG ANSWER

input
`9 158 ylhjecnhgyboje a 691 acd 241 apkcczfzzxrpvlk 88 ...` view save

correct output
(empty)

user output
`SIZE 9 COUNT ylhjecnhgyboje FETCH 5.5.5.5.5 FOUND kxtjsyjajvusmj FETCH 7.7.7.7.8 ...` view save

Test 12

Verdict: ACCEPTED

input
`8 133 ewcm aavhwtselm 486 aavrwtsejm 170 aayuuly 62 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT ewcm FETCH 5.1.1.1.1 FOUND kjogxxxfyzbvtqxnmiok FETCH 3.1.1.1.1 ...` view save

Test 13

Verdict: ACCEPTED

input
`7 98 jkpxbvb awb 326 comccswxez 114 cw 42 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT jkpxbvb FETCH 4.4.4.4.4 FOUND lqsc FETCH 2.6.2.6.2 ...` view save

Test 14

Verdict: ACCEPTED

input
`6 70 eaymki alkio 119 alkioruv 72 alkioruvyivod 26 ...` view save

correct output
(empty)

user output
`SIZE 6 COUNT eaymki FETCH 4.1.1.1.1 FOUND lzftwy FETCH 2.4.1.1.1 ...` view save

Test 15

Verdict: ACCEPTED

input
`4 28 unje biybsjet 60 biybsjetnn 27 bx 45 ...` view save

correct output
(empty)

user output
`SIZE 4 COUNT unje FETCH 3.1.1.1.1 FOUND npghbml FETCH 4.1.1.1.1 ...` view save

Test 16

Verdict: ACCEPTED

input
`9 159 ckfhsouqxvv a 373 aahay 152 asvvihxxokcevotlncilqbuvhmdkmh...` view save

correct output
(empty)

user output
`SIZE 9 COUNT ckfhsouqxvv FETCH 5.5.5.5.5 FOUND lk FETCH 3.3.3.3.3 ...` view save

Test 17

Verdict: WRONG ANSWER

input
`8 117 h aaha 262 anmuhfjbetlfzdbns 107 awhfbhdbjbuexgbwl 226 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT h FETCH 5.1.1.1.1 FOUND ns FETCH 3.1.1.1.1 ...` view save

Test 18

Verdict: WRONG ANSWER

input
`7 106 m aezpq 42 aokpn 7 aqfkfe 86 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT m FETCH 4.4.4.4.4 FOUND mljjsrvri FETCH 2.6.2.6.2 ...` view save

Test 19

Verdict: WRONG ANSWER

input
`7 101 kvtwj appvlr 240 bguzpylrzkwon 78 bofd 2 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT kvtwj FETCH 4.4.4.4.4 FOUND oekjahqd FETCH 2.6.2.6.2 ...` view save

Test 20

Verdict: ACCEPTED

input
`2 9 fu dl 6 kdg 3 kdgwl 1 ...` view save

correct output
(empty)

user output
`SIZE 2 COUNT fu FETCH 2.1.1.1.1 FOUND kdgyi FETCH 1.2.1.1.1 ...` view save

Test 21

Verdict: ACCEPTED

input
`3 15 uvk c 26 d 27 e 11 ...` view save

correct output
(empty)

user output
`SIZE 3 COUNT uvk FETCH 2.2.2.2.2 FOUND fuuics FETCH 3.1.3.1.3 ...` view save

Test 22

Verdict: ACCEPTED

input
`4 34 jgtx bcytu 60 bheb 64 bhebp 26 ...` view save

correct output
(empty)

user output
`SIZE 4 COUNT jgtx FETCH 3.1.1.1.1 FOUND h FETCH 4.1.1.1.1 ...` view save

Test 23

Verdict: ACCEPTED

input
`5 52 ghmfq a 1 cufqs 30 d 44 ...` view save

correct output
(empty)

user output
`SIZE 5 COUNT ghmfq FETCH 3.3.3.3.3 FOUND o FETCH 2.2.2.2.2 ...` view save

Test 24

Verdict: ACCEPTED

input
`6 75 ojuphd a 1 b 51 bxcufq 145 ...` view save

correct output
(empty)

user output
`SIZE 6 COUNT ojuphd FETCH 4.1.1.1.1 FOUND okhkxlluurcsnwcvbheipdry...` view save

Test 25

Verdict: ACCEPTED

input
`7 105 kzzqfzz a 1 aqykhme 32 atusxwa 119 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT kzzqfzz FETCH 4.4.4.4.4 FOUND n FETCH 2.6.2.6.2 ...` view save

Test 26

Verdict: ACCEPTED

input
`8 124 emdxvwdw afpc 66 apj 204 apjgsu 105 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT emdxvwdw FETCH 5.1.1.1.1 FOUND mdaecaalyy FETCH 3.1.1.1.1 ...` view save

Test 27

Verdict: ACCEPTED

input
`9 166 pkhsbasuj a 94 act 683 afngrwb 20 ...` view save

correct output
(empty)

user output
`SIZE 9 COUNT pkhsbasuj FETCH 5.5.5.5.5 FOUND ox FETCH 7.7.7.7.8 ...` view save

Test 28

Verdict: ACCEPTED

input
`10 211 zypqadmqoo axof 303 axofdxjyeevjxifd 397 axofvxnleg 539 ...` view save

correct output
(empty)

user output
`SIZE 10 COUNT zypqadmqoo FETCH 6.1.1.1.1 FOUND moh FETCH 8.6.1.1.1 ...` view save

Test 29

Verdict: ACCEPTED

input
`10 216 jhagispreh aayuulyq 436 aayuulyqcs 205 aayuulyqcsgjqffbfix 530 ...` view save

correct output
(empty)

user output
`SIZE 10 COUNT jhagispreh FETCH 6.1.1.1.1 FOUND jogii FETCH 3.6.1.1.1 ...` view save

Test 30

Verdict: ACCEPTED

input
`9 158 zfkmqpzht a 691 acd 241 apkcczfzzxrpvlk 88 ...` view save

correct output
(empty)

user output
`SIZE 9 COUNT zfkmqpzht FETCH 5.5.5.5.5 FOUND kxtjsyjajvusmj FETCH 7.7.7.7.8 ...` view save

Test 31

Verdict: ACCEPTED

input
`8 133 dogiavnu aavhwtselm 486 aavrwtsejm 170 aayuuly 62 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT dogiavnu FETCH 5.1.1.1.1 FOUND kjogxxxfyzbvtqxnmiok FETCH 3.1.1.1.1 ...` view save

Test 32

Verdict: ACCEPTED

input
`7 98 kihqiff awb 326 comccswxez 114 cw 42 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT kihqiff FETCH 4.4.4.4.4 FOUND lqsc FETCH 2.6.2.6.2 ...` view save

Test 33

Verdict: ACCEPTED

input
`6 70 eszubi alkio 119 alkioruv 72 alkioruvyivod 26 ...` view save

correct output
(empty)

user output
`SIZE 6 COUNT eszubi FETCH 4.1.1.1.1 FOUND lzftwy FETCH 2.4.1.1.1 ...` view save

Test 34

Verdict: ACCEPTED

input
`4 28 vyta biybsjet 60 biybsjetnn 27 bx 45 ...` view save

correct output
(empty)

user output
`SIZE 4 COUNT vyta FETCH 3.1.1.1.1 FOUND npghbml FETCH 4.1.1.1.1 ...` view save

Test 35

Verdict: ACCEPTED

input
`9 159 ctohjykey a 373 aahay 152 asvvihxxokcevotlncilqbuvhmdkmh...` view save

correct output
(empty)

user output
`SIZE 9 COUNT ctohjykey FETCH 5.5.5.5.5 FOUND lk FETCH 3.3.3.3.3 ...` view save

Test 36

Verdict: ACCEPTED

input
`8 117 igjxpndn aaha 262 anmuhfjbetlfzdbns 107 awhfbhdbjbuexgbwl 226 ...` view save

correct output
(empty)

user output
`SIZE 8 COUNT igjxpndn FETCH 5.1.1.1.1 FOUND ns FETCH 3.1.1.1.1 ...` view save

Test 37

Verdict: ACCEPTED

input
`7 106 lslhnht aezpq 42 aokpn 7 aqfkfe 86 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT lslhnht FETCH 4.4.4.4.4 FOUND mljjsrvri FETCH 2.6.2.6.2 ...` view save

Test 38

Verdict: ACCEPTED

input
`7 101 hxliesh appvlr 240 bguzpylrzkwon 78 bofd 2 ...` view save

correct output
(empty)

user output
`SIZE 7 COUNT hxliesh FETCH 4.4.4.4.4 FOUND oekjahqd FETCH 2.6.2.6.2 ...` view save

Test 39

Verdict: ACCEPTED

input
`2 1 fu dl 32` view save

correct output
(empty)

user output
`SIZE 2 COUNT fu FETCH 2.1.1.1.1 FOUND dl FETCH 2.2.1.1.1 ...` view save

Test 40

Verdict: ACCEPTED

input
`3 1 fuuicsxvc fuuicsxvc 243` view save

correct output
(empty)

user output
`SIZE 3 COUNT fuuicsxvc FETCH 2.2.2.2.2 FOUND fuuicsxvc FETCH 1.3.1.3.1 ...` view save

Test 41

Verdict: ACCEPTED

input
`4 1 bcytu bcytu 1024` view save

correct output
(empty)

user output
`SIZE 4 COUNT bcytu FETCH 3.1.1.1.1 FOUND bcytu FETCH 2.1.1.1.1 ...` view save

Aalto Competitive Programming 2026 - wk2 - Wed

LibBot

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

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Tasks

Submissions (aalto26bw_008)