oj.uz

답안 #1034920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034920 2024-07-25T21:48:48 Z CSQ31 Board Game (JOI24_boardgame) C++17
0 / 100
 22 ms 3668 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 5e4+50;
vector<int>adj[MAXN];
int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        int u,v;
        cin>>u>>v;
        u--;
        v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    string s;
    cin>>s;
    queue<int>q;
    for(int i=0;i<n;i++){
        if(s[i] == '1')q.push(i);
    }
    if(q.empty()){
        q.push(0);
        vector<int>d(n,n);
        d[0] = 0;
        while(!q.empty()){
            int v = q.front();
            q.pop();
            for(int x:adj[v]){
                if(d[x] > d[v]+1){
                    d[x] = d[v]+1;
                    q.push(x);
                }
            }
        }
        for(int i=0;i<n;i++)cout<<d[i]<<'\n';
    }

}

Subtask #1
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 3668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 3668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1624 KB Output isn't correct
2 Halted 0 ms 0 KB -