oj.uz

Submission #813279

# Submission time Handle Problem Language Result Execution time Memory
813279 2023-08-07T14:58:52 Z Tunglam07 Magenta (COCI21_magenta) C++17
30 / 110
 36 ms 9084 KB 
#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";
	}
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 8496 KB Output is correct
2 Correct 34 ms 9080 KB Output is correct
3 Correct 31 ms 9060 KB Output is correct
4 Correct 33 ms 9084 KB Output is correct
5 Correct 33 ms 8968 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -