oj.uz

답안 #1053441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053441 2024-08-11T11:54:09 Z steveonalex Mousetrap (CEOI17_mousetrap) C++17
25 / 100
 424 ms 98484 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e6 + 69;
int n, s, t;
vector<int> graph[N], val[N];
int dp[N];
int parent[N];

bool find_t(int u, int p){
    parent[u] = p;
    if (u == t) return true;
    bool check = false;
    for(int v: graph[u]) if (v != p) 
        check = check || find_t(v, u);
    return check;
}

void dfs(int u, int p){
    for(int v: graph[u]) if (v != p) dfs(v, u);
    if (graph[u].size() <= 1) return;
    vector<int> toxic;
    for(int v: graph[u]) if (v != p) toxic.push_back(dp[v]);
    sort(ALL(toxic), greater<int>());
    dp[u] = toxic[1] + toxic.size();
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    clock_t start = clock();

    cin >> n >> s >> t;
    if (s == t){
        cout << 0 << "\n";
        return 0;
    }
    for(int i = 1; i<n; ++i){
        int u, v; cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    int branch = -1;
    for(int v: graph[s]){
        if (find_t(v, s)) branch = v;
    }
    graph[s] = {branch};

    int u = t;

    vector<int> chain;

    while(u != s){
        dfs(u, parent[u]);
        for(int v: graph[u]) if (v != parent[u]) val[u].push_back(dp[v]);
        sort(ALL(val[u]), greater<int>());

        auto it = find(ALL(graph[parent[u]]), u);
        graph[parent[u]].erase(it);

        chain.push_back(u);

        u = parent[u];
    }

    int sum = 0;
    for(int i: chain){
        sum += val[i].size();
    }

    int l = 0, r = n * 2;
    while(l < r){
        int mid = (l + r) >> 1;

        int _s = sum;
        vector<int> b;

        for(int i = 0; i < chain.size(); ++i){
            int u = chain[i];
            for(int v: val[u]) {
                if (v + _s + b.size() > mid)
                    b.push_back(i);
                _s--;
            }
        }

        bool legit = true;
        if (b.size() > chain.size()) legit = false;
        if (legit){
            for(int i = 0; i < b.size(); ++i) if (b[i] < i) legit = false;
        }
        if (legit) r = mid;
        else l = mid + 1;
    }

    cout << l << "\n";





    cerr << "Time elapsed: " << clock() - start << " ms!\n";
    return 0;
}

Compilation message

mousetrap.cpp: In function 'int main()':
mousetrap.cpp:125:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |         for(int i = 0; i < chain.size(); ++i){
      |                        ~~^~~~~~~~~~~~~~
mousetrap.cpp:128:39: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  128 |                 if (v + _s + b.size() > mid)
      |                     ~~~~~~~~~~~~~~~~~~^~~~~
mousetrap.cpp:137:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |             for(int i = 0; i < b.size(); ++i) if (b[i] < i) legit = false;
      |                            ~~^~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 48728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 97060 KB Output is correct
2 Correct 145 ms 92496 KB Output is correct
3 Correct 398 ms 98388 KB Output is correct
4 Correct 163 ms 75144 KB Output is correct
5 Correct 424 ms 98484 KB Output is correct
6 Correct 382 ms 98384 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 48728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 48728 KB Output isn't correct
2 Halted 0 ms 0 KB -