oj.uz

Submission #366343

# Submission time Handle Problem Language Result Execution time Memory
366343 2021-02-14T03:33:13 Z ajpiano Magenta (COCI21_magenta) C++17
110 / 110
 93 ms 7768 KB 
#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second

typedef long long ll;
typedef pair<int,int> pi;

const int large = 1e5+1;
const int inf = 1e9;
vector<pi> edges[large];

//Marin safe or Paula safe
bool ms = 0, ps = 0;

vector<int> distm, distp, d;

void df(int node, int par, int dist, vector<int> &cur, int bad){
    cur[node] = dist;
    for(auto &a: edges[node]){
        if(a.f == par) continue;
        if(a.s == bad) continue;
        df(a.f,node,dist+1,cur,bad);
    }

}
//inf node, found ans
bool draw(int node, int par, vector<int> &d1, vector<int> &d2, int add){
    bool found = 0;
    bool ans = 0;
    for(auto &a: edges[node]){
        if(a.f == par) continue;
        if(d1[a.f] == inf) continue;
        if(d1[a.f] >= d2[a.f]+add) continue;
        ans |= draw(a.f,node,d1,d2,add);
        found |= (d2[a.f] == inf);
    }
    if(d2[node] == inf && found == 1) ans = 1;
    return ans;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    distm.resize(n+1, inf); distp.resize(n+1, inf); d.resize(n+1, inf);
    int a, b; cin >> a >> b;
    for(int i = 0; i < n-1; i++){
        int x,y; cin >> x >> y;
        string c; int col; cin >> c;
        if(c == "plava") col = 0;
        else if(c == "crvena") col = 1;
        else col = 2;
        edges[x].push_back({y,col});
        edges[y].push_back({x,col});
    }
    //check alone
    bool good = 0;
    for(auto &e: edges[a]){
        if(e.s != 1 && e.f != b){
            good = 1; break;
        }
    }
    if(!good){
        cout << "Marin\n"; return 0;
    }
    good = 0;
    for(auto &e: edges[b]){
        if(e.s != 0){
            good = 1; break;
        }
    }
    if(!good){
        cout << "Paula\n"; return 0;
    }
    //fill out distances
    df(a,0,0,distp,1);
    df(b,0,0,distm,0);
    df(a,0,0,d,5);
    //check odd or even
    if(d[b]&1) ms = 1;
    else ps = 1;
    //check if draw
    if(ps == 0){
        bool ans = draw(a,0,distp,distm,1);
        if(ans == 0) cout << "Marin\n";
        else cout << "Magenta\n";
    }
    else if(ms == 0){
        bool ans = draw(b,0,distm,distp,0);
        if(ans == 0) cout << "Paula\n";
        else cout << "Magenta\n";
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 7532 KB Output is correct
2 Correct 88 ms 7532 KB Output is correct
3 Correct 91 ms 7532 KB Output is correct
4 Correct 85 ms 7768 KB Output is correct
5 Correct 80 ms 7532 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 93 ms 7532 KB Output is correct
15 Correct 88 ms 7532 KB Output is correct
16 Correct 91 ms 7532 KB Output is correct
17 Correct 85 ms 7768 KB Output is correct
18 Correct 80 ms 7532 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 3 ms 2668 KB Output is correct
24 Correct 2 ms 2668 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 2 ms 2668 KB Output is correct
27 Correct 2 ms 2668 KB Output is correct
28 Correct 2 ms 2668 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2668 KB Output is correct
31 Correct 54 ms 7532 KB Output is correct
32 Correct 54 ms 7532 KB Output is correct
33 Correct 63 ms 7532 KB Output is correct
34 Correct 61 ms 7532 KB Output is correct