Submission #1273169

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273169		minhvule	Magenta (COCI21_magenta)	C++17	110 / 110	43 ms	7420 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define task "Magenta"
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; i ++)
#define FORD(i, a, b) for(int i = (a), _b = (b); i >= _b; i --)
#define bit(x, i) ((x >> i) & 1)
#define oo 1e18
#define all(v) v.begin(), v.end()

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
// mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
// ll rand(ll l, ll r) { assert(l <= r); return uniform_int_distribution<ll>(l, r)(rd); }
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int base = 31;
int n, s[2], dist[2][N], d = 0;
bool can[2], runner;
vector<pii> g[N];
int col(string s){
    if(s == "plava") return 0;
    if(s == "crvena") return 1;
    return 2;
}
void outp(int t){
    if(t == 0) cout<<"Paula";
    if(t == 1) cout<<"Marin";
    if(t == 2) cout<<"Magenta";
    exit(0);
}
void dfs(int cur, int u, int p){
    for(auto [v, color] : g[u]) if(v != p){
        if(v == s[cur ^ 1]) d = dist[cur][u] + 1;
        if(color == (cur ^ 1)) continue;
        dist[cur][v] = dist[cur][u] + 1;
        dfs(cur, v, u);
    }
}
bool hide(int u, int p){
    bool ans = 0;
    for(auto [v, color] : g[u]) if(v != p){
        if(color == (runner ^ 1) || (dist[runner ^ 1][v] != -1 && dist[runner ^ 1][v] <= dist[runner][v])) continue;
        if(dist[runner ^ 1][u] == -1 && dist[runner ^ 1][v] == -1)
            return 1;
        ans |= hide(v, u);
    }
    return ans;
}
void solve(){
    cin>>n>>s[0]>>s[1];
    FOR(i, 1, n - 1){
        int x, y; string color; cin>>x>>y>>color;
        int c = col(color);
        g[x].pb({y, c});
        g[y].pb({x, c});
        if(c != 1 && (x == s[0] && y != s[1] || y == s[0] && x != s[1]))
            can[0] = 1;
        if(c != 0 && (x == s[1] || y == s[1]))
            can[1] = 1;
    }
    if(!can[0]) outp(1);
    if(!can[1]) outp(0);
    memset(dist, -1, sizeof dist);
    FOR(i, 0, 1){
        dist[i][s[i]] = 0;
        dfs(i, s[i], 0);
    }
    runner = (d % 2) ^ 1;
    if(hide(s[runner], 0)) outp(2);
    outp(runner ^ 1);
}
int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int nTest = 1;
    // cin>>nTest;
    while(nTest --) solve();
    // cerr << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
    return 0;
}
/*



*/

Compilation message (stderr)

Main.cpp: In function 'int32_t main()':
Main.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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