제출 #978605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978605		bebra	Planinarenje (COCI18_planinarenje)	C++17	144 / 160	1067 ms	852 KiB

planinarenje

#include <bits/stdc++.h>
using namespace std;

#define dbg(x) cerr << #x << ": " << x << endl;


const int MAX_N = 5000 + 5;
vector<int> g[MAX_N];
int used[MAX_N];
int match[MAX_N];
int timer = 0;

bool dfs(int v) {
    if (used[v] == timer) {
        return false;
    }

    used[v] = timer;

    for (auto u : g[v]) {
        if (match[u] == -1) {
            match[u] = v;
            return true;
        }
    }

    for (auto u : g[v]) {
        if (dfs(match[u])) {
            match[u] = v;
            return true;
        }
    }

    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;

        g[u].push_back(v);
    }

    memset(match, -1, sizeof(match));

    int cnt = 0;
    for (int v = 0; v < n; ++v) {
        ++timer;
        cnt += dfs(v);
    }

    for (int i = 0; i < n; ++i) {
        int curr = 0;
        memset(match, -1, sizeof(match));
        for (int v = 0; v < n; ++v) {
            if (v == i) continue;

            ++timer;
            curr += dfs(v);
        }

        if (curr < cnt) {
            cout << "Slavko\n";
        } else {
            cout << "Mirko\n";
        }
    }

    return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 16 / 16
• Subtask 4: 16 / 16
• Subtask 5: 16 / 16
• Subtask 6: 16 / 16
• Subtask 7: 16 / 16
• Subtask 8: 0 / 16
• Subtask 9: 16 / 16
• Subtask 10: 16 / 16