結果
| 問題 | No.1190 Points |
| ユーザー |
 hotman78
|
| 提出日時 | 2020-08-22 16:30:18 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 118 ms / 2,000 ms |
| コード長 | 8,291 bytes |
| コンパイル時間 | 5,546 ms |
| コンパイル使用メモリ | 423,308 KB |
| 実行使用メモリ | 22,544 KB |
| 最終ジャッジ日時 | 2024-11-14 23:33:59 |
| 合計ジャッジ時間 | 8,671 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,820 KB |
| testcase_01 | AC | 2 ms
6,816 KB |
| testcase_02 | AC | 2 ms
6,820 KB |
| testcase_03 | AC | 69 ms
16,828 KB |
| testcase_04 | AC | 55 ms
14,992 KB |
| testcase_05 | AC | 52 ms
14,276 KB |
| testcase_06 | AC | 94 ms
19,728 KB |
| testcase_07 | AC | 103 ms
21,572 KB |
| testcase_08 | AC | 95 ms
22,112 KB |
| testcase_09 | AC | 99 ms
20,560 KB |
| testcase_10 | AC | 100 ms
22,128 KB |
| testcase_11 | AC | 67 ms
15,740 KB |
| testcase_12 | AC | 99 ms
21,432 KB |
| testcase_13 | AC | 61 ms
13,764 KB |
| testcase_14 | AC | 26 ms
14,080 KB |
| testcase_15 | AC | 112 ms
21,932 KB |
| testcase_16 | AC | 13 ms
6,820 KB |
| testcase_17 | AC | 101 ms
21,276 KB |
| testcase_18 | AC | 42 ms
8,840 KB |
| testcase_19 | AC | 27 ms
17,408 KB |
| testcase_20 | AC | 54 ms
11,736 KB |
| testcase_21 | AC | 27 ms
11,632 KB |
| testcase_22 | AC | 39 ms
17,944 KB |
| testcase_23 | AC | 118 ms
22,468 KB |
| testcase_24 | AC | 118 ms
22,544 KB |
| testcase_25 | AC | 84 ms
21,056 KB |
| testcase_26 | AC | 62 ms
20,788 KB |
| testcase_27 | AC | 88 ms
21,184 KB |
コンパイルメッセージ
main.cpp:49:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
49 | inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
| ^~~~
main.cpp:56:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
56 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
| ^~~~
main.cpp:56:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
56 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
| ^~~~
main.cpp:57:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
57 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
| ^~~~
main.cpp:57:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
57 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
| ^~~~
ソースコード
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
//#define MOD 1000000000039LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
#define rep(i,...) for(auto i:range(__VA_ARGS__))
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<int64_t> range(int64_t n){vector<int64_t>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<int64_t> range(int64_t a,int64_t b){vector<int64_t>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<int64_t> range(int64_t a,int64_t b,int64_t c){vector<int64_t>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
//inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
//inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
int msb(int x){return 32-__builtin_clz(x);}
class mint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr mint(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){}
constexpr u64 &value()noexcept{return a;}
constexpr const u64 &value() const noexcept {return a;}
constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
constexpr mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= get_mod())a -= get_mod();
return *this;
}
constexpr mint &operator-=(const mint rhs) noexcept {
if (a<rhs.a)a += get_mod();
a -= rhs.a;
return *this;
}
constexpr mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % get_mod();
return *this;
}
constexpr mint operator++(int) noexcept {
a += 1;
if (a >= get_mod())a -= get_mod();
return *this;
}
constexpr mint operator--(int) noexcept {
if (a<1)a += get_mod();
a -= 1;
return *this;
}
constexpr mint &operator/=(mint rhs) noexcept {
u64 exp=get_mod()-2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(mint x) noexcept {
return a==x.a;
}
constexpr bool operator!=(mint x) noexcept {
return a!=x.a;
}
constexpr bool operator<(mint x) noexcept {
return a<x.a;
}
constexpr bool operator>(mint x) noexcept {
return a>x.a;
}
constexpr bool operator<=(mint x) noexcept {
return a<=x.a;
}
constexpr bool operator>=(mint x) noexcept {
return a>=x.a;
}
constexpr static int root(){
mint root = 2;
while(root.pow((get_mod()-1)>>1).a==1)root++;
return root.a;
}
constexpr mint pow(long long n){
long long x=a;
mint ret = 1;
while(n>0) {
if(n&1)(ret*=x);
(x*=x)%=get_mod();
n>>=1;
}
return ret;
}
constexpr mint inv(){
return pow(get_mod()-2);
}
static vector<mint> fac,ifac;
static bool init;
constexpr static int mx=10000001;
void build(){
init=0;
fac.resize(mx);
ifac.resize(mx);
fac[0]=1,ifac[0]=1;
for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i;
ifac[mx-1]=fac[mx-1].inv();
for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1);
}
mint comb(long long b){
if(init)build();
if(a==0&&b==0)return 1;
if((long long)a<b)return 0;
return fac[a]*ifac[a-b]*ifac[b];
}
mint fact(){
if(init)build();
return fac[a];
}
mint fact_inv(){
if(init)build();
return ifac[a];
}
friend ostream& operator<<(ostream& lhs, const mint& rhs) noexcept {
lhs << rhs.a;
return lhs;
}
friend istream& operator>>(istream& lhs,mint& rhs) noexcept {
lhs >> rhs.a;
return lhs;
}
constexpr static u64 get_mod(){return MOD;}
};
vector<mint> mint::fac;
vector<mint> mint::ifac;
bool mint::init=1;
int main(){
lint n,m,p;
cin>>n>>m>>p;
lint s,g;
cin>>s>>g;
s--;g--;
mat v(n);
rep(i,m){
lint s,t;
cin>>s>>t;
s--;t--;
v[t].emplace_back(s);
v[s].emplace_back(t);
}
mat diff(n,vec(2,INF));
mat diff2(n,vec(2,INF));
queue<pair<lint,lint>>que;
que.emplace(s,0);
diff[s][0]=0;
while(!que.empty()){
auto [now,b]=que.front();
que.pop();
for(auto e:v[now]){
if(chmin(diff[e][b^1],diff[now][b]+1)){
que.emplace(e,b^1);
}
}
}
que.emplace(g,0);
diff2[g][0]=0;
while(!que.empty()){
auto [now,b]=que.front();
que.pop();
for(auto e:v[now]){
if(chmin(diff2[e][b^1],diff2[now][b]+1)){
que.emplace(e,b^1);
}
}
}
vec ans;
rep(i,n){
if(p%2==0){
if(diff[i][0]+diff2[i][0]<=p||diff[i][1]+diff2[i][1]<=p){
ans.push_back(i+1);
}
}else{
if(diff[i][0]+diff2[i][1]<=p||diff[i][1]+diff2[i][0]<=p){
ans.push_back(i+1);
}
}
}
if(ans.size()==0){
cout<<-1<<endl;
return 0;
}
cout<<ans.size()<<endl;
for(auto e:ans){
cout<<e<<endl;
}
}