Submission #516723

#	Time	Username	Problem	Language	Result	Execution time	Memory
516723		KoD	Trobojnica (COCI19_trobojnica)	C++17	110 / 110	53 ms	5964 KiB

trobojnica

#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;
    std::cin >> N;
    vector<int> id(N), label(N), next(N);
    for (int i = 0; i < N; ++i) {
        char c;
        std::cin >> c;
        id[i] = i;
        label[i] = c - '1';
        next[i] = i + 1 == N ? 0 : i + 1;
    }
    array<int, 3> count = {};
    for (const int x : label) {
        count[x] += 1;
    }
    for (const int x : count) {
        if (x == N or x % 2 != N % 2) {
            std::cout << "NE\n";
            return 0;
        }
    }
    std::cout << "DA\n";
    int root = 0;
    for (int step = 0; step < N - 3; ++step) {
        while (label[root] == label[next[root]] or (count[label[root]] == 1 and count[label[next[root]]] == 1)) {
            root = next[root];
        }
        const int x = root;
        const int y = next[x];
        const int z = next[y];
        const int c = 3 - label[x] - label[y];
        std::cout << x + 1 << ' ' << z + 1 << ' ' << c + 1 << '\n';
        count[label[x]] -= 1;
        count[label[y]] -= 1;
        count[c] += 1;
        next[x] = z;
        label[x] = c;
    }
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50