Submission #1693978


Source Code Expand

#include <bits/stdc++.h>

#define For(i, j, k) for(int i = j; i <= k; i++)
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

const int Mod = 1e9 + 7;
const int N = 210;

void add(int &x, int y){
	x += y;
	if(x >= Mod) x -= Mod;
}

void mul(int &x, int y){
	x = (long long)(x) * y % Mod;
}

int Pow(int x, int e){
	int ret = 1;
	while(e){
		if(e & 1) ret = 1ll * ret * x % Mod;
		x = 1ll * x * x % Mod;
		e >>= 1;
	}
	return ret;
}

int gcd(int x, int y){
	return !y ? x : gcd(y, x % y);
}

int n, m, k;

int Polya(int x){
	int ret = 0;
	For(i, 1, x) add(ret, Pow(k, gcd(i, x)));
	mul(ret, Pow(x, Mod - 2));
	return ret;
}

int C[N][N];

vector<int> G[N];
int ans = 1;
int dfn[N], low[N];
bool link[N][N];

stack<pair<int, int> > st;

void calc(int a, int b){
	map<int, bool> M;
	int e = 0;
	auto s = st.top();
	do{
		++e;
		s = st.top(); st.pop();
		M[s.x] = 1, M[s.y] = 1;
	}while(s.x != a || s.y != b);

//	printf("%d -> %d: %d %llu\n", a, b, e, M.size());

	if(e <= int(M.size())) mul(ans, Polya(e));
	else mul(ans, C[e + k - 1][k - 1]);
	
}

void Tarjan(int o, int f){
	static int clk = 0;
	dfn[o] = low[o] = ++clk;

	for(int v : G[o]){
		if(v == f) continue;
		if(!dfn[v]){
			st.push(mp(o, v));
			Tarjan(v, o);
			if(low[v] >= dfn[o]) calc(o, v);
			low[o] = min(low[v], low[o]);
		}
		else if(dfn[v] < dfn[o]){
			st.push(mp(o, v));
			low[o] = min(low[o], dfn[v]);
		}
	}
}

int main(){
	scanf("%d%d%d", &n, &m, &k);
	For(i, 1, m){
		int u, v;
		scanf("%d%d", &u, &v);
		G[u].pb(v), G[v].pb(u);
		link[u][v] = link[v][u] = true;
	}

	For(i, 0, m + k){
		C[i][0] = 1;
		For(j, 1, i) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % Mod;
	}

	For(i, 1, n) if(!dfn[i]) Tarjan(i, 0);
	printf("%d\n", ans);

	return 0;
}

Submission Info

Submission Time
Task F - Painting Graphs with AtCoDeer
User dy0607
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1875 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:92:29: 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:95:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &u, &v);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 3
AC × 64
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 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 2 ms 256 KB
1_003.txt AC 2 ms 256 KB
1_004.txt AC 2 ms 384 KB
1_005.txt AC 2 ms 384 KB
1_006.txt AC 2 ms 384 KB
1_007.txt AC 2 ms 384 KB
1_008.txt AC 2 ms 384 KB
1_009.txt AC 2 ms 256 KB
1_010.txt AC 2 ms 256 KB
1_011.txt AC 2 ms 384 KB
1_012.txt AC 2 ms 384 KB
1_013.txt AC 2 ms 384 KB
1_014.txt AC 2 ms 384 KB
1_015.txt AC 2 ms 384 KB
1_016.txt AC 2 ms 384 KB
1_017.txt AC 2 ms 384 KB
1_018.txt AC 2 ms 384 KB
1_019.txt AC 2 ms 384 KB
1_020.txt AC 2 ms 384 KB
1_021.txt AC 2 ms 384 KB
1_022.txt AC 2 ms 384 KB
1_023.txt AC 2 ms 384 KB
1_024.txt AC 2 ms 384 KB
1_025.txt AC 2 ms 384 KB
1_026.txt AC 2 ms 384 KB
1_027.txt AC 2 ms 384 KB
1_028.txt AC 1 ms 256 KB
1_029.txt AC 2 ms 256 KB
1_030.txt AC 2 ms 384 KB
1_031.txt AC 2 ms 384 KB
1_032.txt AC 1 ms 256 KB
1_033.txt AC 1 ms 256 KB
1_034.txt AC 2 ms 384 KB
1_035.txt AC 2 ms 384 KB
1_036.txt AC 2 ms 384 KB
1_037.txt AC 2 ms 384 KB
1_038.txt AC 2 ms 384 KB
1_039.txt AC 2 ms 384 KB
1_040.txt AC 1 ms 256 KB
1_041.txt AC 2 ms 256 KB
1_042.txt AC 2 ms 384 KB
1_043.txt AC 2 ms 384 KB
1_044.txt AC 2 ms 256 KB
1_045.txt AC 2 ms 384 KB
1_046.txt AC 2 ms 384 KB
1_047.txt AC 2 ms 384 KB
1_048.txt AC 2 ms 384 KB
1_049.txt AC 2 ms 384 KB
1_050.txt AC 2 ms 384 KB
1_051.txt AC 2 ms 384 KB
1_052.txt AC 1 ms 256 KB
1_053.txt AC 2 ms 256 KB
1_054.txt AC 2 ms 384 KB
1_055.txt AC 2 ms 384 KB
1_056.txt AC 1 ms 256 KB
1_057.txt AC 2 ms 256 KB
1_058.txt AC 2 ms 384 KB
1_059.txt AC 2 ms 384 KB
1_060.txt AC 2 ms 384 KB
1_061.txt AC 2 ms 384 KB
1_062.txt AC 2 ms 384 KB
1_063.txt AC 2 ms 384 KB