oj.uz

답안 #930395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930395 2024-02-19T14:26:30 Z Whisper Birmingham (COCI20_birmingham) C++17
70 / 70
 64 ms 19028 KB 
#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.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 3 ms 9684 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9564 KB Output is correct
2 Correct 2 ms 9560 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 3 ms 9564 KB Output is correct
3 Correct 2 ms 9640 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9672 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9668 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 3 ms 9564 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 17912 KB Output is correct
2 Correct 59 ms 18772 KB Output is correct
3 Correct 61 ms 19024 KB Output is correct
4 Correct 48 ms 17232 KB Output is correct
5 Correct 51 ms 17488 KB Output is correct
6 Correct 61 ms 19028 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 18628 KB Output is correct
2 Correct 59 ms 18388 KB Output is correct
3 Correct 61 ms 18628 KB Output is correct
4 Correct 57 ms 19028 KB Output is correct
5 Correct 57 ms 18776 KB Output is correct
6 Correct 52 ms 18004 KB Output is correct

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 18256 KB Output is correct
2 Correct 61 ms 18944 KB Output is correct
3 Correct 61 ms 19028 KB Output is correct
4 Correct 59 ms 18764 KB Output is correct
5 Correct 52 ms 17748 KB Output is correct
6 Correct 60 ms 18260 KB Output is correct

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 17488 KB Output is correct
2 Correct 56 ms 18388 KB Output is correct
3 Correct 60 ms 18908 KB Output is correct
4 Correct 51 ms 18004 KB Output is correct
5 Correct 49 ms 17492 KB Output is correct
6 Correct 54 ms 17996 KB Output is correct

Subtask #12
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 17492 KB Output is correct
2 Correct 57 ms 18004 KB Output is correct
3 Correct 53 ms 17996 KB Output is correct
4 Correct 52 ms 17748 KB Output is correct
5 Correct 52 ms 18104 KB Output is correct
6 Correct 50 ms 17768 KB Output is correct

Subtask #13
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 17584 KB Output is correct
2 Correct 54 ms 18004 KB Output is correct
3 Correct 52 ms 18000 KB Output is correct
4 Correct 56 ms 18416 KB Output is correct
5 Correct 64 ms 18204 KB Output is correct
6 Correct 55 ms 18144 KB Output is correct

Subtask #14
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 18000 KB Output is correct
2 Correct 49 ms 17232 KB Output is correct
3 Correct 62 ms 18940 KB Output is correct
4 Correct 51 ms 18056 KB Output is correct
5 Correct 53 ms 18256 KB Output is correct
6 Correct 57 ms 18964 KB Output is correct