제출 #1163579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163579		dnnnda	Board Game (JOI24_boardgame)	C++20	0 / 100	13 ms	3724 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
#define ll long long
//#define int long long
//#pragma GCC optimize("Ofast, unroll-loop")
//#pragma GCC target("avx,avx2")
#pragma GCC optimize("O3")
#define init(arr,val) memset(arr,val,sizeof arr)
const int inf=0x3f3f3f3f;
const ll inff=0x3f3f3f3f3f3f3f3f;
const int X=1000000007;
//const int X=998244353;

vector<int> adj[50004];
int x[50004];

int main(){
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int n, m, k; cin >> n >> m >> k;
    for(int i=1 ; i<=m ; i++){
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    string s; cin >> s;
    s="."+s;
    for(int i=1 ; i<=k ; i++) cin >> x[i];

    queue<int> q;
    bitset<50004> vis;
    q.push(x[1]);
    vis[1]=1;
    vector<int> d(n+1,inf);
    d[x[1]]=0;
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int v:adj[u]){
            if(!vis[v]){
                q.push(v);
                d[v]=d[u]+1;
                vis[v]=1;
            }
        }
    }
    for(int i=1 ; i<=n ; i++) cout << d[i] << '\n';


    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 9
• Subtask 7: 0 / 23
• Subtask 8: 0 / 9