Submission #170001

#	Time	Username	Problem	Language	Result	Execution time	Memory
170001		darklight256	Planinarenje (COCI18_planinarenje)	C++14	160 / 160	9 ms	632 KiB

planinarenje

//
//  fstmm.cpp
//  Code
//
//  Created by Mohammadreza Raddanipour on 12/23/19.
//  Copyright © 2019 Mohammadreza Raddanipour. All rights reserved.
//

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

const int MXN = 5e3 + 20;

int n, m, mch[MXN];
vector<int> adj[MXN];
bool mchd[MXN], vs[MXN];

void npt() {
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adj[--u].push_back(--v);
    }
}

bool dfs(int v) {
    vs[v] = 1;
    for (auto u: adj[v])
        if (mch[u] == -1 || (!vs[mch[u]] && dfs(mch[u]))) {
            mch[u] = v;
            mchd[v] = 1;
            return 1;
        }
    return 0;
}

void mm() {
    for (bool flg = 1; flg;) {
        memset(vs, 0, sizeof vs);
        flg = 0;
        for (int i = 0; i < n; i++)
            if (!vs[i] && !mchd[i])
                flg |= dfs(i);
    }
}

int main() {
    memset(mch, -1, sizeof mch);
    npt();
    mm();
    for (int i = 0; i < n; i++)
        if (!vs[i])
            cout << "Slavko\n";
        else
            cout << "Mirko\n";
}

• 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: 16 / 16
• Subtask 9: 16 / 16
• Subtask 10: 16 / 16