結果

問題 No.1480 Many Complete Graphs
ユーザー torisasami4torisasami4
提出日時 2021-04-16 21:36:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 150 ms / 2,000 ms
コード長 5,873 bytes
コンパイル時間 2,113 ms
コンパイル使用メモリ 183,140 KB
実行使用メモリ 47,408 KB
最終ジャッジ日時 2023-09-16 02:55:02
合計ジャッジ時間 8,145 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 12 ms
34,292 KB
testcase_01 AC 11 ms
34,156 KB
testcase_02 AC 12 ms
34,404 KB
testcase_03 AC 12 ms
34,160 KB
testcase_04 AC 11 ms
34,252 KB
testcase_05 AC 11 ms
34,228 KB
testcase_06 AC 12 ms
34,144 KB
testcase_07 AC 11 ms
34,232 KB
testcase_08 AC 12 ms
34,112 KB
testcase_09 AC 12 ms
34,628 KB
testcase_10 AC 12 ms
34,648 KB
testcase_11 AC 12 ms
34,248 KB
testcase_12 AC 12 ms
34,436 KB
testcase_13 AC 32 ms
39,480 KB
testcase_14 AC 25 ms
37,840 KB
testcase_15 AC 58 ms
41,208 KB
testcase_16 AC 33 ms
39,272 KB
testcase_17 AC 37 ms
38,848 KB
testcase_18 AC 18 ms
37,324 KB
testcase_19 AC 33 ms
38,708 KB
testcase_20 AC 51 ms
39,948 KB
testcase_21 AC 35 ms
39,404 KB
testcase_22 AC 24 ms
37,076 KB
testcase_23 AC 63 ms
44,060 KB
testcase_24 AC 70 ms
43,664 KB
testcase_25 AC 104 ms
45,388 KB
testcase_26 AC 88 ms
45,992 KB
testcase_27 AC 71 ms
43,800 KB
testcase_28 AC 70 ms
45,304 KB
testcase_29 AC 62 ms
45,308 KB
testcase_30 AC 69 ms
45,384 KB
testcase_31 AC 63 ms
46,588 KB
testcase_32 AC 65 ms
46,236 KB
testcase_33 AC 69 ms
45,352 KB
testcase_34 AC 62 ms
45,372 KB
testcase_35 AC 86 ms
46,292 KB
testcase_36 AC 90 ms
46,396 KB
testcase_37 AC 84 ms
46,260 KB
testcase_38 AC 88 ms
46,300 KB
testcase_39 AC 91 ms
46,308 KB
testcase_40 AC 86 ms
46,396 KB
testcase_41 AC 81 ms
46,212 KB
testcase_42 AC 101 ms
46,264 KB
testcase_43 AC 101 ms
46,576 KB
testcase_44 AC 100 ms
46,416 KB
testcase_45 AC 100 ms
46,240 KB
testcase_46 AC 98 ms
46,264 KB
testcase_47 AC 128 ms
47,300 KB
testcase_48 AC 114 ms
47,256 KB
testcase_49 AC 120 ms
47,408 KB
testcase_50 AC 90 ms
46,732 KB
testcase_51 AC 150 ms
47,372 KB
testcase_52 AC 101 ms
47,308 KB
testcase_53 AC 116 ms
47,304 KB
testcase_54 AC 134 ms
47,188 KB
testcase_55 AC 130 ms
47,184 KB
testcase_56 AC 110 ms
47,240 KB
testcase_57 AC 95 ms
46,000 KB
testcase_58 AC 76 ms
46,904 KB
evil_aftercontest.txt AC 143 ms
59,252 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 = n - 1; i >= 0; i--)
#define REP(i, l, r) for (ll i = l; i < (r); i++)
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)
{
	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;

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

	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;
		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;

vector<ll> fac(2000011, 0);  //n!(mod M)
vector<ll> ifac(2000011); //k!^{M-2} (mod M)

ll mpow(ll x, ll n)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % M;
		x = x * x % M;
		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;
}
void setcomb()
{
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 2000010; i++)
	{
		fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
	}
	ifac[2000010] = mpow(fac[2000010], M - 2);
	for (ll i = 2000010; i > 0; i--)
	{
		ifac[i - 1] = ifac[i] * i % M;
	}
}
ll comb(ll a, ll b)
{
	if(fac[0] == 0)
		setcomb();
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	ll tmp = ifac[a - b] * ifac[b] % M;
	return tmp * fac[a] % M;
}
ll perm(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return fac[a] * ifac[a - b] % M;
}
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 <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>;

typedef vector<vector<mint>> Matrix;

Matrix mul(Matrix a, Matrix b)
{
	assert(a[0].size() == b.size());
	int i, j, k;
	int n = a.size(), m = b[0].size(), l = a[0].size();
	Matrix c(n, vector<mint>(m));
	for (i = 0; i < n; i++)
		for (k = 0; k < l; k++)
			for (j = 0; j < m; j++)
				c[i][j] += a[i][k] * b[k][j];
	return c;
}

Matrix mat_pow(Matrix x, ll n)
{
	ll k = x.size();
	Matrix ans(k, vector<mint>(k, 0));
	for (int i = 0; i < k; i++)
		ans[i][i] = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = mul(ans, x);
		x = mul(x, x);
		n = n >> 1;
	}
	return ans;
}

int main(){
	ll n, m;
	cin >> n >> m;
	vector<pair<ll, ll>> li[n + m * 2];
	rep(t,m){
		ll k, c;
		cin >> k >> c;
		ll s;
		rep(i,k){
			cin >> s;
			li[s - 1].pb(mp(n + (s % 2) * m + t, s / 2 + c));
			rep(j, 2){
				if(j | (s%2)){
					li[n + j * m + t].pb(mp(s - 1, s / 2 + 1));
					// cout << n + j * m + t << " " << s - 1 << " " << s / 2 + 1 << endl;
				}
				else
					li[n + j * m + t].pb(mp(s - 1, s / 2));
			}
		}
	}
	rque<pair<ll, ll>> que;
	ll d[n + m * 2];
	rep(i, n + m * 2) d[i] = -1;
	que.push(mp(0, 0));
	while(!que.empty()){
		auto q = que.top();
		que.pop();
		ll nd = q.first, now = q.second;
		if(now == n-1){
			cout << nd << endl;
			return 0;
		}
		if(d[now] == -1){
			d[now] = nd;
			for (auto &e:li[now]){
				que.push(mp(nd + e.second, e.first));
				// cout << now << " " << e.first << " " << e.second << endl;
			}
		}
	}
	cout << "-1" << endl;
}
0