oj.uz

답안 #1065476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065476 2024-08-19T08:12:41 Z Jarif_Rahman Amusement Park (JOI17_amusement_park) C++17
8 / 100
 2238 ms 262144 KB 
#include "Joi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
    const int N = 10000;
    const int k = 60;
    int n, m;
    vector<int> graph[N];
    int dis[N][N];

    void bfs(int source){
        queue<int> Q;
        fill(dis[source], dis[source]+n, -1);
        dis[source][source] = 0;
        Q.push(source);
        while(!Q.empty()){
            int nd = Q.front();
            Q.pop();
            for(int x: graph[nd]) if(dis[source][x] == -1){
                dis[source][x] = dis[source][nd]+1;
                Q.push(x);
            }
        }
    }
}

void Joi(int _n, int _m, int A[], int B[], ll X, int T){
    n = _n, m = _m;
    for(int i = 0; i < m; i++){
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }

    vector<int> bin;
    for(int i = 0; i < k; i++){
        bin.push_back(X%2);
        X/=2;
    }

    for(int i = 0; i < n; i++) bfs(i);
    vector<int> msg(n, -1);

    for(int i = 0; i < n; i++){
        vector<int> md(k, 1e8);
        for(int j = 0; j < n; j++) if(msg[j] != -1) md[msg[j]] = min(md[msg[j]], dis[i][j]);
        int x = 0, d = md[0];
        for(int j = 1; j < k; j++) if(md[j] > d) d = md[j], x = j;
        msg[i] = x;
    }

    for(int i = 0; i < n; i++) MessageBoard(i, bin[msg[i]]);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
    const int N = 10000;
    const int k = 60;
    int n, m;
    vector<int> graph[N];
    int dis[N][N];
    vector<int> tree[N];

    void bfs(int source){
        queue<int> Q;
        fill(dis[source], dis[source]+n, -1);
        dis[source][source] = 0;
        Q.push(source);
        while(!Q.empty()){
            int nd = Q.front();
            Q.pop();
            for(int x: graph[nd]) if(dis[source][x] == -1){
                dis[source][x] = dis[source][nd]+1;
                Q.push(x);
            }
        }
    }
}

ll Ioi(int _n, int _m, int A[], int B[], int p, int v, int T){
    n = _n, m = _m;
    for(int i = 0; i < m; i++){
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }

    for(int i = 0; i < n; i++) bfs(i);
    vector<int> msg(n, -1);
    for(int i = 0; i < n; i++){
        vector<int> md(k, 1e8);
        for(int j = 0; j < n; j++) if(msg[j] != -1) md[msg[j]] = min(md[msg[j]], dis[i][j]);
        int x = 0, d = md[0];
        for(int j = 1; j < k; j++) if(md[j] > d) d = md[j], x = j;
        msg[i] = x;
    }

    vector<bool> done(k, 0);
    int left = k;
    vector<bool> bl(n, 0);

    done[msg[p]] = 1;
    left--;
    bl[p] = 1;

    vector<pair<int, int>> nxt;
    for(int x: graph[p]) if(!bl[x]){
        bl[x] = 1;
        nxt.push_back({x, p});
    }

    while(left){
        int nd = -1, ss = -1;
        for(int i = int(nxt.size())-1; i >= 0; i--) if(!done[msg[nxt[i].first]]){
            tie(nd, ss) = nxt[i];
            nxt.erase(nxt.begin()+i);
            break;
        }
        if(nd == -1){
            assert(!nxt.empty());
            tie(nd, ss) = nxt.back();
            nxt.pop_back();
        }

        if(!done[msg[nd]]) left--;
        done[msg[nd]] = 1;
        bl[nd] = 1;

        tree[ss].push_back(nd);

        for(int x: graph[nd]) if(!bl[x]){
            bl[x] = 1;
            nxt.push_back({x, nd});
        }
    }

    vector<int> bin(k);
    bin[msg[p]] = v;

    function<void(int)> dfs = [&](int nd){
        for(int x: tree[nd]){
            bin[msg[x]] = Move(x);
            dfs(x);
            Move(nd);
        }
    };

    dfs(p);

    ll X = 0;
    for(int i = 0; i < k; i++) if(bin[i]) X+=(1LL<<i);
    return X;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11548 KB Output is correct
2 Correct 2 ms 15648 KB Output is correct
3 Correct 5 ms 27940 KB Output is correct
4 Correct 3 ms 13596 KB Output is correct
5 Correct 3 ms 13600 KB Output is correct
6 Correct 3 ms 19732 KB Output is correct
7 Correct 4 ms 27932 KB Output is correct
8 Correct 6 ms 28048 KB Output is correct
9 Correct 4 ms 25872 KB Output is correct
10 Correct 2 ms 15636 KB Output is correct
11 Correct 6 ms 16076 KB Output is correct
12 Correct 2 ms 11540 KB Output is correct
13 Correct 5 ms 27940 KB Output is correct
14 Correct 5 ms 27932 KB Output is correct
15 Correct 6 ms 27940 KB Output is correct
16 Correct 5 ms 27932 KB Output is correct
17 Correct 5 ms 27932 KB Output is correct
18 Correct 4 ms 27924 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2238 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11548 KB Output is correct
2 Correct 2 ms 11552 KB Output is correct
3 Correct 2 ms 11532 KB Output is correct
4 Correct 55 ms 65192 KB Output is correct
5 Correct 54 ms 77412 KB Output is correct
6 Correct 56 ms 83392 KB Output is correct
7 Correct 54 ms 83420 KB Output is correct
8 Correct 54 ms 83548 KB Output is correct
9 Runtime error 574 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2203 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2168 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -