CSES - Aalto Competitive Programming 2026 - wk3 - Wed

Submission details
Task:	Wario Kart II
Sender:	aalto26cw_001
Submission time:	2026-09-16 17:43:28 +0300
Language:	C++ (C++20)
Status:	READY
Result:	WRONG ANSWER

Test results
test	verdict	time
#1	ACCEPTED	0.01 s	details
#2	ACCEPTED	0.00 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.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.00 s	details
#38	ACCEPTED	0.00 s	details
#39	ACCEPTED	0.00 s	details
#40	ACCEPTED	0.00 s	details
#41	ACCEPTED	0.00 s	details
#42	ACCEPTED	0.00 s	details
#43	ACCEPTED	0.00 s	details
#44	ACCEPTED	0.00 s	details
#45	ACCEPTED	0.00 s	details
#46	ACCEPTED	0.00 s	details
#47	ACCEPTED	0.00 s	details
#48	ACCEPTED	0.00 s	details
#49	ACCEPTED	0.01 s	details
#50	ACCEPTED	0.06 s	details
#51	ACCEPTED	0.06 s	details
#52	ACCEPTED	0.06 s	details
#53	ACCEPTED	0.06 s	details
#54	ACCEPTED	0.06 s	details
#55	ACCEPTED	0.05 s	details
#56	ACCEPTED	0.06 s	details
#57	ACCEPTED	0.05 s	details
#58	ACCEPTED	0.06 s	details
#59	WRONG ANSWER	0.05 s	details

Code

#include <iostream>
#include <vector>
#include <functional>
#include <set>
#include <algorithm>
#include <stack>
#include <unordered_map>

std::tuple<int> readInt1(){
    int a;
    std::cin >> a;
    return {a};
}
std::tuple<int,int> readInt2(){
    int a, b;
    std::cin >> a >> b;
    return {a,b};
}
std::tuple<int,int,int> readInt3(){
    int a, b, c;
    std::cin >> a >> b >> c;
    return {a,b,c};
}

std::vector<int> readVecInt(int n){
    std::vector<int> arr(n);
    for (int i = 0; i < n; i++){
        int a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}

std::vector<long long> readVecLong(int n){
    std::vector<long long> arr(n);
    for (int i = 0; i < n; i++){
        long long a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}

std::vector<std::tuple<int,int>> readVecTup2(int n){
    std::vector<std::tuple<int,int>> arr(n);
    for (int i = 0; i < n; i++){
        int a, b;
        std::cin >> a;
        std::cin >> b;
        arr[i] = {a,b};
    }
    return arr;
}

std::vector<std::tuple<int,int,int>> readVecTup3(int n){
    std::vector<std::tuple<int,int,int>> arr(n);
    for (int i = 0; i < n; i++){
        int a, b, c;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        arr[i] = {a,b,c};
    }
    return arr;
}

void printNewLine(){std::cout << "\n";}
template<typename T, typename... Ts>
std::tuple<Ts...> tail(std::tuple<T,Ts...> as){
    return std::apply([](T &a, Ts... b){return std::make_tuple(b...);},as);
}

template<typename T>
void print(T a){std::cout << a;}

template<typename T, typename Ts>
void print(std::tuple<T,Ts> a){
    print(std::get<0>(a));
    print(" ");
    print(std::get<1>(a));
}

template<typename T, typename... Ts>
void print(std::tuple<T,Ts...> a){
    print(std::get<0>(a));
    print(" ");
    print(tail(a));
}
template<typename T>
void println(T a){print(a);printNewLine();}

template<typename T>
void printVec(const std::vector<T> &arr, int width = -1){
    if (width == -1) width = arr.size();
    for (int i = 0; i < (int)arr.size(); i++){
        if ((i%width) == width-1){
            print(" ");
            println(arr[i]);
        }else if ((i%width) == 0){        
            print(arr[i]);
        }else {
            print(" ");
            print(arr[i]);
        }
    }    
}


template<typename T>
void sorted(std::vector<T> &arr){
    std::sort(arr.begin(),arr.end(),[](const T &a, const T &b){ return a < b; });
}


template<typename T>
std::set<T> toSet(const std::vector<T> &vec){
    std::set<T> c;
    for (T a : vec){ c.emplace(a);}
    return c;
}

template<typename T, typename N>
std::vector<N> map(const std::vector<T> &a, const std::function<N(T)> &transform){
    std::vector<N> b(a.size());
    int i = 0;
    for (T x : a){
        b[i] = transform(x);
        i++;
    }
    return b;
}

template<typename N, typename M, typename R>
std::vector<R> zip(const std::vector<N> &a, const  std::vector<M> &b, const std::function<R(N,M)> &transform){
    int n = std::min(a.size(),b.size());
    std::vector<R> res(n);
    for (int i = 0; i < n; i++){
        res[i] = transform(a[i],b[i]);
    }
    return res;
}

template<typename T, typename N>
std::vector<N> convertVec(const std::vector<T> &a){
    std::vector<N> b(a.size());
    int i = 0;
    for (T x : a){
        b[i] = x;
        i++;
    }
    return b;
}

template<typename T, typename R>
R reduce(const std::vector<T> &arr, R init, const std::function<R(const R,const T)> &transform){
    R current = init;
    for (int idx = 0; idx < (int)arr.size(); idx++){
        current = transform(current,arr[idx]);
    };
    return current;
}
template<typename T>
T max(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::max<T>)));}
template<typename T>
T min(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::min<T>)));}

