Submission #46271700


Source Code Expand

#include <bits/stdc++.h>

void solve(std::istream& is, std::ostream& os) {
    using Num = long long int;
    Num n{0};
    Num m {0};
    is >> n >> m;

    std::vector<Num> cnt(m+1);
    for(Num i{0}; i<n; ++i) {
        std::string s;
        is >> s;
        cnt.at(std::count(s.begin(), s.end(), '1')) += 1;
    }

    Num total {0};
    for(Num i{0}; i<=m; ++i) {
        for(Num j{i+1}; j<=m; j+=2) {
            total += cnt.at(i) * cnt.at(j);
        }
    }

    os << total << "\n";
    return;
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Submission Time
Task A - Two Choices
User zettsut
Language C++ 20 (gcc 12.2)
Score 300
Code Size 606 Byte
Status AC
Exec Time 34 ms
Memory 3676 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 26
Set Name Test Cases
Sample sample00, sample01
All case02, case03, case04, case05, case06, case07, case08, case09, case10, case11, case12, case13, case14, case15, case16, case17, case18, case19, case20, case21, case22, case23, case24, case25, sample00, sample01
Case Name Status Exec Time Memory
case02 AC 26 ms 3676 KiB
case03 AC 2 ms 3544 KiB
case04 AC 2 ms 3488 KiB
case05 AC 1 ms 3460 KiB
case06 AC 2 ms 3476 KiB
case07 AC 26 ms 3596 KiB
case08 AC 2 ms 3512 KiB
case09 AC 1 ms 3492 KiB
case10 AC 1 ms 3480 KiB
case11 AC 33 ms 3456 KiB
case12 AC 33 ms 3540 KiB
case13 AC 34 ms 3520 KiB
case14 AC 32 ms 3536 KiB
case15 AC 33 ms 3452 KiB
case16 AC 1 ms 3540 KiB
case17 AC 1 ms 3588 KiB
case18 AC 1 ms 3512 KiB
case19 AC 1 ms 3476 KiB
case20 AC 1 ms 3512 KiB
case21 AC 33 ms 3540 KiB
case22 AC 33 ms 3516 KiB
case23 AC 33 ms 3540 KiB
case24 AC 33 ms 3460 KiB
case25 AC 33 ms 3520 KiB
sample00 AC 1 ms 3456 KiB
sample01 AC 1 ms 3516 KiB