結果
| 問題 | No.1451 集団登校 |
| ユーザー |
 FF256grhy
|
| 提出日時 | 2023-08-25 12:42:12 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 85 ms / 2,000 ms |
| コード長 | 9,778 bytes |
| コンパイル時間 | 2,157 ms |
| コンパイル使用メモリ | 212,948 KB |
| 実行使用メモリ | 11,352 KB |
| 最終ジャッジ日時 | 2024-06-06 07:18:40 |
| 合計ジャッジ時間 | 4,819 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 1 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,940 KB |
| testcase_03 | AC | 1 ms
6,944 KB |
| testcase_04 | AC | 2 ms
6,940 KB |
| testcase_05 | AC | 2 ms
6,944 KB |
| testcase_06 | AC | 2 ms
6,944 KB |
| testcase_07 | AC | 1 ms
6,944 KB |
| testcase_08 | AC | 66 ms
11,352 KB |
| testcase_09 | AC | 2 ms
6,940 KB |
| testcase_10 | AC | 36 ms
9,652 KB |
| testcase_11 | AC | 21 ms
9,820 KB |
| testcase_12 | AC | 35 ms
9,564 KB |
| testcase_13 | AC | 62 ms
10,188 KB |
| testcase_14 | AC | 80 ms
10,300 KB |
| testcase_15 | AC | 36 ms
7,152 KB |
| testcase_16 | AC | 52 ms
10,180 KB |
| testcase_17 | AC | 43 ms
6,940 KB |
| testcase_18 | AC | 22 ms
6,944 KB |
| testcase_19 | AC | 12 ms
7,068 KB |
| testcase_20 | AC | 85 ms
9,680 KB |
| testcase_21 | AC | 27 ms
6,944 KB |
| testcase_22 | AC | 17 ms
6,940 KB |
| testcase_23 | AC | 8 ms
6,940 KB |
| testcase_24 | AC | 31 ms
9,632 KB |
| testcase_25 | AC | 36 ms
6,944 KB |
| testcase_26 | AC | 53 ms
10,448 KB |
| testcase_27 | AC | 61 ms
6,944 KB |
| testcase_28 | AC | 23 ms
6,940 KB |
| testcase_29 | AC | 39 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--)
#define inc(i, n) incIX(i, 0, n)
#define dec(i, n) decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); };
auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); };
auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
template<typename A> istream & operator>>(istream & is, vector<A> & v);
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v);
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a);
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a);
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p);
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p);
template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t);
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t);
template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }
template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; }
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
template<typename A > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
void out_([[maybe_unused]] string const & s) { }
template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN = [](auto const & ... a) { outF("" , "" , a ...); };
auto outS = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); };
auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out = outSL;
template<typename A > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); };
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;
// ---- ----
template<LL M> class ModInt {
private:
LL v;
pair<LL, LL> ext_gcd(LL a, LL b) {
if(b == 0) { assert(a == 1); return { 1, 0 }; }
auto p = ext_gcd(b, a % b);
return { p.SE, p.FI - (a / b) * p.SE };
}
public:
ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
LL val() { return v; }
static LL mod() { return M; }
ModInt inv() { return ext_gcd(M, v).SE; }
ModInt exp(LL b) {
ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
return p;
}
friend bool operator< (ModInt a, ModInt b) { return (a.v < b.v); }
friend bool operator> (ModInt a, ModInt b) { return (a.v > b.v); }
friend bool operator<=(ModInt a, ModInt b) { return (a.v <= b.v); }
friend bool operator>=(ModInt a, ModInt b) { return (a.v >= b.v); }
friend bool operator==(ModInt a, ModInt b) { return (a.v == b.v); }
friend bool operator!=(ModInt a, ModInt b) { return (a.v != b.v); }
friend ModInt operator+ (ModInt a ) { return ModInt(+a.v); }
friend ModInt operator- (ModInt a ) { return ModInt(-a.v); }
friend ModInt operator+ (ModInt a, ModInt b) { return ModInt(a.v + b.v); }
friend ModInt operator- (ModInt a, ModInt b) { return ModInt(a.v - b.v); }
friend ModInt operator* (ModInt a, ModInt b) { return ModInt(a.v * b.v); }
friend ModInt operator/ (ModInt a, ModInt b) { return a * b.inv(); }
friend ModInt operator^ (ModInt a, LL b) { return a.exp(b); }
friend ModInt & operator+=(ModInt & a, ModInt b) { return (a = a + b); }
friend ModInt & operator-=(ModInt & a, ModInt b) { return (a = a - b); }
friend ModInt & operator*=(ModInt & a, ModInt b) { return (a = a * b); }
friend ModInt & operator/=(ModInt & a, ModInt b) { return (a = a / b); }
friend ModInt & operator^=(ModInt & a, LL b) { return (a = a ^ b); }
friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
friend ostream & operator<<(ostream & s, ModInt b) { return (s << b.v); }
};
// ----
using MI = ModInt<1'000'000'007>;
class UnionFind {
private:
int n, s;
vector<int> t;
vector<vector<int>> v;
public:
UnionFind(int nn = 0) { init(nn); }
void init(int nn) {
n = s = nn;
t.clear();
v.clear();
inc(i, n) { t.PB(i); v.EB(1, i); }
}
int get_n() { return n; }
int size() { return s; }
int id(int x) { return t.at(x); }
const vector<vector<int>> & get_v() { return v; }
bool unite(int x, int y) {
x = id(x);
y = id(y);
if(x == y) { return false; }
if(v[x].size() < v[y].size()) { swap(x, y); }
for(auto & e: v[y]) { v[x].PB(e); t[e] = x; }
v[y].clear();
s--;
return true;
}
bool same(int x, int y) { return (id(x) == id(y)); }
const vector<int> & operator[](int x) { return v[id(x)]; }
friend ostream & operator<<(ostream & os, const UnionFind & uf) {
inc(i, uf.n) { os << i << ": "; for(auto & e: uf.v[i]) { os << e << " "; } os << "\n"; }
return os;
}
};
// ----
int main() {
int IN(n, m);
vector<MI> p(n, 1);
UnionFind uf(n);
inc(i, m) {
int IN(a, b);
a--; b--;
if(uf.same(a, b)) { continue; }
if(SI(uf[a]) != SI(uf[b])) {
if_not(SI(uf[a]) < SI(uf[b])) { swap(a, b); }
RF(e, uf[a]) { p[e] = 0; }
} else {
RF(e, uf[a]) { p[e] /= 2; }
RF(e, uf[b]) { p[e] /= 2; }
}
uf.unite(a, b);
}
dispL(p);
}