oj.uz

Submission #923718

# Submission time Handle Problem Language Result Execution time Memory
923718 2024-02-07T15:44:04 Z TahirAliyev Love Polygon (BOI18_polygon) C++17
29 / 100
 260 ms 38224 KB 
#include <bits/stdc++.h>

#define ll long long
using namespace std;
#define pii pair<ll, ll>
ll oo = 1e9 + 9;
int n, m, k;
const int MAX = 4e5 + 5, MOD = 1e9 + 7, LOGMAX = 25;

vector<int> g[MAX];
map<string, int> mp;
int par[MAX];
bool vis[MAX];
int sub[MAX];


int dp[MAX][2];

void dfs(int node, int p){
    sub[node] = 1;
    vis[node] = 1;
    int sum = 0;
    for(int to : g[node]){
        if(p == to) continue;
        dfs(to, node);
        sub[node] += sub[to];
        sum += dp[to][0];
    }
    dp[node][1] = sum + 1;
    for(int to : g[node]){
        if(p == to) continue;
        dp[node][0] = max(dp[to][1] + (sum - dp[to][0]), dp[node][0]);
    }
}

void solve(){
    cin >> n;
    int c = 1;
    for(int i = 1; i <= n; i++){
        string a, b; cin >> a >> b;
        if(!mp[a]) mp[a] = c++;
        if(!mp[b]) mp[b] = c++;
        g[mp[b]].push_back(mp[a]);
        par[mp[a]] = mp[b];
    }
    if(n & 1){
        cout << "-1\n";
        return;
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        if(par[i] == i){
            dfs(i, i);
            ans += sub[i] - dp[i][0];
        }
    }
    cout << ans << '\n';
}

signed main(){
    int t = 1;
    for(int i = 1; i <= t; i++){
        solve();
    }
}

Subtask #1
0 / 21.0

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

Subtask #2
0 / 25.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 28808 KB Output is correct
2 Correct 241 ms 30920 KB Output is correct
3 Correct 198 ms 29520 KB Output is correct
4 Correct 221 ms 23712 KB Output is correct
5 Correct 260 ms 38224 KB Output is correct
6 Correct 230 ms 27876 KB Output is correct
7 Correct 226 ms 27988 KB Output is correct
8 Correct 219 ms 28244 KB Output is correct
9 Correct 210 ms 27468 KB Output is correct
10 Correct 165 ms 26824 KB Output is correct
11 Correct 3 ms 14172 KB Output is correct
12 Correct 3 ms 14172 KB Output is correct
13 Correct 3 ms 14172 KB Output is correct
14 Correct 4 ms 14268 KB Output is correct

Subtask #4
0 / 25.0

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