Submission #233096

#	Time	Username	Problem	Language	Result	Execution time	Memory
233096		HeydarBABA	Planinarenje (COCI18_planinarenje)	C++14	160 / 160	29 ms	896 KiB

planinarenje

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

const int maxn = 5e3 + 10;

int n, m;
int par[maxn];
bool mark[maxn];
string ans[maxn];
vector<int> adj[maxn];

void in();
void solve();
bool can(int);
void out();

int main(){
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    in();
    solve();
    out();
}

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

void solve(){
    memset(par, -1, sizeof par);
    for(int i = 0; i < n; i++){
        can(i);
        memset(mark, 0, sizeof mark);
    }
    for(int i = 0; i < n; i++){
        ans[i] = "Slavko\n";
        if(par[i] == -1)
            ans[i] = "Mirko\n";
        else{
            memset(mark, 0, sizeof mark);
            mark[i] = 1;
            if(can(par[i])){
                par[i] = -1;
                ans[i] = "Mirko\n";
            }
        }
    }
}

bool can(int u){
    for(auto v: adj[u]){
        if(!mark[v]){
            mark[v] = 1;
            if(par[v] == -1 || can(par[v])){
                par[v] = u;
                return 1;
            }
        }
    }
    return 0;
}

void out(){
    for(int i = 0; i < n; i++)
        cout << ans[i];
}

• 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