#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e5;
int dist[maxn+2];
vector<int>adj[maxn+2];
void dfs(int cur,int par){
for(auto x : adj[cur]){
if(x==par)continue;
dist[x]=dist[cur]+1;
dfs(x,cur);
}
}
signed main(){
int n;
cin>>n;
int a,b;
cin>>a>>b;
for(int q=1;q<n;q++){
int u,v;
cin>>u>>v;
string s;
cin>>s;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(a,-1);
if(dist[b]%2==0){
cout<<"Paula"<<endl;
}
else{
cout<<"Marin"<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |