oj.uz

Submission #256818

# Submission time Handle Problem Language Result Execution time Memory
256818 2020-08-03T08:55:17 Z Pankin Planinarenje (COCI18_planinarenje) C++14
160 / 160
 35 ms 1024 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/*
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("-O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/

#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fs first
#define sc second
#define getfiles ifstream cin("input.txt"); ofstream cout("output.txt");
#define endl '\n'
#define pii pair<int, int>

const int INF = 2000000005;
const ll BIG_INF = 2000000000000000005;
const int mod = 1000000007;
const int P = 31;
const ld PI = 3.141592653589793238462643;
const double eps = 1e-9;

using namespace std;
using namespace __gnu_pbds;

bool valid(int x, int y, int n, int m) {
    return x >= 0 && y >= 0 && x < n && y < m;
}

mt19937 rng(1999999973);

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int N = 5050;

int nxt[N], mt[N], n, m;
bool vis[N];
vector<int> g[N], gr[N];

bool kuhn(int v) {
    if (vis[v])
        return false;
    vis[v] = true;
    for (int i = 0; i < g[v].size(); i++) {
        int to = g[v][i];
        if (mt[to] == -1 || kuhn(mt[to])) {
            mt[to] = v;
            nxt[v] = to;
            return true;
        }
    }
    return false;
}

bool good(int v) {
    if (vis[v])
        return true;
    vis[v] = true;
    for (int i = 0; i < gr[v].size(); i++) {
        int to = gr[v][i];
        if (nxt[to] == -1 || !good(nxt[to]))
            return false;
    }
    return true;
}

signed main() {
    fast_io;

    cin >> n >> m;

    fill(mt, mt + n, -1);
    fill(nxt, nxt + n, -1);

    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        g[u].pb(v);
        gr[v].pb(u);
    }
    for (int i = 0; i < n; i++) {
        fill(vis, vis + n, false);
        kuhn(i);
    }

    for (int i = 0; i < n; i++) {
        fill(vis, vis + n, false);
        if (nxt[i] == -1 || !good(nxt[i]))
            cout << "Mirko" << endl;
        else
            cout << "Slavko" << endl;
    }

    return 0;
}

Compilation message

planinarenje.cpp: In function 'bool kuhn(int)':
planinarenje.cpp:51:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++) {
                     ~~^~~~~~~~~~~~~
planinarenje.cpp: In function 'bool good(int)':
planinarenje.cpp:66:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < gr[v].size(); i++) {
                     ~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 896 KB Output is correct
2 Correct 28 ms 1016 KB Output is correct
3 Correct 22 ms 896 KB Output is correct
4 Correct 27 ms 1024 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 640 KB Output is correct
2 Correct 17 ms 768 KB Output is correct
3 Correct 12 ms 640 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 11 ms 640 KB Output is correct
4 Correct 12 ms 768 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 768 KB Output is correct
2 Correct 24 ms 928 KB Output is correct
3 Correct 8 ms 768 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 768 KB Output is correct
2 Correct 14 ms 1024 KB Output is correct
3 Correct 6 ms 796 KB Output is correct
4 Correct 35 ms 768 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 896 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 15 ms 896 KB Output is correct
4 Correct 26 ms 896 KB Output is correct