結果

問題 No.1545 [Cherry 2nd Tune N] Anthem
ユーザー torisasami4torisasami4
提出日時 2021-06-11 22:54:22
言語 C++14
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 419 ms / 3,000 ms
コード長 9,969 Byte
コンパイル時間 1,689 ms
使用メモリ 52,448 KB
最終ジャッジ日時 2021-06-11 22:54:42
合計ジャッジ時間 17,339 ms
ジャッジサーバーID
(参考情報)
judge7 / judge6
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,392 KB
testcase_01 AC 1 ms
3,296 KB
testcase_02 AC 2 ms
3,420 KB
testcase_03 AC 1 ms
3,400 KB
testcase_04 AC 36 ms
14,904 KB
testcase_05 AC 165 ms
29,004 KB
testcase_06 AC 50 ms
12,816 KB
testcase_07 AC 50 ms
14,044 KB
testcase_08 AC 419 ms
52,448 KB
testcase_09 AC 64 ms
12,008 KB
testcase_10 AC 38 ms
9,668 KB
testcase_11 AC 79 ms
16,160 KB
testcase_12 AC 129 ms
24,336 KB
testcase_13 AC 35 ms
9,592 KB
testcase_14 AC 36 ms
15,024 KB
testcase_15 AC 12 ms
5,460 KB
testcase_16 AC 48 ms
19,516 KB
testcase_17 AC 41 ms
7,856 KB
testcase_18 AC 115 ms
15,476 KB
testcase_19 AC 73 ms
13,228 KB
testcase_20 AC 121 ms
15,628 KB
testcase_21 AC 59 ms
24,180 KB
testcase_22 AC 56 ms
16,760 KB
testcase_23 AC 105 ms
14,220 KB
testcase_24 AC 32 ms
8,476 KB
testcase_25 AC 31 ms
3,868 KB
testcase_26 AC 2 ms
3,544 KB
testcase_27 AC 11 ms
3,700 KB
testcase_28 AC 58 ms
6,040 KB
testcase_29 AC 51 ms
8,612 KB
testcase_30 AC 33 ms
4,600 KB
testcase_31 AC 30 ms
4,016 KB
testcase_32 AC 13 ms
3,588 KB
testcase_33 AC 50 ms
5,948 KB
testcase_34 AC 37 ms
4,620 KB
testcase_35 AC 195 ms
8,624 KB
testcase_36 AC 127 ms
6,080 KB
testcase_37 AC 7 ms
3,840 KB
testcase_38 AC 51 ms
4,100 KB
testcase_39 AC 7 ms
3,536 KB
testcase_40 AC 23 ms
4,524 KB
testcase_41 AC 4 ms
3,480 KB
testcase_42 AC 34 ms
6,072 KB
testcase_43 AC 46 ms
5,908 KB
testcase_44 AC 3 ms
3,760 KB
testcase_45 AC 3 ms
5,664 KB
testcase_46 AC 12 ms
4,432 KB
testcase_47 AC 22 ms
5,344 KB
testcase_48 AC 15 ms
9,468 KB
testcase_49 AC 50 ms
6,356 KB
testcase_50 AC 81 ms
9,016 KB
testcase_51 AC 7 ms
3,680 KB
testcase_52 AC 150 ms
8,864 KB
testcase_53 AC 29 ms
6,240 KB
testcase_54 AC 9 ms
3,768 KB
testcase_55 AC 89 ms
7,988 KB
testcase_56 AC 3 ms
3,740 KB
testcase_57 AC 77 ms
6,808 KB
testcase_58 AC 41 ms
6,136 KB
testcase_59 AC 6 ms
4,096 KB
testcase_60 AC 4 ms
4,860 KB
testcase_61 AC 19 ms
4,412 KB
testcase_62 AC 73 ms
6,040 KB
testcase_63 AC 33 ms
4,748 KB
testcase_64 AC 319 ms
41,236 KB
testcase_65 AC 9 ms
4,184 KB
testcase_66 AC 66 ms
33,684 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define REP(i, l, r) for (ll i = l; i < (r); i++)
#define REP2(i, l, r) for (ll i = (ll)r - 1; i >= (l); i--)
#define siz(x) (ll)x.size()
template <class T>
using rque = priority_queue<T, vector<T>, greater<T>>;
const ll mod = 998244353;

template <class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}

template <class T>
bool chmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return 1;
    }
    return 0;
}

