oj.uz

Submission #1031341

# Submission time Handle Problem Language Result Execution time Memory
1031341 2024-07-22T18:11:19 Z codexistent Love Polygon (BOI18_polygon) C++14
0 / 100
 237 ms 25064 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define f first
#define s second

int n, d[MAXN], pn[MAXN], vd[MAXN], gn = 0, gi = 0, r = 0;
string s[MAXN];
pair<string, string> e[MAXN];
map<string, int> pos;
vector<int> ie[MAXN];

stack<int> sk;
set<int> st;

void dfs(int i){
    if(d[i] >= 0 && vd[i] != gn) return;
    d[i] = 0, vd[i] = gn;

    if(st.find(i) != st.end()){
        //cout << "NEVAH!" << endl;
        int prv = i;
        while(sk.top() != i){
            d[sk.top()] = gn;
            pn[prv] = sk.top();
            sk.pop();
        }
        d[sk.top()] = gn;
        sk.pop();
        return;
    }
    st.insert(i);
    sk.push(i);

    /*cout << "at " << e[i].f << "/" << i << " we have the set: " << endl;
    for(int i : st){
        cout << " => " << i << endl;
    } */
    
    dfs(pos[e[i].s]);
}

int main(){
    cin >> n;
    FOR(i, 1, n) {
        cin >> e[i].f >> e[i].s;
        s[i] = e[i].f;
        pos.insert({s[i], i});
        d[i] = -1;
    }

    if(n % 2 == 1) {
        cout << -1 << endl;
        return 0;
    }

    FOR(i, 1, n){
        ie[pos[e[i].s]].push_back(i); 
        if(pos[e[pos[e[i].s]].s] == i){
            d[i] = -2;
        }
    }

    FOR(i, 1, n){  
        if(d[i] == -1){
            gn++, dfs(i);
            stack<int>().swap(sk), st.clear();
        }
    }
    /*FOR(i, 1, n){
        cout << e[i].f << " " << d[i] << endl;
    }*/

    //cout << "A NEW CHAPTR " << endl;
    int l = 0;
    FOR(i, 1, n){
        if(ie[i].size() == 0 && d[i] >= 0){
            //cout << e[i].f << endl;
            int prv = i;
            bool cnx = true;
            while(d[pos[e[i].s]] == 0){
                if(cnx){
                    d[prv] = d[pos[e[i].s]] = -1;
                    r++;
                    cnx = false;
                }else{
                    prv = pos[e[i].s];
                    cnx = true;
                }
            }

            //cout << e[prv].f << " " << cnx << endl;

            if(cnx){
                if(d[pos[e[i].s]] >= 1){
                    d[pos[e[i].s]] = d[i] = -1;
                    r++;
                }else{
                    l++;
                }
            }
            //cout << " RES IS NOW " << r << "!" << endl;
        }
    }

    //cout << "FINAL CHAPTER!: " << endl;
    FOR(i, 1, n){
        if(d[i] >= 1){
            d[i] = -1;
            int sc = 1, a = i, b = i;
            while(d[pn[a]] >= 1 && pn[a] != b) {
                a = pn[a];
                d[a] = -1;
                sc++;
            }
            while(d[pos[e[b].s]] >= 1 && pos[e[b].s] != a) {
                b = pos[e[b].s];
                d[b] = -1;
                sc++;
            }

            //cout << sc << " ... " << e[a].f << " -> " << e[b].f << endl;

            r += sc / 2;
            if(sc % 2){
                l++;
            }
        }
    }

    cout << (r + l) << endl;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 12124 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 237 ms 25064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 12124 KB Output isn't correct
2 Halted 0 ms 0 KB -