제출 #169982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169982		darklight256	Planinarenje (COCI18_planinarenje)	C++17	0 / 160	277 ms	262148 KiB

planinarenje

//
//  pl.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;

vector<int> adj[MXN];
int mch[MXN], n, m;
bool vs[MXN], mchd[MXN], wn[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[u] && dfs(mch[u]))) {
            mch[u] = v;
            mchd[v] = 1;
            return 1;
        }
    return 0;
}

void mm() {
    for (int i = 0; i < n; i++) {
        memset(vs, 0, sizeof vs);
        dfs(i);
    }
}

void slv() {
    memset(vs, 0, sizeof vs);
    for (int i = 0; i < n;  i++)
        if (!mchd[i])
            dfs(i);
    for (int i = 0; i < n; i++)
        if (!vs[i])
            cout << "Slavko\n";
        else
            cout << "Mirko\n";
}

int main() {
    memset(mch, -1, sizeof mch);
    npt();
    mm();
    slv();
    return 0;
}

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