— Dark mode

Aalto Competitive Programming 2026 - wk8 - Mon

Illuminati

  • Start: 2026-10-26 16:20:00
  • End: 2026-10-26 17:50:00
Submission details
Task:Illuminati
Sender:aalto26hm_035
Submission time:2026-10-26 17:34:37 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.01 sdetails
#39ACCEPTED0.01 sdetails
#40ACCEPTED0.01 sdetails
#41ACCEPTED0.01 sdetails
#42ACCEPTED0.01 sdetails
#43ACCEPTED0.01 sdetails
#44ACCEPTED0.01 sdetails
#45ACCEPTED0.01 sdetails
#46ACCEPTED0.01 sdetails
#47ACCEPTED0.01 sdetails
#48ACCEPTED0.38 sdetails
#49ACCEPTED0.38 sdetails
#50--details
#51--details
#52--details
#53--details

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>

typedef long long LL;

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::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<long long> readVecLong(LL n){
    std::vector<long long> arr(n);
    for (LL i = 0; i < n; i++){
        long long 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++){
        LL a, b;
        std::cin >> a;
        std::cin >> b;
        arr[i] = {a,b};
    }
    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++){
        LL a, b, c;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        arr[i] = {a,b,c};
    }
    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++){
        LL a, b, c,d;
        std::cin >> a;
        std::cin >> b;
        std::cin >> c;
        std::cin >> d;
        arr[i] = {a,b,c,d};
    }
    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] = readLL1();
    auto conn = readVecStr(n);
    int count = 0;
    std::vector<std::vector<bool>> connections(n);
    std::vector<std::vector<LL>> connectionsSetInit(n);
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            connections[i].push_back('1' == conn[i][j]);
            if ('1' == conn[i][j]){
                connectionsSetInit[i].push_back(j);
            }
        }
    }
    std::vector<std::set<LL>> connectionsSet(n);
    for (int i = 0; i < n; i++){
        connectionsSet[i] = toSet(connectionsSetInit[i]);
    }
    for (int i = 0; i < n; i++){
        for (auto j : connectionsSet[i]){
            if (i >= j) continue;
            //for (auto val : connectionsSet[i]){
            //    connectionsSet[j].find()
            //}
            //std::set<LL> set = std::insert(connectionsSet[i],connectionsSet[j]);
            //count += set.size()-1;
            for (int k = j+1; k < n; k++){
                if (connections[i][k] && connections[j][k]){
                    count++;
                }
            }
        }
    }
    println(count);
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1
0
view save

correct output
0
view save

user output
0
view save

Test 2

Verdict: ACCEPTED

input
2
01
10
view save

correct output
0
view save

user output
0
view save

Test 3

Verdict: ACCEPTED

input
2
01
10
view save

correct output
0
view save

user output
0
view save

Test 4

Verdict: ACCEPTED

input
3
011
101
110
view save

correct output
1
view save

user output
1
view save

Test 5

Verdict: ACCEPTED

input
3
010
101
010
view save

correct output
0
view save

user output
0
view save

Test 6

Verdict: ACCEPTED

input
3
000
001
010
view save

correct output
0
view save

user output
0
view save

Test 7

Verdict: ACCEPTED

input
3
011
100
100
view save

correct output
0
view save

user output
0
view save

Test 8

Verdict: ACCEPTED

input
4
0111
1011
1101
1110
view save

correct output
4
view save

user output
4
view save

Test 9

Verdict: ACCEPTED

input
4
0011
0010
1100
1000
view save

correct output
0
view save

user output
0
view save

Test 10

Verdict: ACCEPTED

input
4
0000
0011
0101
0110
view save

correct output
1
view save

user output
1
view save

Test 11

Verdict: ACCEPTED

input
4
0101
1010
0100
1000
view save

correct output
0
view save

user output
0
view save

Test 12

Verdict: ACCEPTED

input
4
0111
1001
1001
1110
view save

correct output
2
view save

user output
2
view save

Test 13

Verdict: ACCEPTED

input
4
0001
0010
0100
1000
view save

correct output
0
view save

user output
0
view save

Test 14

Verdict: ACCEPTED

input
4
0110
1001
1000
0100
view save

correct output
0
view save

user output
0
view save

Test 15

Verdict: ACCEPTED

input
4
0001
0000
0001
1010
view save

correct output
0
view save

user output
0
view save

Test 16

Verdict: ACCEPTED

input
4
0101
1001
0000
1100
view save

correct output
1
view save

user output
1
view save

Test 17

Verdict: ACCEPTED

input
4
0001
0000
0000
1000
view save

correct output
0
view save

user output
0
view save

Test 18

Verdict: ACCEPTED

input
5
01111
10111
11010
11101
...
view save

correct output
7
view save

user output
7
view save

Test 19

Verdict: ACCEPTED

input
5
00111
00000
10010
10100
...
view save

correct output
1
view save

user output
1
view save

Test 20

Verdict: ACCEPTED

input
5
00001
00110
01000
01000
...
view save

correct output
0
view save

user output
0
view save

Test 21

Verdict: ACCEPTED

input
5
01011
10001
00011
10100
...
view save

