結果

問題 No.1190 Points
ユーザー suta28407928suta28407928
提出日時 2020-08-22 18:29:42
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 4,539 bytes
コンパイル時間 1,267 ms
コンパイル使用メモリ 113,388 KB
実行使用メモリ 45,408 KB
最終ジャッジ日時 2024-11-14 23:34:25
合計ジャッジ時間 5,655 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
27,168 KB
testcase_01 AC 11 ms
27,212 KB
testcase_02 AC 10 ms
27,100 KB
testcase_03 AC 111 ms
39,940 KB
testcase_04 AC 92 ms
38,292 KB
testcase_05 AC 86 ms
37,552 KB
testcase_06 AC 143 ms
42,888 KB
testcase_07 AC 160 ms
44,400 KB
testcase_08 AC 150 ms
44,680 KB
testcase_09 AC 152 ms
43,304 KB
testcase_10 AC 155 ms
44,632 KB
testcase_11 AC 113 ms
38,888 KB
testcase_12 AC 154 ms
44,352 KB
testcase_13 AC 105 ms
37,060 KB
testcase_14 AC 45 ms
37,312 KB
testcase_15 AC 177 ms
44,860 KB
testcase_16 AC 27 ms
30,424 KB
testcase_17 AC 156 ms
44,060 KB
testcase_18 AC 81 ms
32,680 KB
testcase_19 AC 43 ms
40,488 KB
testcase_20 AC 98 ms
35,296 KB
testcase_21 AC 53 ms
34,900 KB
testcase_22 AC 68 ms
41,248 KB
testcase_23 AC 180 ms
45,396 KB
testcase_24 AC 179 ms
45,408 KB
testcase_25 AC 146 ms
44,284 KB
testcase_26 AC 121 ms
43,728 KB
testcase_27 AC 145 ms
44,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

ll modpow(ll x, ll n, ll mod){
	ll res = 1;
	while(n > 0){
		if(n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

vector<ll> fac(MAX), finv(MAX), inv(MAX);

void comInit(){
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(ll i=2; i<MAX; i++){
		fac[i] = fac[i-1]*i % mod;
		inv[i] = mod - inv[mod%i] * (mod/i) % mod;
		finv[i] = finv[i-1] * inv[i] % mod;
	}
}


ll com(ll n, ll k){
	if(n < k) return 0;
	if(n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}

int main(){
	int n,m,p; cin >> n >> m >> p;
	int s,g; cin >> s >> g; s--; g--;
	vvl G(n);
	rep(i,m){
		ll u,v; cin >> u >> v; u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	vvl ds(n,vl(2,linf));
	vvl dg(n,vl(2,linf));
	ds[s][0] = 0; dg[g][0] = 0;
	queue<P> q;
	q.emplace(s,0);
	while(!q.empty()){
		P p = q.front(); q.pop();
		ll u = p.first;
		for(auto v : G[u]){
			if(ds[v][1-p.second] == linf){
				ds[v][1-p.second] = ds[u][p.second] + 1;
				q.emplace(v,1-p.second);
			}
		}
	}
	q.emplace(g,0);
	while(!q.empty()){
		P p = q.front(); q.pop();
		ll u = p.first;
		for(auto v : G[u]){
			if(dg[v][1-p.second] == linf){
				dg[v][1-p.second] = dg[u][p.second] + 1;
				q.emplace(v,1-p.second);
			}
		}
	}
	vl ans;
	rep(i,n){
		bool f = false;
		rep(j,2){
			if(ds[i][j] == linf || dg[i][(j+(p&1))%2] == linf) continue;
			if(ds[i][j] + dg[i][(j+(p&1))%2] <= p) f = true;
			//print2(i, ds[i][j] + dg[i][(j+(p&1))%2]);
		}
		if(f) ans.push_back(i+1);
	}
	if(ans.empty()) puts("-1");
	else{
		cout << ans.size() << "\n";
		for(auto i : ans) cout << i << "\n";
	}
}
0