This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
long long n, a, b, x, y, tree[100001];
string s;
vector<long long> vec[100001];
void DFS(long long id, long long vck, long long val)
{
tree[id] = val;
for(int c : vec[id])
{
if(c != vck)
{
DFS(c, id, val + 1);
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
for(int i = 1; i < n; i++)
{
cin >> x >> y >> s;
vec[x].push_back(y);
vec[y].push_back(x);
}
DFS(a, 0, 0);
if(tree[b] % 2 == 1)
{
cout << "Marin";
}
else
{
cout << "Paula";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |