oj.uz

답안 #1048806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048806 2024-08-08T09:36:14 Z Whisper Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 14 ms 744 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
using ll = long long;

int findEgg (int _N, vector<pair<int, int>> bridges){
    int N = _N;
    vector<vector<int>> G(N + 5);
    for (pair<int, int>&x : bridges){
        int u = x.first, v = x.second;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    vector<int> minDist(N + 5), rev(N + 5);
    queue<int> q;
    q.emplace(1);
    minDist[1] = 1; rev[1] = 1;
    int cnt = 1;
    while(q.size()){
        int u = q.front(); q.pop();
        for (int &v : G[u]){
            if (!minDist[v]){
                q.emplace(v);
                minDist[v] = ++cnt;
                rev[minDist[v]] = v;
            }
        }
    }
    auto check = [&](int x) -> bool{
        vector<int> node;
        for (int i = 1; i <= N; ++i) if(minDist[i] <= x){
            node.emplace_back(i);
        }
        return query(node);
    };
    int ans = 0;
    int l = 0, r = N + 1;
    while (r - l > 1){
        int m = (l + r) >> 1;
        if(check(m)) ans = m, r = m;
        else l = m;
    }
    return rev[ans];
}

Subtask #1
32.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Number of queries: 5
2 Partially correct 1 ms 344 KB Number of queries: 5
3 Partially correct 1 ms 344 KB Number of queries: 5
4 Partially correct 1 ms 344 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Number of queries: 9
2 Correct 10 ms 476 KB Number of queries: 9
3 Correct 10 ms 344 KB Number of queries: 9
4 Correct 8 ms 344 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 14 ms 744 KB Number of queries: 10
2 Correct 8 ms 492 KB Number of queries: 9
3 Partially correct 8 ms 500 KB Number of queries: 10
4 Partially correct 9 ms 344 KB Number of queries: 10