oj.uz

Submission #541622

# Submission time Handle Problem Language Result Execution time Memory
541622 2022-03-23T21:52:19 Z Lobo Love Polygon (BOI18_polygon) C++17
54 / 100
 188 ms 28592 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 1e5+10;

int n, nx[maxn], mark[maxn], markc[maxn], dp[maxn][2];
string nxstring[maxn];
vector<int> ginv[maxn];

int dfscyc(int u) {
    if(markc[u]) return u;
    markc[u] = 1;
    return dfscyc(nx[u]);
}

void dfs(int u) {
    int mn = inf1;
    mark[u] = 1;

    for(auto v : ginv[u]) {
        if(mark[v]) continue;
        dfs(v);

        dp[u][0]+= min(dp[v][1],dp[v][0]+1);
        mn = min(mn, dp[v][0] - min(dp[v][1],dp[v][0]+1));
        if(nx[u] == v) mn = min(mn, dp[v][0]-1 - min(dp[v][1],dp[v][0]+1));
    }

    dp[u][1] = dp[u][0]+mn+1;
    // cout << u << " " << dp[u][0] << " " << dp[u][1] << endl;
}

void solve() {
    cin >> n;

    map<string,int> cc;
    for(int i = 1; i <= n; i++) {
        string s1,s2; cin >> s1 >> s2;

        cc[s1] = i;
        nxstring[i] = s2;
    }

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

    for(int i = 1; i <= n; i++) {
        nx[i] = cc[nxstring[i]];
        // cout << i << " " << nx[i] << endl;
        ginv[nx[i]].pb(i);
    }

    int ans = 0;
    for(int i = 1; i <= n; i++) {
        if(mark[i]) continue;
        int rt = dfscyc(i);
        // cout << rt << " root " << endl;
        dfs(rt);


        ans+= min(dp[rt][1],dp[rt][0]+1);
    }

    cout << ans << endl;

}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
0 / 21.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 188 ms 27340 KB Output is correct
5 Correct 149 ms 20652 KB Output is correct
6 Correct 178 ms 28592 KB Output is correct
7 Correct 77 ms 13500 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 19904 KB Output is correct
2 Correct 142 ms 21908 KB Output is correct
3 Correct 132 ms 20536 KB Output is correct
4 Correct 74 ms 13564 KB Output is correct
5 Correct 145 ms 27928 KB Output is correct
6 Correct 140 ms 18736 KB Output is correct
7 Correct 151 ms 19396 KB Output is correct
8 Correct 135 ms 19616 KB Output is correct
9 Correct 145 ms 18304 KB Output is correct
10 Correct 94 ms 17644 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct

Subtask #4
0 / 25.0

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