oj.uz

Submission #541650

# Submission time Handle Problem Language Result Execution time Memory
541650 2022-03-24T01:16:40 Z Lobo Love Polygon (BOI18_polygon) C++17
100 / 100
 174 ms 30544 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 id) {
    int mn = inf1;
    mark[u] = id;
    dp[u][0] = 0;

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

        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;
}

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,1);

        int ans1 = min(dp[rt][1],dp[rt][0]+1);

        rt = nx[rt];

        dfs(rt,2);

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

        ans+= ans1;
    }

    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
21.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 5804 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 4 ms 5816 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 3 ms 5812 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5812 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct

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 5804 KB Output is correct
4 Correct 172 ms 27704 KB Output is correct
5 Correct 148 ms 20804 KB Output is correct
6 Correct 168 ms 28708 KB Output is correct
7 Correct 66 ms 13772 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 20308 KB Output is correct
2 Correct 157 ms 22176 KB Output is correct
3 Correct 116 ms 20916 KB Output is correct
4 Correct 69 ms 13872 KB Output is correct
5 Correct 168 ms 28136 KB Output is correct
6 Correct 152 ms 18896 KB Output is correct
7 Correct 168 ms 19648 KB Output is correct
8 Correct 147 ms 19856 KB Output is correct
9 Correct 136 ms 18544 KB Output is correct
10 Correct 87 ms 17824 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5808 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5812 KB Output is correct

Subtask #4
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 5804 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 4 ms 5816 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 3 ms 5812 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5812 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 3 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5804 KB Output is correct
19 Correct 172 ms 27704 KB Output is correct
20 Correct 148 ms 20804 KB Output is correct
21 Correct 168 ms 28708 KB Output is correct
22 Correct 66 ms 13772 KB Output is correct
23 Correct 151 ms 20308 KB Output is correct
24 Correct 157 ms 22176 KB Output is correct
25 Correct 116 ms 20916 KB Output is correct
26 Correct 69 ms 13872 KB Output is correct
27 Correct 168 ms 28136 KB Output is correct
28 Correct 152 ms 18896 KB Output is correct
29 Correct 168 ms 19648 KB Output is correct
30 Correct 147 ms 19856 KB Output is correct
31 Correct 136 ms 18544 KB Output is correct
32 Correct 87 ms 17824 KB Output is correct
33 Correct 3 ms 5716 KB Output is correct
34 Correct 3 ms 5808 KB Output is correct
35 Correct 3 ms 5716 KB Output is correct
36 Correct 3 ms 5812 KB Output is correct
37 Correct 169 ms 22524 KB Output is correct
38 Correct 156 ms 22824 KB Output is correct
39 Correct 146 ms 21624 KB Output is correct
40 Correct 149 ms 21196 KB Output is correct
41 Correct 148 ms 21212 KB Output is correct
42 Correct 155 ms 21812 KB Output is correct
43 Correct 153 ms 21748 KB Output is correct
44 Correct 168 ms 21828 KB Output is correct
45 Correct 148 ms 21740 KB Output is correct
46 Correct 147 ms 21712 KB Output is correct
47 Correct 147 ms 21316 KB Output is correct
48 Correct 142 ms 21964 KB Output is correct
49 Correct 167 ms 24164 KB Output is correct
50 Correct 116 ms 22752 KB Output is correct
51 Correct 69 ms 15668 KB Output is correct
52 Correct 174 ms 30028 KB Output is correct
53 Correct 152 ms 20796 KB Output is correct
54 Correct 140 ms 21460 KB Output is correct
55 Correct 137 ms 21748 KB Output is correct
56 Correct 129 ms 20388 KB Output is correct
57 Correct 91 ms 19800 KB Output is correct
58 Correct 3 ms 5716 KB Output is correct
59 Correct 3 ms 5808 KB Output is correct
60 Correct 3 ms 5716 KB Output is correct
61 Correct 3 ms 5716 KB Output is correct
62 Correct 3 ms 5716 KB Output is correct
63 Correct 3 ms 5716 KB Output is correct
64 Correct 3 ms 5808 KB Output is correct
65 Correct 164 ms 29644 KB Output is correct
66 Correct 150 ms 22836 KB Output is correct
67 Correct 163 ms 30544 KB Output is correct
68 Correct 74 ms 15788 KB Output is correct
69 Correct 3 ms 5804 KB Output is correct
70 Correct 3 ms 5808 KB Output is correct
71 Correct 3 ms 5716 KB Output is correct
72 Correct 3 ms 5716 KB Output is correct
73 Correct 3 ms 5808 KB Output is correct
74 Correct 3 ms 5716 KB Output is correct
75 Correct 3 ms 5716 KB Output is correct
76 Correct 3 ms 5716 KB Output is correct
77 Correct 3 ms 5716 KB Output is correct
78 Correct 3 ms 5716 KB Output is correct
79 Correct 3 ms 5840 KB Output is correct
80 Correct 4 ms 5716 KB Output is correct
81 Correct 3 ms 5716 KB Output is correct
82 Correct 3 ms 5716 KB Output is correct
83 Correct 3 ms 5716 KB Output is correct