ll gcd(ll a, ll b)
{
	if(a == 0)
		return b;
	if(b == 0)
		return a;
	ll c = a % b;
	while (c != 0)
	{
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}

long long extGCD(long long a, long long b, long long &x, long long &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	long long d = extGCD(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

struct UnionFind
{
	vector<ll> data;
	int num;

	UnionFind(int sz)
	{
		data.assign(sz, -1);
		num = sz;
	}

	bool unite(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y)
			return (false);
		if (data[x] > data[y])
			swap(x, y);
		data[x] += data[y];
		data[y] = x;
		num--;
		return (true);
	}

	int find(int k)
	{
		if (data[k] < 0)
			return (k);
		return (data[k] = find(data[k]));
	}

	ll size(int k)
	{
		return (-data[find(k)]);
	}
};

ll M = 1000000007;

template <int mod>
struct ModInt
{
	int x;

	ModInt() : x(0) {}

	ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

	ModInt &operator+=(const ModInt &p)
	{
		if ((x += p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator-=(const ModInt &p)
	{
		if ((x += mod - p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator*=(const ModInt &p)
	{
		x = (int)(1LL * x * p.x % mod);
		return *this;
	}

	ModInt &operator/=(const ModInt &p)
	{
		*this *= p.inverse();
		return *this;
	}

	ModInt operator-() const { return ModInt(-x); }

	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

	bool operator==(const ModInt &p) const { return x == p.x; }

	bool operator!=(const ModInt &p) const { return x != p.x; }

	ModInt inverse() const
	{
		int a = x, b = mod, u = 1, v = 0, t;
		while (b > 0)
		{
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}

	ModInt pow(int64_t n) const
	{
		ModInt ret(1), mul(x);
		while (n > 0)
		{
			if (n & 1)
				ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}

	friend ostream &operator<<(ostream &os, const ModInt &p)
	{
		return os << p.x;
	}

	friend istream &operator>>(istream &is, ModInt &a)
	{
		int64_t t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}

	static int get_mod() { return mod; }
};

using mint = ModInt<mod>;

mint mpow(mint x, ll n)
{
	mint ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans *= x;
		x *= x;
		n = n >> 1;
	}
	return ans;
}

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

vector<mint> fac;
vector<mint> ifac;

void setcomb(int sz = 2000010)
{
	fac.assign(sz + 1, 0);
	ifac.assign(sz + 1, 0);
	fac[0] = 1;
	for (ll i = 0; i < sz; i++)
	{
		fac[i + 1] = fac[i] * (i + 1); // n!(mod M)
	}
	ifac[sz] = fac[sz].inverse();
	for (ll i = sz; i > 0; i--)
	{
		ifac[i - 1] = ifac[i] * i;
	}
}
mint comb(ll a, ll b)
{
	if(fac.size() == 0)
		setcomb();
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return ifac[a - b] * ifac[b] * fac[a];
}

mint perm(ll a, ll b)
{
	if(fac.size() == 0)
		setcomb();
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return fac[a] * ifac[a - b];
}

long long modinv(long long a)
{
	long long b = M, u = 1, v = 0;
	while (b)
	{
		long long t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= M;
	if (u < 0)
		u += M;
	return u;
}

ll modinv2(ll a, ll mod)
{
	ll b = mod, u = 1, v = 0;
	while (b)
	{
		ll t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= mod;
	if (u < 0)
		u += mod;
	return u;
}

template <typename Monoid, typename OperatorMonoid = Monoid>
struct LazySegmentTree
{
    using F = function<Monoid(Monoid, Monoid)>;
    using G = function<Monoid(Monoid, OperatorMonoid)>;
    using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;

    int sz, height;
    vector<Monoid> data;
    vector<OperatorMonoid> lazy;
    const F f;
    const G g;
    const H h;
    const Monoid M1;
    const OperatorMonoid OM0;

    LazySegmentTree(int n, const F f, const G g, const H h,
                    const Monoid &M1, const OperatorMonoid OM0)
        : f(f), g(g), h(h), M1(M1), OM0(OM0)
    {
        sz = 1;
        height = 0;
        while (sz < n)
            sz <<= 1, height++;
        data.assign(2 * sz, M1);
        lazy.assign(2 * sz, OM0);
    }

    void set(int k, const Monoid &x)
    {
        data[k + sz] = x;
    }

    void build()
    {
        for (int k = sz - 1; k > 0; k--)
        {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }

    inline void propagate(int k)
    {
        if (lazy[k] != OM0)
        {
            lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
            data[k] = reflect(k);
            lazy[k] = OM0;
        }
    }

    inline Monoid reflect(int k)
    {
        return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
    }

    inline void recalc(int k)
    {
        while (k >>= 1)
            data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
    }

    inline void thrust(int k)
    {
        for (int i = height; i > 0; i--)
            propagate(k >> i);
    }

    void update(int a, int b, const OperatorMonoid &x)
    {
        thrust(a += sz);
        thrust(b += sz - 1);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                lazy[l] = h(lazy[l], x), ++l;
            if (r & 1)
                --r, lazy[r] = h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }

    Monoid query(int a, int b)
    {
        thrust(a += sz);
        thrust(b += sz - 1);
        Monoid L = M1, R = M1;
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                L = f(L, reflect(l++));
            if (r & 1)
                R = f(reflect(--r), R);
        }
        return f(L, R);
    }

    Monoid operator[](const int &k)
    {
        return query(k, k + 1);
    }

    template <typename C>
    int find_subtree(int a, const C &check, Monoid &M, bool type)
    {
        while (a < sz)
        {
            propagate(a);
            Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));
            if (check(nxt))
                a = 2 * a + type;
            else
                M = nxt, a = 2 * a + 1 - type;
        }
        return a - sz;
    }

    template <typename C>
    int find_first(int a, const C &check)
    {
        Monoid L = M1;
        if (a <= 0)
        {
            if (check(f(L, reflect(1))))
                return find_subtree(1, check, L, false);
            return -1;
        }
        thrust(a + sz);
        int b = sz;
        for (a += sz, b += sz; a < b; a >>= 1, b >>= 1)
        {
            if (a & 1)
            {
                Monoid nxt = f(L, reflect(a));
                if (check(nxt))
                    return find_subtree(a, check, L, false);
                L = nxt;
                ++a;
            }
        }
        return -1;
    }

    template <typename C>
    int find_last(int b, const C &check)
    {
        Monoid R = M1;
        if (b >= sz)
        {
            if (check(f(reflect(1), R)))
                return find_subtree(1, check, R, true);
            return -1;
        }
        thrust(b + sz - 1);
        int a = sz;
        for (b += sz; a < b; a >>= 1, b >>= 1)
        {
            if (b & 1)
            {
                Monoid nxt = f(reflect(--b), R);
                if (check(nxt))
                    return find_subtree(b, check, R, true);
                R = nxt;
            }
        }
        return -1;
    }
};

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	ll n, s, t, k;
	cin >> n >> s >> t >> k;
	s--, t--;
	ll x[n];
	rep(i, n) cin >> x[i];
	vector<pair<ll, ll>> li[n];
	ll m;
	cin >> m;
	ll a, b, y;
	rep(i, m) cin >> a >> b >> y, li[--a].push_back({--b, y});
	pair<ll, pair<ll, ll>> d[n][k];
	rep(i, n) rep(j, k) d[i][j] = {2e18, {0, 0}};
	rque<pair<ll, pair<pair<ll, ll>, pair<ll, ll>>>> que;
	que.push({x[s], {{s, 0}, {-1, -1}}});
	while(!que.empty()){
		auto q = que.top();
		que.pop();
		ll nd = q.first, now = q.second.first.first, turn = q.second.first.second;
		ll prev = q.second.second.first, pt = q.second.second.second;
		if (chmin(d[now][turn], {nd, {prev, pt}})){
			for(auto &e: li[now]){
				que.push({nd + e.second + x[e.first], {{e.first, min(k - 1, turn + 1)}, {now, turn}}});
			}
		}
	}
	if(d[t][k-1].first > 1e18)
		cout << "Impossible" << endl;
	else{
		cout << "Possible" << '\n' << d[t][k - 1].first << endl;
		vector<ll> ans;
		ans.pb(t + 1);
		ll now = t, nt = k - 1;
		while(d[now][nt].second.first != -1){
			ll prev = d[now][nt].second.first, pt = d[now][nt].second.second;
			ans.pb(prev + 1);
			now = prev, nt = pt;
		}
		cout << ans.size() << endl;
		rep2(i, ans.size()) cout << ans[i] << (i == 0 ? '\n' : ' ');
	}
}
0