Submission #931219
Source Code Expand
#include <bits/stdc++.h> using namespace std; int const MOD = 1000000007; int const N = 555; int from[N], to[N]; int c[N][N]; int dsu[N], sz[N], pv[N]; int ff[42]; set<int> sv[N]; int mul(int a, int b) { return (int) ((long long) a * b % MOD); } int get(int *p, int x) { return x == p[x] ? x : (p[x] = get(p, p[x])); } int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int modpow(int a, int b) { int ret = 1; while (b > 0) { if (b & 1) { ret = mul(ret, a); } a = mul(a, a); b >>= 1; } return ret; } int solve2(int n, int k) { int ans = 0; for (int i = 0; i < n; i++) { int g = gcd(i, n); int pw = 1; for (int j = 0; j < g; j++) { pw = mul(pw, k); } ans = (ans + pw) % MOD; } ans = mul(ans, modpow(n, MOD - 2)); return ans; } int main() { for (int i = 0; i < N; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) { c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % MOD; } } int n, m, k; scanf("%d%d%d", &n, &m, &k); for (int i = 0; i < m; i++) { scanf("%d%d", from + i, to + i); --from[i]; --to[i]; } for (int i = 0; i < m; i++) dsu[i] = i; for (int i = 0; i < m; i++) { for (int j = i + 1; j < m; j++) { int cn = 0; ff[cn++] = from[i]; ff[cn++] = to[i]; ff[cn++] = from[j]; ff[cn++] = to[j]; set<int> q; int rem = -1; for (int e = 0; e < cn; e++) { if (q.find(ff[e]) == q.end()) { q.insert(ff[e]); } else { q.erase(ff[e]); rem = ff[e]; } } if (q.size() > 2) continue; int v = *q.begin(); q.erase(q.begin()); int u = *q.begin(); q.erase(q.begin()); for (int e = 0; e < n; e++) pv[e] = e; for (int e = 0; e < m; e++) { if (e == i || e == j) continue; if (from[e] == rem || to[e] == rem) continue; pv[get(pv, from[e])] = get(pv, to[e]); } if (get(pv, v) == get(pv, u)) { dsu[get(dsu, i)] = get(dsu, j); } } } int ans = 1; for (int i = 0; i < m; i++) { sz[get(dsu, i)]++; sv[get(dsu, i)].insert(from[i]); sv[get(dsu, i)].insert(to[i]); } for (int i = 0; i < m; i++) { if (get(dsu, i) == i) { if ((int) sv[i].size() == sz[i]) { ans = mul(ans, solve2(sz[i], k)); } else { ans = mul(ans, c[sz[i] + k - 1][k - 1]); } } } printf("%d\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | F - Painting Graphs with AtCoDeer |
User | niyaznigmatul |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 2552 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:59:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d", &n, &m, &k); ^ ./Main.cpp:61:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", from + i, to + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt, 1_043.txt, 1_044.txt, 1_045.txt, 1_046.txt, 1_047.txt, 1_048.txt, 1_049.txt, 1_050.txt, 1_051.txt, 1_052.txt, 1_053.txt, 1_054.txt, 1_055.txt, 1_056.txt, 1_057.txt, 1_058.txt, 1_059.txt, 1_060.txt, 1_061.txt, 1_062.txt, 1_063.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 4 ms | 1536 KB |
0_001.txt | AC | 4 ms | 1536 KB |
0_002.txt | AC | 4 ms | 1536 KB |
1_003.txt | AC | 4 ms | 1536 KB |
1_004.txt | AC | 4 ms | 1536 KB |
1_005.txt | AC | 4 ms | 1536 KB |
1_006.txt | AC | 5 ms | 1536 KB |
1_007.txt | AC | 5 ms | 1536 KB |
1_008.txt | AC | 5 ms | 1536 KB |
1_009.txt | AC | 4 ms | 1536 KB |
1_010.txt | AC | 4 ms | 1536 KB |
1_011.txt | AC | 4 ms | 1536 KB |
1_012.txt | AC | 5 ms | 1536 KB |
1_013.txt | AC | 5 ms | 1536 KB |
1_014.txt | AC | 5 ms | 1536 KB |
1_015.txt | AC | 5 ms | 1536 KB |
1_016.txt | AC | 4 ms | 1536 KB |
1_017.txt | AC | 4 ms | 1536 KB |
1_018.txt | AC | 4 ms | 1536 KB |
1_019.txt | AC | 5 ms | 1536 KB |
1_020.txt | AC | 5 ms | 1536 KB |
1_021.txt | AC | 5 ms | 1536 KB |
1_022.txt | AC | 5 ms | 1536 KB |
1_023.txt | AC | 4 ms | 1536 KB |
1_024.txt | AC | 4 ms | 1536 KB |
1_025.txt | AC | 4 ms | 1536 KB |
1_026.txt | AC | 5 ms | 1536 KB |
1_027.txt | AC | 5 ms | 1536 KB |
1_028.txt | AC | 4 ms | 1536 KB |
1_029.txt | AC | 4 ms | 1536 KB |
1_030.txt | AC | 5 ms | 1536 KB |
1_031.txt | AC | 6 ms | 1536 KB |
1_032.txt | AC | 4 ms | 1536 KB |
1_033.txt | AC | 4 ms | 1536 KB |
1_034.txt | AC | 5 ms | 1536 KB |
1_035.txt | AC | 6 ms | 1536 KB |
1_036.txt | AC | 4 ms | 1536 KB |
1_037.txt | AC | 4 ms | 1536 KB |
1_038.txt | AC | 5 ms | 1536 KB |
1_039.txt | AC | 6 ms | 1536 KB |
1_040.txt | AC | 4 ms | 1536 KB |
1_041.txt | AC | 4 ms | 1536 KB |
1_042.txt | AC | 5 ms | 1536 KB |
1_043.txt | AC | 6 ms | 1536 KB |
1_044.txt | AC | 4 ms | 1536 KB |
1_045.txt | AC | 4 ms | 1536 KB |
1_046.txt | AC | 5 ms | 1536 KB |
1_047.txt | AC | 5 ms | 1536 KB |
1_048.txt | AC | 4 ms | 1536 KB |
1_049.txt | AC | 4 ms | 1536 KB |
1_050.txt | AC | 5 ms | 1536 KB |
1_051.txt | AC | 5 ms | 1536 KB |
1_052.txt | AC | 4 ms | 1536 KB |
1_053.txt | AC | 4 ms | 1536 KB |
1_054.txt | AC | 5 ms | 1536 KB |
1_055.txt | AC | 5 ms | 1536 KB |
1_056.txt | AC | 4 ms | 1536 KB |
1_057.txt | AC | 4 ms | 1536 KB |
1_058.txt | AC | 5 ms | 1536 KB |
1_059.txt | AC | 5 ms | 1536 KB |
1_060.txt | AC | 4 ms | 1536 KB |
1_061.txt | AC | 4 ms | 1536 KB |
1_062.txt | AC | 4 ms | 1536 KB |
1_063.txt | AC | 5 ms | 1536 KB |