제출 #1018695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018695		vjudge1	Planinarenje (COCI18_planinarenje)	C++17	48 / 160	170 ms	1208 KiB

planinarenje

#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] = false;
    }
  return 0; 
}

• Subtask 1: 0 / 16
• Subtask 2: 16 / 16
• Subtask 3: 0 / 16
• Subtask 4: 16 / 16
• Subtask 5: 16 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16