oj.uz

Submission #377079

# Submission time Handle Problem Language Result Execution time Memory
377079 2021-03-13T01:17:50 Z Pichon5 Magenta (COCI21_magenta) C++17
30 / 110
 128 ms 8300 KB 
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//gcd(a,b)=gcd(a-b,b) a>=b
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
//__builtin_popcount(x)

using namespace std;
vector<vi>G;
vi dis;
void dfs(int nodo, int d, int p){
    dis[nodo]=d;
    for(auto it : G[nodo]){
        if(it!=p){
            dfs(it,d+1,nodo);
        }
    }
}
int main()
{
    int n,a,b,x,y;
    cin>>n>>a>>b;
    G.assign(n+1,vi());
    dis.resize(n+1);
    string s;
    for(int i=1;i<n;i++){
        cin>>x>>y;
        cin>>s;
        G[x].pb(y);
        G[y].pb(x);
    }
    dfs(a,0,-1);
    if(dis[b]%2){
        cout<<"Marin"<<endl;
    }else{
        cout<<"Paula"<<endl;
    }
    

    return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 256 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 122 ms 8172 KB Output is correct
2 Correct 119 ms 8300 KB Output is correct
3 Correct 119 ms 8300 KB Output is correct
4 Correct 128 ms 8172 KB Output is correct
5 Correct 119 ms 8172 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 256 KB Output is correct

Subtask #3
0 / 50.0

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