correct output
1
view save

user output
1
view save

Test 22

Verdict: ACCEPTED

input
5
01110
10111
11011
11101
...
view save

correct output
7
view save

user output
7
view save

Test 23

Verdict: ACCEPTED

input
5
00011
00001
00010
10100
...
view save

correct output
0
view save

user output
0
view save

Test 24

Verdict: ACCEPTED

input
5
01100
10100
11000
00001
...
view save

correct output
1
view save

user output
1
view save

Test 25

Verdict: ACCEPTED

input
5
00010
00011
00001
11000
...
view save

correct output
0
view save

user output
0
view save

Test 26

Verdict: ACCEPTED

input
5
01010
10101
01010
10100
...
view save

correct output
0
view save

user output
0
view save

Test 27

Verdict: ACCEPTED

input
5
00010
00000
00000
10000
...
view save

correct output
0
view save

user output
0
view save

Test 28

Verdict: ACCEPTED

input
10
0111111110
1011000101
1100001110
1100101100
...
view save

correct output
26
view save

user output
26
view save

Test 29

Verdict: ACCEPTED

input
10
0011100010
0000000010
1001110011
1010001001
...
view save

correct output
11
view save

user output
11
view save

Test 30

Verdict: ACCEPTED

input
10
0000111000
0000001100
0000011111
0000001101
...
view save

correct output
7
view save

user output
7
view save

Test 31

Verdict: ACCEPTED

input
10
0101100111
1001000000
0000010000
1100100010
...
view save

correct output
9
view save

user output
9
view save

Test 32

Verdict: ACCEPTED

input
10
0111011111
1010010010
1101011001
1010101100
...
view save

correct output
22
view save

user output
22
view save

Test 33

Verdict: ACCEPTED

input
10
0001100110
0001010100
0001010111
1110000110
...
view save

correct output
11
view save

user output
11
view save

Test 34

Verdict: ACCEPTED

input
10
0110010000
1011011010
1100110110
0100101011
...
view save

correct output
22
view save

user output
22
view save

Test 35

Verdict: ACCEPTED

input
10
0001001101
0001010000
0000011110
1100000101
...
view save

correct output
13
view save

user output
13
view save

Test 36

Verdict: ACCEPTED

input
10
0101010110
1000101001
0001011011
1010101110
...
view save

correct output
8
view save

user output
8
view save

Test 37

Verdict: ACCEPTED

input
10
0001000000
0000100000
0000000010
1000110111
...
view save

correct output
19
view save

user output
19
view save

Test 38

Verdict: ACCEPTED

input
100
011111111011000101000111010110...
view save

correct output
20807
view save

user output
20807
view save

Test 39

Verdict: ACCEPTED

input
100
001110001000000010111001100100...
view save

correct output
21100
view save

user output
21100
view save

Test 40

Verdict: ACCEPTED

input
100
000011100000001100001111100110...
view save

correct output
18556
view save

user output
18556
view save

Test 41

Verdict: ACCEPTED

input
100
010110011101000000001000010001...
view save

correct output
20091
view save

user output
20091
view save

Test 42

Verdict: ACCEPTED

input
100
011101111110010010101100110110...
view save

correct output
21281
view save

user output
21281
view save

Test 43

Verdict: ACCEPTED

input
100
000110011001010100101011100011...
view save

correct output
20746
view save

user output
20746
view save

Test 44

Verdict: ACCEPTED

input
100
011001000011011010011011010101...
view save

correct output
21793
view save

user output
21793
view save

Test 45

Verdict: ACCEPTED

input
100
000100110101010000001111000010...
view save

correct output
19781
view save

user output
19781
view save

Test 46

Verdict: ACCEPTED

input
100
010101011000101001101101110111...
view save

correct output
20006
view save

user output
20006
view save

Test 47

Verdict: ACCEPTED

input
100
000100000000100000000001011011...
view save

correct output
19161
view save

user output
19161
view save

Test 48

Verdict: ACCEPTED

input
1000
011111111011000101000111010110...
view save

correct output
20823418
view save

user output
20823418
view save

Test 49

Verdict: ACCEPTED

input
1000
001110001000000010111001100100...
view save

correct output
20848491
view save

user output
20848491
view save

Test 50

Verdict:

input
2000
010001011010001100000111100111...
view save

correct output
166808034
view save

user output
(empty)

Test 51

Verdict:

input
2000
000010011000001011011110111110...
view save

correct output
165842024
view save

user output
(empty)

Test 52

Verdict:

input
2999
000110011001010001100011110110...
view save

correct output
561389670
view save

user output
(empty)

Test 53

Verdict:

input
3000
011111111111111111111111111111...
view save

correct output
4495501000
view save

user output
(empty)

Tasks

A a times bB Piva and GlassesC Optimal sortD Illuminati

Submissions (aalto26hm_035)

2026-10-26 18:01:38 2026-10-26 18:00:15 2026-10-26 17:50:01 2026-10-26 17:43:52 2026-10-26 17:42:31 2026-10-26 17:39:42 2026-10-26 17:37:56 2026-10-26 17:34:37 2026-10-26 17:22:01 2026-10-26 17:21:14