oj.uz

Submission #242351

# Submission time Handle Problem Language Result Execution time Memory
242351 2020-06-27T09:19:24 Z Vimmer Planinarenje (COCI18_planinarenje) C++14
32 / 160
 16 ms 896 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("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 200101
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

bool mk[5005], mkr[5005];

vector <int> g[5005], vr[5005];

bool rec(int v, bool f)
{
    if (f)
    {
        mk[v] = 1;

        for (auto it : g[v])
        {
            if (mkr[it]) continue;

            if (!rec(it, !f)) return 1;
        }

        mk[v] = 0;

        return 0;
    }
    else
    {
        mkr[v] = 1;

        for (auto it : vr[v])
        {
            if (mk[it]) continue;

            if (!rec(it, !f)) return 1;
        }

        mkr[v] = 0;

        return 0;
    }
}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m;

    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);

        vr[y].pb(x);
    }

    for (int i = 1; i <= n; i++) if (!rec(i, 1)) cout << "Mirko" << endl; else cout << "Slavko" << endl;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Incorrect 5 ms 512 KB Output isn't correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
16.0 / 16.0

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

Subtask #5
16.0 / 16.0

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

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -