oj.uz

Submission #1018697

# Submission time Handle Problem Language Result Execution time Memory
1018697 2024-07-10T08:33:51 Z vjudge1 Planinarenje (COCI18_planinarenje) C++17
48 / 160
 150 ms 1024 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 5005 * 2;
int n, m;
vector<int> G[N];
bool seen[N], path[N], s[N];

bool dfs(int v)
{
  seen[v] = path[v] = true;
  bool dead = true, l = false;
  for(int u : G[v])
    {
      if(seen[u] && path[u]) continue;
      dead = false;
      if(!seen[u])
	s[u] = dfs(u);
      l |= !s[u];
    }
  path[v] = false;
  if(dead) return false;
  return l;
}


int main()
{
  cin >> n >> m;
  for(int i = 0; i < m ; i++)
    {
      int u, v;
      cin >> u >> v;
      v += n;
      G[u].push_back(v);
      G[v].push_back(u);
    }

  for(int i = 1; i <= n; i ++)
    {
      cout << (dfs(i) ? "Slavko" : "Mirko") << "\n";
      for(int j = 1; j <= 2 * n; j ++)
	seen[j] = path[j] = false;
    }
  return 0; 
}

Subtask #1
0 / 16.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 604 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 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 4 ms 1016 KB Output is correct
3 Correct 6 ms 860 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct

Subtask #6
0 / 16.0

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

Subtask #7
0 / 16.0

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

Subtask #8
0 / 16.0

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

Subtask #9
0 / 16.0

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

Subtask #10
0 / 16.0

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