Submission #930395

#	Time	Username	Problem	Language	Result	Execution time	Memory
930395		Whisper	Birmingham (COCI20_birmingham)	C++17	70 / 70	64 ms	19028 KiB

birmingham

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, numEdge, numPoint, numStep;
vector<int> adj[MAX];
int staNode[MAX];
int ans[MAX], vis[MAX];
void Whisper(){
    cin >> numNode >> numEdge >> numPoint >> numStep;
    queue<int> q;
    memset(ans, 0x3f, sizeof ans);
    for (int i = 1; i <= numPoint; ++i){
        cin >> staNode[i];
        q.push(staNode[i]);
        ans[staNode[i]] = 0;
    }
    for (int i = 1; i <= numEdge; ++i){
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    while (!q.empty()){
        int u = q.front(); q.pop();
        if (vis[u]) continue;
        vis[u] = 1;
        for (auto&v : adj[u]){
            if (minimize(ans[v], ans[u] + 1)) q.push(v);
        }
    }
    for (int i = 1; i <= numNode; ++i){
        int l = 0, r = 1e6;
        int res = 0;
        while (l <= r){
            int mid = (l + r) >> 1;
            if (numStep * mid * (mid + 1) / 2 >= ans[i]) r = mid - 1, res = mid;
            else l = mid + 1;
        }
        cout << res << " ";
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5