oj.uz

답안 #485567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485567 2021-11-08T10:43:22 Z sam571128 Love Polygon (BOI18_polygon) C++17
29 / 100
 265 ms 26464 KB 
#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e5+5;
int visited[N], arr[N], sz[N], dp[N][2], col[N], ok[N];
vector<int> adj[N];


void dfs(int u, int p){
    visited[u] = 1;
    sz[u] = 1;
    int sum = 0;
    for(auto v : adj[u]){
        if(v==p || visited[v]) continue;
        dfs(v,u);
        sum += dp[v][0];
        sz[u] += sz[v];
    }
    dp[u][1] = sum+1;

    int mx = 0;
    for(auto v : adj[u]){
        if(v==p) continue;
        mx = max(dp[v][1]-dp[v][0],mx);
    }
    dp[u][0] = mx+dp[u][1]-1;
}

int idx;
map<string,int> m;

int assign(string x){
    if(m.find(x)==m.end()){
        m[x] = idx++;
    }
    return m[x];
}

signed main(){
    fastio
    int n;
    cin >> n;

    for(int i = 0;i < n;i++){
        string a,b;
        cin >> a >> b;
        int x = assign(a);
        int y = assign(b);
        arr[x] = y;
        if(x==y) continue;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    if(n%2){
        cout << -1 << "\n";
        return 0;
    }

    for(int i = 0; i < n; i++){
        if(arr[arr[i]]==i){
            if(adj[arr[i]].size()==2){
                ok[i] = 1;
                visited[arr[i]] = 1;
            }else{
                ok[arr[i]] = 1;
                visited[i] = 1;
            }  
        }
    }

    int ans = 0;
    for(int i = 0; i < n; i++){
        if(arr[i]==i){
            dfs(i,i);
            ans += sz[i]-dp[i][0];
        }
    }

    for(int i = 0; i < n; i++){
        if(!visited[i]){
            dfs(i,i);
            if(ok[i]){
                ans += sz[i]-dp[i][1];
            }else{
                ans += sz[i]-max(dp[i][0],dp[i][1]);
            }
        }
    }


    cout << ans << "\n";
}

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Incorrect 2 ms 2636 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Incorrect 245 ms 26464 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 19744 KB Output is correct
2 Correct 263 ms 21044 KB Output is correct
3 Correct 141 ms 16692 KB Output is correct
4 Correct 222 ms 16528 KB Output is correct
5 Correct 238 ms 26264 KB Output is correct
6 Correct 227 ms 19608 KB Output is correct
7 Correct 248 ms 20276 KB Output is correct
8 Correct 185 ms 19048 KB Output is correct
9 Correct 265 ms 19828 KB Output is correct
10 Correct 148 ms 19936 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Incorrect 2 ms 2636 KB Output isn't correct
8 Halted 0 ms 0 KB -