oj.uz

Submission #299086

# Submission time Handle Problem Language Result Execution time Memory
299086 2020-09-14T13:13:00 Z jovan_b Planinarenje (COCI18_planinarenje) C++17
96 / 160
 1000 ms 888 KB 
#include <bits/stdc++.h>
using namespace std;

vector <int> graf[10005];
int mt[10005];
bool used[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;
			return true;
		}
	}
	return false;
}

bool bio[10005];

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);
    }
    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++){
        bio[mt[i]] = 1;
    }
    for(int i=1; i<=n; i++){
        if(!bio[i]){
            cout << "Mirko\n";
            continue;
        }
        int tren = 0;
        for(int j=1; j<=n; j++) mt[j] = 0;
        for(int j=1; j<=n; j++){
            if(j == i) continue;
            for(int k=1; k<=n; k++) used[k] = 0;
            tren += bp(j);
        }
        if(tren-mxm) cout << "Slavko\n";
        else cout << "Mirko\n";
    }
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 632 KB Output is correct
2 Correct 30 ms 512 KB Output is correct
3 Correct 48 ms 512 KB Output is correct
4 Correct 50 ms 632 KB Output is correct

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 760 KB Output is correct
2 Correct 256 ms 640 KB Output is correct
3 Correct 307 ms 760 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 640 KB Output is correct
2 Correct 930 ms 888 KB Output is correct
3 Correct 358 ms 760 KB Output is correct
4 Correct 152 ms 640 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -