oj.uz

답안 #584201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584201 2022-06-27T03:17:49 Z AGE Birmingham (COCI20_birmingham) C++14
0 / 70
 209 ms 41328 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=1e6,M=2e3,mod=1e9+7;
int a[12]={31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
vector<int>adj[N];
int dist[N],ans[N];
main()
{
    queue<int>qq;
    int n,m,q,k;
    cin>>n>>m>>q>>k;

    vector<int>v;
    for(int i=0;i<q;i++){
        int x;
        cin>>x;

        v.pb(x);

    }

    for(int i=0;i<m;i++){

        int x,y;
        cin>>x>>y;

        adj[x].pb(y);
        adj[y].pb(x);

    }
    for(int i=1;i<=n;i++)
        dist[i]=1e18;


    for(int i=0;i<v.size();i++)
        qq.push(v[i]),dist[v[i]]=0;

    while(!qq.empty()){

        int node=qq.front();
        qq.pop();

        for(auto x:adj[node]){

            if(dist[x]>dist[node]+1){

                dist[x]=dist[node]+1;
                qq.push(x);

            }
        }
    }

    cout<<"!"<<endl;
    ans[0]=0;
    int i=0;
    int step=1;

    while(i<=1e6){


        int target=i+(k*step);
        if(target>1e6)
            break;

        int lst=i;

        i++;
        while(i<=target)
            ans[i]=ans[lst]+1,i++;

        i=target;
        step++;

    }

    for(int i=1;i<=n;i++)
        cout<<ans[dist[i]]<<" ";
    cout<<endl;

    return 0;
}

Compilation message

birmingham.cpp:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main()
      | ^~~~
birmingham.cpp: In function 'int main()':
birmingham.cpp:39:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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