template<typename T>
std::function<T(const T,const T)> add(){return [](T a,T b){return a+b;};}
template<typename T>
std::function<T(const T,const T)> modAdd(T mod){return [mod](T a,T b){return (((a+b)%mod)+mod)%mod;};}
template<typename T, typename R>
std::function<R(const R,const T)> mulAdd(R mul){return [mul](R a,T b){return a+b*mul;};}
template<typename T>
T sum(const std::vector<T> &arr){return reduce(arr, 0, add<T>());}
template<typename T>
T avg(const std::vector<T> &arr){return reduce(arr, 0.0, mulAdd<double,T>(1.0/arr.size()));}

template<typename T>
T binarySearch(T min, T max, const std::function<bool(T)> &leq){
    if (min == max) return max;
    T guess = (min+max)/2;
    if (leq(guess)){
        return binarySearch(min,guess,leq);
    }else{
        return binarySearch(guess+1,max,leq);
    }
}

template<typename T>
T binarySearchDecending(T min, T max, const std::function<bool(T)> &leq){
    std::function<bool(T)> gt = [leq](T x){
        return !leq(x);
    };
    return binarySearch(min,max+1, gt)-1;
}

template<typename T>
std::vector<T> cloneVec(std::vector<T> a){return a;}

template<typename T>
std::vector<T> padding(const std::vector<T> &initial, T num, int start, int end){
    std::vector<T> arr(start+initial.size()+end);
    for (int i = 0; i < start; i++){
        arr[i] = num;
    }
    for (int i = 0; i < (int)initial.size(); i++){
        arr[start+i] = initial[i];
    }
    for (int i = 0; i < end; i++){
        arr[start+initial.size()+i] = num;
    }
    return arr;
}

template<typename T>
int findMax(int start, int end, const std::function<T(int)> &maxHeuristic){
    T initialGuess = maxHeuristic(start);
    int index = start;
    for (int i = start; i <= end; i++){
        if (initialGuess < maxHeuristic(i)){
            initialGuess = maxHeuristic(i);
            index = i;
        }
    }
    return index;
}

template<typename T>
void operateOnMax(int start, int end, const std::function<T(int)> &maxHeuristic, const std::function<void(int)> &found){
    found(findMax(start,end,maxHeuristic));
}

template<typename T>
void stackOperate(T init, const std::function<std::vector<T>(T)> operate){
    std::stack<T> stack;
    stack.push(init);
    while (!stack.empty()){
        T next = stack.top();
        stack.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            stack.push(a);
        }
    }
}

