Submission #522849

#	Time	Username	Problem	Language	Result	Execution time	Memory
522849		KoD	Sajam (COCI18_sajam)	C++17	90 / 90	127 ms	1416 KiB

sajam

#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, K;
    std::cin >> N >> K;
    vector<std::bitset<1000>> B(N);
    for (auto& x : B) {
        for (int i = 0; i < N; ++i) {
            char c;
            std::cin >> c;
            if (c == 'o') {
                x.set(i);
            }
        }
    }
    const auto cost = [&](const int i, const int j) {
        const int dif = (B[i] ^ B[j]).count();
        return std::min(dif, N - dif);
    };
    for (int i = 0; i < N; ++i) {
        int sum = 0;
        for (int j = 0; j < N; ++j) {
            sum += cost(i, j);
        }
        if (sum <= K) {
            std::cout << "DA\n";
            return 0;
        }
    }
    for (int i = 0; i < N; ++i) {
        B[0].flip(i);
        int sum = 1;
        for (int j = 0; j < N; ++j) {
            sum += cost(0, j);
        }
        B[0].flip(i);
        if (sum <= K) {
            std::cout << "DA\n";
            return 0;
        }
    }
    std::cout << "NE\n";
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 15 / 15