CSES - Aalto Competitive Programming 2026 - wk8 - Wed

Submission details
Task:	Skyline
Sender:	aalto26hw_003
Submission time:	2026-10-28 16:55:07 +0200
Language:	C++ (C++20)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.01 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.01 s	details
#5	ACCEPTED	0.01 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.01 s	details
#9	ACCEPTED	0.01 s	details
#10	ACCEPTED	0.01 s	details
#11	ACCEPTED	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	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.01 s	details
#19	ACCEPTED	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.02 s	details
#42	ACCEPTED	0.02 s	details
#43	ACCEPTED	0.02 s	details
#44	ACCEPTED	0.02 s	details
#45	ACCEPTED	0.02 s	details
#46	ACCEPTED	0.02 s	details
#47	ACCEPTED	0.02 s	details
#48	ACCEPTED	0.02 s	details
#49	ACCEPTED	0.02 s	details
#50	ACCEPTED	0.02 s	details
#51	ACCEPTED	0.17 s	details
#52	ACCEPTED	0.17 s	details
#53	ACCEPTED	0.17 s	details
#54	ACCEPTED	0.17 s	details

Compiler report

input/code.cpp: In lambda function:
input/code.cpp:500:5: warning: control reaches end of non-void function [-Wreturn-type]
  500 |     };
      |     ^

Code

#include <iostream>
#include <vector>
#include <functional>
#include <set>
#include <algorithm>
#include <stack>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <limits>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
 
typedef long long LL;
typedef std::tuple<LL>          TUP1LL;
typedef std::tuple<LL,LL>       TUP2LL;
typedef std::tuple<LL,LL,LL>    TUP3LL;
typedef std::tuple<LL,LL,LL,LL> TUP4LL;

 
std::tuple<LL> readLL1(){
    LL a;
    std::cin >> a;
    return {a};
}

std::tuple<LL,LL> readLL2(){
    LL a, b;
    std::cin >> a >> b;
    return {a,b};
}

std::tuple<LL,LL,LL> readLL3(){
    LL a, b, c;
    std::cin >> a >> b >> c;
    return {a,b,c};
}
std::tuple<LL,LL,LL,LL> readLL4(){
    LL a, b, c, d;
    std::cin >> a >> b >> c >> d;
    return {a,b,c,d};
}
 
std::vector<LL> readVecLL(LL n){
    std::vector<LL> arr(n);
    for (LL i = 0; i < n; i++){
        LL a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}

std::vector<std::string> readVecStr(LL n){
    std::vector<std::string> arr(n);
    for (LL i = 0; i < n; i++){
        std::string a;
        std::cin >> a;
        arr[i] = a;
    }
    return arr;
}
 
std::vector<std::tuple<LL,LL>> readVecTup2(LL n){
    std::vector<std::tuple<LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL2();
    }
    return arr;
}
 
std::vector<std::tuple<LL,LL,LL>> readVecTup3(LL n){
    std::vector<std::tuple<LL,LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL3();
    }
    return arr;
}
std::vector<std::tuple<double,double,double>> readVecTup3Dup(LL n){
    std::vector<std::tuple<double,double,double>> arr(n);
    for (LL i = 0; i < n; i++){
        double a, b, c;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        arr[i] = {a,b,c};
    }
    return arr;
}
std::vector<std::tuple<LL,LL,LL,LL>> readVecTup4(LL n){
    std::vector<std::tuple<LL,LL,LL,LL>> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = readLL4();
    }
    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 << std::setprecision(19) << a;}
template<typename... T>
void println(T... 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 print(const std::vector<T> &arr, LL width = -1){
    if (width == -1) width = arr.size();
    for (LL i = 0; i < (LL)arr.size(); i++){
        print(arr[i]);
        if (i+1 == (LL)arr.size()) continue;
        if ((i%width) == width-1) printNewLine();
        if ((i%width) != width-1) print(" ");
    }    
}
template<typename... T>
void println(T... a){print(a...);printNewLine();}
 
 
 
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());
    LL 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){
    LL n = std::min(a.size(),b.size());
    std::vector<R> res(n);
    for (LL 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());
    LL i = 0;
    for (T x : a){
        b[i] = x;
        i++;
    }
    return b;
}