template<typename T>
void recursiveVectorSplit(int start, int end, int distl, int distr, const std::function<T(int)> &maxHeuristic, const std::function<void(int)> &found){
    if (start == end){
        return found(start);
    }else if (end < start){
        return;
    }
    std::tuple<int,int> range = {start,end};
    std::function<std::vector<std::tuple<int,int>>(std::tuple<int,int>)> splitter = [distl, distr,&maxHeuristic,&found](std::tuple<int,int> range){
        auto [start,end] = range;
        int idx = findMax(start, end, maxHeuristic);
        found(idx);
        std::vector<std::tuple<int,int>> next;
        if (idx+distl+1 <= end){
            next.push_back({idx+distl+1,end});
        }
        if (start <= idx-distr-1){
            next.push_back({start, idx-distr-1});
        }
        return next;
    };
    stackOperate(range,splitter);
}


template<typename T>
std::vector<T> dynamicallyComputableList(int n, std::function<T(std::vector<T>&,int)> next){
    std::vector<T> arr(n);
    for (int i = 0; i < n; i++){
        arr[i] = next(arr,i);
    }
    return arr;
}
template<typename T>
int indexOfBinarySearch(const std::vector<T> &arr, const T &find){
    return binarySearch(0,(int)arr.size()-1,(std::function<bool(int)>)[&arr, &find](int guess){return find <= arr[guess];});
}

template<typename T>
std::unordered_map<T, int> indexCompress(const std::vector<T> &arr){
    std::unordered_map<T, int> compressed;
    int i = 0;
    for (T x : arr){
        if (compressed.find(x) != compressed.end()) compressed[x] = i++;
    }
    return compressed;
}   
#include <limits>
template<typename T>
std::tuple<T, std::vector<int>> shortestPathDirected(const std::vector<std::tuple<int, int, T>> &edgesMessy, int start, int goal){
    //assumes all are between 0 <= n < c*(number of vertexies), where c is reasonably small constant.  
    std::vector<int> vertexies = {};
    for (auto& [s,g,c] : edgesMessy){
        vertexies.push_back(s);
        vertexies.push_back(g);
    }
    //std::unordered_map<int, int> mapping = indexCompress(vertexies);
    //println("Start");
    //std::set<int> setVertexies = {start,goal};
    //for (auto [s,g,c] : edgesMessy){
    //    setVertexies.emplace(s);
    //    setVertexies.emplace(g);
    //}
    //std::vector<int> vertexies;
    //for (int v : setVertexies){
    //    vertexies.push_back(v);
    //}
    //sorted(vertexies);
    //println("end2");
    std::vector<std::tuple<int, int, T>> edges = edgesMessy;
    //for (auto& [s,g,c] : edges){
    //    s = indexOfBinarySearch(vertexies,s);
    //    g = indexOfBinarySearch(vertexies,g);
    //}
    int mappedStart = start;//indexOfBinarySearch(vertexies,start);
    int mappedEnd   = goal;//indexOfBinarySearch(vertexies,goal);
    //println("end1");
    int n = max(vertexies)+1;
    std::vector<T> distance(n);
    for (int i = 0; i < n; i++) distance[i] = std::numeric_limits<T>::max()/4;//(T)4611686018427387903L;
    distance[mappedStart] = 0;
    for (int i = 1; i <= n; i++) {
        bool changed = false;
        for (auto e : edges) {
            auto [a, b, w] = e;
            if (!changed) {changed = (distance[b] != std::min(distance[b], distance[a]+w));}
            distance[b] = std::min(distance[b], distance[a]+w);
        }
        if (!changed) break;
        if (changed && i == n){
            //handle inifnite loop
        }
    }
    //println("end2");
    return std::tuple(distance[mappedEnd],(std::vector<int>){});
}


void marioKart2(){
    auto [n,k] = readInt2();
    auto arr = readVecLong(n);
    int start = 0;
    int goal = n;
    std::vector<std::tuple<int, int, double>> edges;
    for (int i = 0; i < n; i++){
        std::tuple<int,int,double> a = {i, i+1,1.0};
        edges.push_back(a);
        if (i+arr[i]+k <= n){
            std::tuple<int,int,double> b = {i, i+(arr[i])+k,(double)(k+1)}; //(1+arr[i])*(1.0/(1+arr[i]+k)
            edges.push_back(b);
        }else if (i+arr[i] <= n){
            int dist = n-(i+(arr[i]));
            std::tuple<int,int,double> b = {i, n, (double)(dist+1)}; //(1+arr[i])*(1.0/(1+arr[i]+k)
            edges.push_back(b);
        } else {
            int dist = n-i;
            std::tuple<int,int,double> b = {i, n, ((double)dist)/(arr[i])}; //(1+arr[i])*(1.0/(1+arr[i]+k)
            edges.push_back(b);
        }
    }
    //printVec(edges,1);
    auto [min,path] = shortestPathDirected(edges,start,goal);
    println(min);
}




