oj.uz

답안 #863468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863468 2023-10-20T12:00:44 Z 3omar_ahmed Logičari (COCI21_logicari) C++17
110 / 110
 145 ms 32920 KB 
#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define endl '\n'
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
const int N = 1e5 + 5;

int n;
int dp[N][2][2][2][2];
vector < vector < int >> adj;
pair < int , int > extra = {-1, -1};

struct DSU {
    vector < int > par, sz;

    void init(int n) {
        par = sz = vector < int > (n + 1);
        for(int i = 1 ; i <= n ; i++) {
            par[i] = i, sz[i] = 1;
        }
    }
    
    int find(int node) {
        if(par[node] == node) return node;
        return par[node] = find(par[node]);
    }

    int join(int u, int v) {
        u = find(u), v = find(v);
        if(u == v) return 0;
        if(sz[v] > sz[u]) {
            swap(u, v);
        }
        sz[u] += sz[v];
        par[v] = u;
        return 1;
    }
};


int solve(int node, int par, int color_par, int color_node, int color_extra1, int color_extra2) {
    auto &ret = dp[node][color_par][color_node][color_extra1][color_extra2];
    if(ret != -1) {
        return ret;
    }

    int counter = color_par;
    for(auto child : adj[node]) {
        if(child == par) continue;
        if(child == extra.first) {
            counter += color_extra1;
        } else if(child == extra.second) {
            counter += color_extra2;
        }
    }

    if(node == extra.first) counter += color_extra2;
    else if(node == extra.second) counter += color_extra1;

    if(counter >= 2) {
        return ret = 1e9;
    } else if(counter == 1) {
        int ans = 0;
        for(auto child : adj[node]) {
            if(child == par) continue;
            if(child == extra.first) {
                ans += solve(child, node, color_node, color_extra1, color_extra1, color_extra2);
            } else if(child == extra.second) {
                ans += solve(child, node, color_node, color_extra2, color_extra1, color_extra2);
            } else {
                ans += solve(child, node, color_node, 0, color_extra1, color_extra2); 
            }
        }
        return ret = ans;
    } else {
        int ans = 0, mx = -1e16;
        for(auto child : adj[node]) {
            if(child == par) continue;
            if(child == extra.first) {
                ans += solve(child, node, color_node, color_extra1, color_extra1, color_extra2);
            } else if(child == extra.second) {
                ans += solve(child, node, color_node, color_extra2, color_extra1, color_extra2);
            } else {
                int b = solve(child, node, color_node, 1, color_extra1, color_extra2) + 1; 
                int a = solve(child, node, color_node, 0, color_extra1, color_extra2);
                ans += a, mx = max(mx, a - b);
            }
        }
        if(mx < -1e15) return ret = 1e9;
        return ret = ans - mx;
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);

    cin >> n;

    DSU s; s.init(n);
    adj = vector < vector < int >> (n + 1);
    
    for(int i = 0 ; i < n ; i++) {
        int u, v;
        cin >> u >> v;
        if(!s.join(u, v)) {
            extra = {u, v};
        }
        adj[u].push_back(v);
        adj[v].push_back(u);
    }    

    for(int i = 0 ; i < adj[extra.first].size() ; i++) {
        if(adj[extra.first][i] == extra.second) {
            adj[extra.first].erase(adj[extra.first].begin() + i);
            break;
        }
    }

    for(int i = 0 ; i < adj[extra.second].size() ; i++) {
        if(adj[extra.second][i] == extra.first) {
            adj[extra.second].erase(adj[extra.second].begin() + i);
            break;
        }
    }

    cerr << extra.first << " " << extra.second << endl;

    int ans = 1e9;

    memset(dp, -1, sizeof(dp));
    
    if(extra.first == 1) {
        int a = solve(1, 1, 0, 0, 0, 0);
        int b = solve(1, 1, 0, 1, 1, 0) + 1;
        int c = solve(1, 1, 0, 0, 0, 1) + 1;
        int d = solve(1, 1, 0, 1, 1, 1) + 2;

        ans = min({a, b, c, d});
    } else if(extra.second == 1) {
        int a = solve(1, 1, 0, 0, 0, 0);
        int b = solve(1, 1, 0, 0, 1, 0) + 1;
        int c = solve(1, 1, 0, 1, 0, 1) + 1;
        int d = solve(1, 1, 0, 1, 1, 1) + 2;

        ans = min({a, b, c, d});
    } else {
        int a = solve(1, 1, 0, 0, 0, 0);
        int b = solve(1, 1, 0, 0, 1, 0) + 1;
        int c = solve(1, 1, 0, 0, 0, 1) + 1;
        int d = solve(1, 1, 0, 0, 1, 1) + 2;

        int e = solve(1, 1, 0, 1, 0, 0) + 1;
        int f = solve(1, 1, 0, 1, 1, 0) + 2;
        int g = solve(1, 1, 0, 1, 0, 1) + 2;
        int h = solve(1, 1, 0, 1, 1, 1) + 3;
        
        ans = min({a, b, c, d, e, f, g, h});
    }

    if(ans > 1e7) ans = -1;
    cout << ans << endl;
    return 0 ;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:113:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i = 0 ; i < adj[extra.first].size() ; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:120:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for(int i = 0 ; i < adj[extra.second].size() ; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 145 ms 32920 KB Output is correct
6 Correct 106 ms 32528 KB Output is correct
7 Correct 108 ms 29396 KB Output is correct
8 Correct 112 ms 30148 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 13028 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 3 ms 13004 KB Output is correct
17 Correct 2 ms 12888 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 2 ms 12888 KB Output is correct
22 Correct 2 ms 12888 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12892 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 145 ms 32920 KB Output is correct
6 Correct 106 ms 32528 KB Output is correct
7 Correct 108 ms 29396 KB Output is correct
8 Correct 112 ms 30148 KB Output is correct
9 Correct 2 ms 12888 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12888 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 2 ms 12888 KB Output is correct
22 Correct 2 ms 13028 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 3 ms 13004 KB Output is correct
25 Correct 2 ms 12888 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 2 ms 12888 KB Output is correct
30 Correct 2 ms 12888 KB Output is correct
31 Correct 2 ms 12892 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 88 ms 20772 KB Output is correct
34 Correct 75 ms 20572 KB Output is correct
35 Correct 87 ms 20760 KB Output is correct
36 Correct 86 ms 20536 KB Output is correct
37 Correct 19 ms 14904 KB Output is correct
38 Correct 80 ms 20848 KB Output is correct
39 Correct 7 ms 13656 KB Output is correct
40 Correct 77 ms 20572 KB Output is correct
41 Correct 71 ms 21708 KB Output is correct
42 Correct 58 ms 21828 KB Output is correct
43 Correct 116 ms 30764 KB Output is correct
44 Correct 77 ms 28576 KB Output is correct