제출 #299130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299130		jovan_b	Planinarenje (COCI18_planinarenje)	C++17	160 / 160	38 ms	1272 KiB

planinarenje

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

vector <int> rgraf[10005];
vector <int> graf[10005];
int mt[10005];
bool used[10005];
int ime[10005];

bool bp(int v) {
	if (used[v])  return false;
	used[v] = true;
	for (auto c : graf[v]) {
		if(!mt[c] || bp(mt[c])) {
			mt[c] = v;
			ime[v] = c;
			return true;
		}
	}
	return false;
}

bool bio[10005];

bool good(int v) {
    if(used[v]) return true;
    used[v] = true;
    for (auto c : rgraf[v]) {
        if (!ime[c] || !good(ime[c])) return false;
    }
    return true;
}

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int a, b;
        cin >> a >> b;
        graf[a].push_back(b);
        rgraf[b].push_back(a);
    }
    int mxm = 0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++) used[j] = 0;
        mxm += bp(i);
    }
    for(int i=1; i<=n; i++){
        if(!ime[i]){
            cout << "Mirko\n";
            continue;
        }
        for(int j=1; j<=n; j++){
            used[j] = 0;
        }
        if(good(ime[i])) 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: 16 / 16
• Subtask 9: 16 / 16
• Subtask 10: 16 / 16