제출 #1276299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276299		warrenn	Magenta (COCI21_magenta)	C++20	30 / 110	67 ms	7252 KiB

Main

#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;
    }
}

• Subtask 1: 0 / 30
• Subtask 2: 30 / 30
• Subtask 3: 0 / 50