template<typename T>
std::vector<T> reverse(const std::vector<T> &a){
    std::vector<T> b(a.size());
    LL i = 0;
    for (T x : a){
        b[a.size()-1-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 (LL idx = 0; idx < (LL)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, LL start, LL end){
    std::vector<T> arr(start+initial.size()+end);
    for (LL i = 0; i < start; i++){
        arr[i] = num;
    }
    for (LL i = 0; i < (LL)initial.size(); i++){
        arr[start+i] = initial[i];
    }
    for (LL i = 0; i < end; i++){
        arr[start+initial.size()+i] = num;
    }
    return arr;
}

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

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

template<typename T>
void stackOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::stack<T> stack;
    for (auto x : init){
        stack.push(x);
    }
    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 queueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::queue<T> que;
    for (auto x : init){
        que.push(x);
    }
    while (!que.empty()){
        T next = que.front();
        que.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            que.push(a);
        }
    }
}

template<typename T>
void priorityQueueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
    std::priority_queue<T> que;
    for (auto x : init){
        que.push(x);
    }
    while (!que.empty()){
        T next = que.top();
        que.pop();
        std::vector<T> nextSteps = operate(next);
        for (T a : nextSteps){
            que.push(a);
        }
    }
}
 
template<typename T>
void recursiveVectorSplit(LL start, LL end, LL distl, LL distr, const std::function<T(LL)> &maxHeuristic, const std::function<void(LL)> &found){
    if (start == end){
        return found(start);
    }else if (end < start){
        return;
    }
    std::tuple<LL,LL> range = {start,end};
    std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> splitter = [distl, distr,&maxHeuristic,&found](std::tuple<LL,LL> range){
        auto [start,end] = range;
        LL idx = findMax(start, end, maxHeuristic);
        found(idx);
        std::vector<std::tuple<LL,LL>> 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(LL n, std::function<T(std::vector<T>&,LL)> next){
    std::vector<T> arr(n);
    for (LL i = 0; i < n; i++){
        arr[i] = next(arr,i);
    }
    return arr;
}
template<typename T>
LL indexOfBinarySearch(const std::vector<T> &arr, const T &find){
    return binarySearch((LL)0,(LL)arr.size()-1,(std::function<bool(LL)>)[&arr, &find](LL guess){return find <= arr[guess];});
}

template<typename T>
std::unordered_map<T, LL> indexCompress(const std::vector<T> &arr){
    std::unordered_map<T, LL> compressed;
    LL i = 0;
    for (T x : arr){
        if (compressed.find(x) != compressed.end()) compressed[x] = i++;
    }
    return compressed;
}   

template<typename... Ts>
std::tuple<std::vector<std::tuple<LL,Ts...>>, std::vector<LL>> edgeIndexing(int n, std::vector<std::tuple<LL,Ts...>> edges){
    sorted(edges);
    std::vector<LL> edgeIndex(n+1);
    {
        LL j = 0;
        for (LL i = 0; i < (LL)edges.size(); i++) {
            auto a = std::get<0>(edges[i]);
            while (j <= a){
                edgeIndex[j++] = i;
            }
        }
        while (j < n){
            edgeIndex[j++] = edges.size();
        }
        edgeIndex[n] = edges.size(); 
    }
    return {edges,edgeIndex};
}


template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPathDirected(const LL n, std::vector<std::tuple<LL, LL, T>> edgesInit, LL start){
    //assumes all paths are between 0 <= c < n
    //assumes 0 indexing
    std::vector<LL> path(n);
    std::vector<bool> edgeUpdated(n);
    std::vector<T> distance(n);
    for (LL i = 0; i < n; i++) path[i] = i;
    for (LL i = 0; i < n; i++) edgeUpdated[i] = true;
    edgeUpdated[start] = false;
    for (LL i = 0; i < n; i++) distance[i] = std::numeric_limits<T>::max()/4;
    distance[start] = 0;
    auto [edges,edgeIndex] = edgeIndexing(n,edgesInit);
    std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> func = [&distance,&edgeIndex,&edges,&path,&edgeUpdated](std::tuple<LL,LL> propagateW){
        auto& [weight,propagate] = propagateW;
        std::vector<std::tuple<LL,LL>> next;
        if (distance[propagate] != -weight) return next;
        if (edgeUpdated[propagate]) return next;
        for (LL i = edgeIndex[propagate]; i < edgeIndex[propagate+1]; i++){
            auto& [a, b, w] = edges[i];
            if (distance[a]+w < distance[b]){
            //if (std::min(distance[a],w) > distance[b]){
                next.push_back({-(distance[a]+w),b});
                //next.push_back({std::min(distance[a],w),b});
                distance[b] = std::min(distance[a],w);
                path[b] = a;
                edgeUpdated[b] = false;
            }
        }
        edgeUpdated[propagate] = true;
        return next;
    };
    priorityQueueOperate((std::vector<std::tuple<LL,LL>>){{0,start}},func);
    //for (LL i = 0; 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));}
    //        if (distance[a]+w < distance[b]){
    //            distance[b] = distance[a]+w;
    //            path[b] = a;
    //        }
    //    }
    //    if (!changed) break;
    //    if (changed && i == n){
    //        return std::tuple((std::vector<T>){},(std::vector<LL>){});
    //    }
    //}
    return std::tuple(distance,path);
}
 
std::vector<LL> pathFromPathMap(std::vector<LL> &map, LL goal){
    std::stack<LL> fullPath;
    fullPath.push(goal);
    while (map[fullPath.top()] != fullPath.top()){
        fullPath.push(map[fullPath.top()]);
    }
    std::vector<LL> p;
    while (!fullPath.empty()){
        p.push_back(fullPath.top());
        fullPath.pop();
    }
    return p;
}
 
 
template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPath(const LL n, std::vector<std::tuple<LL, LL, T>> &edgesMessy, LL start){
    std::vector<std::tuple<LL, LL, T>> edges;
    for (auto e : edgesMessy){
        auto [a,b,t] = e;
        edges.push_back({a,b,t});
        edges.push_back({b,a,t});
    }
    return shortestPathDirected(n, edges, start);
}



template<typename T>
std::vector<T> range(const std::vector<T> &a, LL from, LL to){
    std::vector<T> b;
    for (LL i = from; i < to; i++){
        b.push_back(a[i]);
    }
    return b;
}

template<typename T>
bool forall(const std::vector<T> &a, std::function<bool(T)> &test){
    bool res = true;
    for (auto v : a){
        res = res & test(v);
    }
    return res;
}

int main() {
    auto [n,q] = readLL2();
    auto stones = readVecLL(n);
    auto towers = readVecLL(q);
    sorted(stones);
    std::bitset<1000001> allowed;
    for (auto stone : stones){
        allowed = allowed | (allowed << stone);
        allowed[stone] = true;
    }
    std::function<std::string (LL)> func = [&allowed](LL tower){
        if ( allowed[tower]) return "Yes";
        if (!allowed[tower]) return "No";
    };
    println(map(towers,func));
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 20 8 29 43 23 70 56 72 72 50 43 79 ...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 2

Verdict: ACCEPTED

input
`2 20 8 8 6 38 42 31 55 41 90 8 74 92 72...` view save

correct output
`No No No No No No No Yes No No...` view save

user output
`No No No No No No No Yes No No...` view save

Test 3

Verdict: ACCEPTED

input
`2 20 8 10 67 92 41 94 85 41 87 67 71 1 2...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 4

Verdict: ACCEPTED

input
`3 20 8 8 10 58 60 46 57 39 26 28 19 67 99 ...` view save

correct output
`No No No No No Yes No No No No...` view save

user output
`No No No No No Yes No No No No...` view save

Test 5

Verdict: ACCEPTED

input
`3 20 1 7 8 30 69 38 80 10 38 83 43 83 65 ...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 6

Verdict: ACCEPTED

input
`3 20 10 4 3 83 7 5 38 11 99 60 10 53 61 42...` view save

correct output
`No Yes No No No No No Yes No N...` view save

user output
`No Yes No No No No No Yes No N...` view save

Test 7

Verdict: ACCEPTED

input
`4 20 1 9 5 2 18 36 87 78 99 50 94 76 29 43 ...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 8

Verdict: ACCEPTED

input
`4 20 1 7 4 7 79 78 78 48 66 96 96 100 6 84 ...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 9

Verdict: ACCEPTED

input
`4 20 8 10 8 2 22 50 48 68 61 28 20 26 95 53 ...` view save

correct output
`No No No No No Yes Yes Yes No ...` view save

user output
`No No No No No Yes Yes Yes No ...` view save

Test 10

Verdict: ACCEPTED

input
`4 20 6 1 9 10 16 91 9 41 27 20 58 31 19 20 9...` view save

correct output
`Yes No Yes No No Yes No No Yes...` view save

user output
`Yes No Yes No No Yes No No Yes...` view save

Test 11

Verdict: ACCEPTED

input
`5 20 6 8 9 7 9 55 85 43 63 65 39 44 30 90 6 9...` view save

correct output
`No No No No No Yes No Yes No Y...` view save

user output
`No No No No No Yes No Yes No Y...` view save

Test 12

Verdict: ACCEPTED

input
`5 20 10 8 10 1 2 31 100 15 24 10 40 19 39 35 67...` view save

correct output
`Yes No No No Yes No Yes No No ...` view save

user output
`Yes No No No Yes No Yes No No ...` view save

Test 13

Verdict: ACCEPTED

input
`5 20 2 1 10 6 10 44 49 43 33 34 16 21 70 62 12 ...` view save

correct output
`No No No No No Yes Yes No No Y...` view save

user output
`No No No No No Yes Yes No No Y...` view save

Test 14

Verdict: ACCEPTED

input
`5 20 1 8 9 3 2 52 57 90 44 90 2 13 5 21 25 6 ...` view save

correct output
`No No No No No Yes Yes Yes Yes...` view save

user output
`No No No No No Yes Yes Yes Yes...` view save

Test 15

Verdict: ACCEPTED

input
`5 20 10 6 2 10 9 72 61 70 60 22 15 98 23 1 70 2...` view save

correct output
`No No No No Yes Yes No No No N...` view save

user output
`No No No No Yes Yes No No No N...` view save

Test 16

Verdict: ACCEPTED

input
`5 20 2 10 10 4 4 92 98 49 9 62 40 77 36 52 49 3...` view save

correct output
`No No No No No No No No No No ...` view save

user output
`No No No No No No No No No No ...` view save

Test 17

Verdict: ACCEPTED

input
`5 20 10 4 3 9 1 5 38 11 99 60 10 53 61 42 54 3...` view save

correct output
`Yes No Yes No No Yes No No No ...` view save

user output
`Yes No Yes No No Yes No No No ...` view save

Test 18

Verdict: ACCEPTED

input
`5 20 4 8 4 6 10 73 46 98 31 54 27 51 9 8 42 27...` view save

correct output
`No No No No No No No No Yes No...` view save

user output
`No No No No No No No No Yes No...` view save

Test 19

Verdict: ACCEPTED

input
`5 20 1 10 3 9 4 54 82 24 43 2 62 44 77 41 41 5...` view save

correct output
`No No Yes No No No No No No No...` view save

user output
`No No Yes No No No No No No No...` view save

Test 20

Verdict: ACCEPTED

input
`5 20 4 6 6 6 2 14 32 15 2 22 88 42 14 25 14 9...` view save

correct output
`Yes No No Yes Yes No No Yes No...` view save

user output
`Yes No No Yes Yes No No Yes No...` view save

Test 21

Verdict: ACCEPTED

input
`10 20 6 8 9 7 9 6 9 5 7 7 39 44 30 90 6 97 28 39 48 80 8...` view save

correct output
`Yes Yes Yes No Yes No Yes Yes ...` view save

user output
`Yes Yes Yes No Yes No Yes Yes ...` view save

Test 22

Verdict: ACCEPTED

input
`10 20 10 8 10 1 2 4 10 2 3 1 40 19 39 35 67 40 94 54 85 42 ...` view save

correct output
`Yes Yes Yes Yes No Yes No No N...` view save

user output
`Yes Yes Yes Yes No Yes No No N...` view save

Test 23

Verdict: ACCEPTED

input
`10 20 2 1 10 6 10 5 5 5 4 4 16 21 70 62 12 30 49 27 64 63 ...` view save

correct output
`Yes Yes No No Yes Yes Yes Yes ...` view save

user output
`Yes Yes No No Yes Yes Yes Yes ...` view save

Test 24

Verdict: ACCEPTED

input
`10 20 1 8 9 3 2 6 6 9 5 9 2 13 5 21 25 6 10 45 70 3 15 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 25

Verdict: ACCEPTED

input
`10 20 10 6 2 10 9 8 7 7 6 3 15 98 23 1 70 26 91 44 64 78 1...` view save

correct output
`Yes No Yes No No Yes No Yes No...` view save

user output
`Yes No Yes No No Yes No Yes No...` view save

Test 26

Verdict: ACCEPTED

input
`10 20 2 10 10 4 4 10 10 6 2 8 40 77 36 52 49 30 100 19 81 9 ...` view save

correct output
`Yes No Yes Yes No Yes No No No...` view save

user output
`Yes No Yes Yes No Yes No No No...` view save

Test 27

Verdict: ACCEPTED

input
`10 20 10 4 3 9 1 1 4 2 10 6 10 53 61 42 54 34 49 63 83 44 ...` view save

correct output
`Yes No No Yes No Yes Yes No No...` view save

user output
`Yes No No Yes No Yes Yes No No...` view save

Test 28

Verdict: ACCEPTED

input
`10 20 4 8 4 6 10 8 6 10 4 6 27 51 9 8 42 27 2 50 53 68 87 ...` view save

correct output
`No No No Yes Yes No No Yes No ...` view save

user output
`No No No Yes Yes No No Yes No ...` view save

Test 29

Verdict: ACCEPTED

input
`10 20 1 10 3 9 4 6 9 3 5 1 62 44 77 41 41 53 88 48 93 56 ...` view save

correct output
`No Yes No Yes Yes No No Yes No...` view save

user output
`No Yes No Yes Yes No No Yes No...` view save

Test 30

Verdict: ACCEPTED

input
`10 20 4 6 6 6 2 2 4 2 2 4 88 42 14 25 14 9 40 35 50 17 3...` view save

correct output
`No No Yes No Yes No No No No N...` view save

user output
`No No Yes No Yes No No No No N...` view save

Test 31

Verdict: ACCEPTED

input
`100 1000 59286 71521 84428 60278 85796 ...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 32

Verdict: ACCEPTED

input
`100 1000 99721 72034 93258 12 12813 302...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 33

Verdict: ACCEPTED

input
`100 1000 18509 2593 93156 54968 94775 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 34

Verdict: ACCEPTED

input
`100 1000 7073 70816 83997 29091 12134 5...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 35

Verdict: ACCEPTED

input
`100 1000 90064 54725 17270 97270 85564 ...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 36

Verdict: ACCEPTED

input
`100 1000 5520 87074 83134 20672 36374 9...` view save

correct output
`No No Yes No No Yes Yes No Yes...` view save

user output
`No No Yes No No Yes Yes No Yes...` view save

Test 37

Verdict: ACCEPTED

input
`100 1000 94750 33199 20941 82125 6426 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 38

Verdict: ACCEPTED

input
`100 1000 22734 77994 31898 43842 97824 ...` view save

correct output
`No Yes No No No Yes No Yes No ...` view save

user output
`No Yes No No No Yes No Yes No ...` view save

Test 39

Verdict: ACCEPTED

input
`100 1000 1112 96856 23945 86921 37753 5...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 40

Verdict: ACCEPTED

input
`100 1000 36448 50188 49914 49578 756 13...` view save

correct output
`Yes Yes No Yes No Yes Yes Yes ...` view save

user output
`Yes Yes No Yes No Yes Yes Yes ...` view save

Test 41

Verdict: ACCEPTED

input
`200 1000 59286 71521 84428 60278 85796 ...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 42

Verdict: ACCEPTED

input
`200 1000 99721 72034 93258 12 12813 302...` view save

correct output
`Yes Yes No Yes Yes Yes Yes Yes...` view save

user output
`Yes Yes No Yes Yes Yes Yes Yes...` view save

Test 43

Verdict: ACCEPTED

input
`200 1000 18509 2593 93156 54968 94775 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 44

Verdict: ACCEPTED

input
`200 1000 7073 70816 83997 29091 12134 5...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 45

Verdict: ACCEPTED

input
`200 1000 90064 54725 17270 97270 85564 ...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 46

Verdict: ACCEPTED

input
`200 1000 5520 87074 83134 20672 36374 9...` view save

correct output
`No No No No No No No No Yes No...` view save

user output
`No No No No No No No No Yes No...` view save

Test 47

Verdict: ACCEPTED

input
`200 1000 94750 33199 20941 82125 6426 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 48

Verdict: ACCEPTED

input
`200 1000 22734 77994 31898 43842 97824 ...` view save

correct output
`No Yes No No Yes Yes Yes Yes Y...` view save

user output
`No Yes No No Yes Yes Yes Yes Y...` view save

Test 49

Verdict: ACCEPTED

input
`200 1000 1112 96856 23945 86921 37753 5...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 50

Verdict: ACCEPTED

input
`200 1000 36448 50188 49914 49578 756 13...` view save

correct output
`Yes Yes No Yes No No No Yes No...` view save

user output
`Yes Yes No Yes No No No Yes No...` view save

Test 51

Verdict: ACCEPTED

input
`2000 100000 59286 71521 84428 60278 85796 ...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 52

Verdict: ACCEPTED

input
`2000 100000 99721 72034 93258 12 12813 302...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 53

Verdict: ACCEPTED

input
`2000 100000 18509 2593 93156 54968 94775 4...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Test 54

Verdict: ACCEPTED

input
`2000 100000 7073 70816 83997 29091 12134 5...` view save

correct output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

user output
`Yes Yes Yes Yes Yes Yes Yes Ye...` view save

Aalto Competitive Programming 2026 - wk8 - Wed

Skyline

Compiler report

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

Tasks

Submissions (aalto26hw_003)