template<typename T>
std::vector<T> distanceTable(const std::vector<T> &init, const  std::function<T(T,T)> &distance){
    int n = init.size();
    std::vector<T> table(n*n);
    for (int i = 0; i < n; i++){
        table[i+n*i] = init[i];
        for (int j = i-1; j >= 0; j--){
            table[j+n*i] = distance(init[j],table[j+1+n*i]);
        }
        for (int j = i+1; j < n; j++){
            table[j+n*i] = distance(table[j-1+n*i],init[j]);
        }
    }
    return table;
}

void particles(){
    auto [n] = readInt1();
    auto arr = readVecLong(n);
    std::vector<long long> table = distanceTable(arr,add<long long>());
    printVec(table,n);
    //println(cost[n*n-1]);
}


int main() {
    marioKart2();
    //particles();
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 5 3` view save

correct output
`0.33333333333333333334` view save

user output
`0.333333` view save

Test 2

Verdict: ACCEPTED

input
`2 5 3 4` view save

correct output
`0.66666666666666666668` view save

user output
`0.666667` view save

Test 3

Verdict: ACCEPTED

input
`2 5 2 2` view save

correct output
`1.00000000000000000000` view save

user output
`1` view save

Test 4

Verdict: ACCEPTED

input
`3 5 2 2 2` view save

correct output
`2.00000000000000000000` view save

user output
`2` view save

Test 5

Verdict: ACCEPTED

input
`3 5 3 4 3` view save

correct output
`1.00000000000000000000` view save

user output
`1` view save

Test 6

Verdict: ACCEPTED

input
`3 5 2 2 2` view save

correct output
`2.00000000000000000000` view save

user output
`2` view save

Test 7

Verdict: ACCEPTED

input
`4 5 3 4 3 4` view save

correct output
`1.75000000000000000000` view save

user output
`1.75` view save

Test 8

Verdict: ACCEPTED

input
`4 5 2 2 2 4` view save

correct output
`3.00000000000000000000` view save

user output
`3` view save

Test 9

Verdict: ACCEPTED

input
`4 3 2 2 2 2` view save

correct output
`3.00000000000000000000` view save

user output
`3` view save

Test 10

Verdict: ACCEPTED

input
`5 5 3 4 3 4 3` view save

correct output
`2.00000000000000000000` view save

user output
`2` view save

Test 11

Verdict: ACCEPTED

input
`5 5 2 2 2 4 2` view save

correct output
`3.50000000000000000000` view save

user output
`3.5` view save

Test 12

Verdict: ACCEPTED

input
`5 5 2 2 2 2 2` view save

correct output
`4.00000000000000000000` view save

user output
`4` view save

Test 13

Verdict: ACCEPTED

input
`5 5 2 2 3 3 4` view save

correct output
`3.00000000000000000000` view save

user output
`3` view save

Test 14

Verdict: ACCEPTED

input
`5 1 4 4 4 3 4` view save

correct output
`2.00000000000000000000` view save

user output
`2` view save

Test 15

Verdict: ACCEPTED

input
`5 4 2 3 5 5 3` view save

correct output
`2.59999999999999999991` view save

user output
`2.6` view save

Test 16

Verdict: ACCEPTED

input
`5 1 3 2 2 2 2` view save

correct output
`2.50000000000000000000` view save

user output
`2.5` view save

Test 17

Verdict: ACCEPTED

input
`5 1 3 5 4 3 5` view save

correct output
`1.79999999999999999996` view save

user output
`1.8` view save

Test 18

Verdict: ACCEPTED

input
`5 1 5 3 4 5 2` view save

correct output
`1.00000000000000000000` view save

user output
`1` view save

Test 19

Verdict: ACCEPTED

input
`5 2 3 2 2 2 2` view save

correct output
`3.00000000000000000000` view save

user output
`3` view save

Test 20

Verdict: ACCEPTED

input
`10 5 3 4 3 4 3 3 3 3 3 2` view save

correct output
`6.66666666666666666652` view save

user output
`6.66667` view save

Test 21

Verdict: ACCEPTED

input
`10 5 2 2 2 4 2 2 2 3 2 3` view save

correct output
`7.00000000000000000000` view save

user output
`7` view save

Test 22

Verdict: ACCEPTED

input
`10 5 2 2 2 2 2 2 2 2 2 2` view save

correct output
`8.00000000000000000000` view save

user output
`8` view save

Test 23

Verdict: ACCEPTED

input
`10 5 2 2 3 3 4 3 4 2 2 2` view save

correct output
`7.00000000000000000000` view save

user output
`7` view save

Test 24

Verdict: ACCEPTED

input
`10 1 4 4 4 3 4 3 2 2 4 2` view save

correct output
`4.50000000000000000000` view save

user output
`4.5` view save

Test 25

Verdict: ACCEPTED

input
`10 4 2 3 5 5 3 2 4 3 5 3` view save

correct output
`6.00000000000000000000` view save

user output
`6` view save

Test 26

Verdict: ACCEPTED

input
`10 1 3 2 2 2 2 3 3 2 3 3` view save

correct output
`5.33333333333333333348` view save

user output
`5.33333` view save

Test 27

Verdict: ACCEPTED

input
`10 1 3 5 4 3 5 3 4 3 4 2` view save

correct output
`4.00000000000000000000` view save

user output
`4` view save

Test 28

Verdict: ACCEPTED

input
`10 1 5 3 4 5 2 3 2 4 3 5` view save

correct output
`3.75000000000000000000` view save

user output
`3.75` view save

Test 29

Verdict: ACCEPTED

input
`10 2 3 2 2 2 2 2 2 4 3 2` view save

correct output
`5.75000000000000000000` view save

user output
`5.75` view save

Test 30

Verdict: ACCEPTED

input
`100 72 51 37 52 34 51 26 38 40 24 27 ...` view save

correct output
`42.00000000000000000000` view save

user output
`42` view save

Test 31

Verdict: ACCEPTED

input
`100 72 94 2 14 31 100 16 25 11 41 20 ...` view save

correct output
`4.96000000000000000003` view save

user output
`4.96` view save

Test 32

Verdict: ACCEPTED

input
`100 2 19 12 20 10 11 9 8 8 4 5 15 13...` view save

correct output
`18.70588235294117647120` view save

user output
`18.7059` view save

Test 33

Verdict: ACCEPTED

input
`100 71 8 4 2 6 6 9 5 9 2 3 2 3 3 2 2 ...` view save

correct output
`85.00000000000000000000` view save

user output
`85` view save

Test 34

Verdict: ACCEPTED

input
`100 55 17 89 79 66 56 64 55 21 14 89 ...` view save

correct output
`12.00000000000000000000` view save

user output
`12` view save

Test 35

Verdict: ACCEPTED

input
`100 87 6 3 4 7 7 4 2 5 4 6 4 5 4 3 7 ...` view save

correct output
`90.00000000000000000000` view save

user output
`90` view save

Test 36

Verdict: ACCEPTED

input
`100 33 21 79 8 5 36 12 94 57 11 51 59...` view save

correct output
`7.00000000000000000000` view save

user output
`7` view save

Test 37

Verdict: ACCEPTED

input
`100 78 9 12 24 18 12 24 9 14 8 13 3 3...` view save

correct output
`77.00000000000000000000` view save

user output
`77` view save

Test 38

Verdict: ACCEPTED

input
`100 97 2 3 2 3 3 2 2 2 3 2 3 2 2 3 3 ...` view save

correct output
`98.00000000000000000000` view save

user output
`98` view save

Test 39

Verdict: ACCEPTED

input
`100 50 20 20 2 6 13 7 2 10 34 17 7 11...` view save

correct output
`52.96666666666666666713` view save

user output
`52.9667` view save

Test 40

Verdict: ACCEPTED

input
`200 72 51 37 52 34 51 26 38 40 24 27 ...` view save

correct output
`89.00000000000000000000` view save

user output
`89` view save

Test 41

Verdict: ACCEPTED

input
`200 72 94 2 14 31 100 16 25 11 41 20 ...` view save

correct output
`73.91891891891891892136` view save

user output
`73.9189` view save

Test 42

Verdict: ACCEPTED

input
`200 2 19 12 20 10 11 9 8 8 4 5 15 13...` view save

correct output
`36.90000000000000000139` view save

user output
`36.9` view save

Test 43

Verdict: ACCEPTED

input
`200 71 8 4 2 6 6 9 5 9 2 3 2 3 3 2 2 ...` view save

correct output
`177.00000000000000000000` view save

user output
`177` view save

Test 44

Verdict: ACCEPTED

input
`200 55 17 89 79 66 56 64 55 21 14 89 ...` view save

correct output
`58.62790697674418604821` view save

user output
`58.6279` view save

Test 45

Verdict: ACCEPTED

input
`200 87 6 3 4 7 7 4 2 5 4 6 4 5 4 3 7 ...` view save

correct output
`184.00000000000000000000` view save

user output
`184` view save

Test 46

Verdict: ACCEPTED

input
`200 33 21 79 8 5 36 12 94 57 11 51 59...` view save

correct output
`39.97647058823529411797` view save

user output
`39.9765` view save

Test 47

Verdict: ACCEPTED

input
`1000 78 9 12 24 18 12 24 9 14 8 13 3 3...` view save

correct output
`778.00000000000000000000` view save

user output
`778` view save

Test 48

Verdict: ACCEPTED

input
`1000 97 2 3 2 3 3 2 2 2 3 2 3 2 2 3 3 ...` view save

correct output
`980.00000000000000000000` view save

user output
`980` view save

Test 49

Verdict: ACCEPTED

input
`10000 50 20 20 2 6 13 7 2 10 34 17 7 11...` view save

correct output
`6049.00000000000000000000` view save

user output
`6049` view save

Test 50

Verdict: ACCEPTED

input
`100000 59 39252 46336 33082 47087 29905 ...` view save

correct output
`64.97006295772838237179` view save

user output
`64.9701` view save

Test 51

Verdict: ACCEPTED

input
`100000 100 30041 38891 6 5345 12609 41664...` view save

correct output
`203.77740406665647454609` view save

user output
`203.777` view save

Test 52

Verdict: ACCEPTED

input
`100000 18 1132 40617 23967 41323 18982 2...` view save

correct output
`40.94677609727978918885` view save

user output
`40.9468` view save

Test 53

Verdict: ACCEPTED

input
`100000 7 39007 46266 16025 6684 28138 3...` view save

correct output
`14.93255621844882973827` view save

user output
`14.9326` view save

Test 54

Verdict: ACCEPTED

input
`100000 90 52921 16702 94063 82743 69126 ...` view save

correct output
`91.66979787325027796002` view save

user output
`91.6698` view save

Test 55

Verdict: ACCEPTED

input
`100000 5 19332 18457 4591 8077 20395 21...` view save

correct output
`35.88927530302255408320` view save

user output
`35.8893` view save

Test 56

Verdict: ACCEPTED

input
`100000 95 29643 18699 73326 5739 3724 33...` view save

correct output
`96.91999685748703713406` view save

user output
`96.92` view save

Test 57

Verdict: ACCEPTED

input
`100000 22 5953 2436 3347 7466 5522 3478 ...` view save

correct output
`330.93907248742010063225` view save

user output
`330.939` view save

Test 58

Verdict: ACCEPTED

input
`100000 1 84598 20915 75920 32975 46369 ...` view save

correct output
`2.81955087271179225200` view save

user output
`2.81955` view save

Test 59

Verdict: WRONG ANSWER

input
`100000 36 522 520 516 9 140 330 149 15 2...` view save

correct output
`3870.97771317829457360382` view save

user output
`3870.98` view save

Aalto Competitive Programming 2026 - wk3 - Wed

Wario Kart II

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

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Tasks

Submissions (aalto26cw_001)