제출 #253246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253246		blacktulip	Birmingham (COCI20_birmingham)	C++17	70 / 70	193 ms	24232 KiB

birmingham

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,vis[li];
int cev;
string s;
queue<PII> pq;
vector<int> v[li];

inline void sp(){
	while(pq.size()){
		int co=pq.front().fi;
		int node=pq.front().se;
		pq.pop();
		//~ cout<<node<<" : : "<<co<<endl;
		if(vis[node])continue;
		vis[node]=1;
		int at=0;
		for(int i=1;i<=100000;i++){
			if(at>=co){a[node]=i-1;break;}
			at+=k*i;
			if(at>=co){a[node]=i;break;}
		}
		for(int i=0;i<(int)v[node].size();i++){
			int go=v[node][i];
			pq.push({co+1,go});
		}
	}
}

int main(void){
	scanf("%d %d %d %d",&n,&m,&t,&k);
	while(t--){
		int x;
		scanf("%d",&x);
		pq.push({0,x});
	}
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d %d",&x,&y);
		v[x].pb(y);
		v[y].pb(x);
	}
	sp();
	FOR printf("%d ",a[i]);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

birmingham.cpp: In function 'int main()':
birmingham.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&n,&m,&t,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
birmingham.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~
birmingham.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5