oj.uz

Submission #1018985

# Submission time Handle Problem Language Result Execution time Memory
1018985 2024-07-10T11:32:54 Z vjudge1 Planinarenje (COCI18_planinarenje) C++17
48 / 160
 1000 ms 932 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=10005;
int const mod=1e9+7;
int n,m;
vector<int> adj[N];
bool state[N];
bool vis[N];
void dfs(int node,int par){
	if(node<=n)
		state[node]=1;
	vis[node]=1;
	for(int i:adj[node]){
		if(vis[i]==0)
			dfs(i,node);
	}
	vis[node]=0;
	if(node<=n){
		for(int i:adj[node])
			if(vis[i]==0 && state[i]==0){
				state[node]=0;
				return;
			}
	}
	else{
		for(int i:adj[node])
			if(vis[i]==0 && state[i]==1){
				state[node]=1;
				return;
			}
	}
}

int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int a,b;
		cin>>a>>b;
		b+=n;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	for(int i=1;i<=n;i++){
		for(int j=0;j<=2*n;j++){
			state[j]=0;
			vis[j]=0;
		}
		dfs(i,0);
		if(state[i])
			cout<<"Mirko"<<endl;
		else
			cout<<"Slavko"<<endl;
	}
	return 0;
}

Subtask #1
0 / 16.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 600 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 9 ms 932 KB Output is correct
2 Correct 9 ms 860 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 9 ms 856 KB Output is correct

Subtask #6
0 / 16.0

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

Subtask #7
0 / 16.0

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

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1027 ms 856 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 1050 ms 860 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 1058 ms 604 KB Time limit exceeded
2 Halted 0 ms 0 KB -