oj.uz

답안 #232066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232066 2020-05-15T23:46:41 Z AQT 철인 이종 경기 (APIO18_duathlon) C++14
10 / 100
 171 ms 60076 KB 
// Problem : APIO '18 P3 - Duathlon
// Contest : DMOJ
// URL : https://dmoj.ca/problem/apio18p3
// Memory Limit : 1 MB
// Time Limit : 600 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include <bits/stdc++.h>

using namespace std;

int N, M;
vector<int> graph[100005], cgraph[200005];
vector<pair<int, int>> stk;
vector<vector<pair<int, int>>> cmp;
int par[200005], dfn[200005], low[200005], t;
long long sz[200005], csz[200005];
long long ans;

void dfs1(int n){
	low[n] = dfn[n] = ++t;
	int c = 0;
	for(int e : graph[n]){
		if(e == par[n]){
			continue;
		}
		if(!dfn[e]){
			c++;
			par[e] = n;
			stk.emplace_back(n, e);					
			dfs1(e);
			low[n] = min(low[n], low[e]);
			if((!par[n] && c >= 2) || (par[n] && low[n] == dfn[n])){
				pair<int, int> edg = {0, 0};
				vector<pair<int, int>> tmp;
				do{
					edg = stk.back();
					stk.pop_back();
					tmp.push_back(edg);
				}
				while(edg != make_pair(n, e));
				cmp.push_back(tmp);
			}
		}
		else if(dfn[e] < dfn[n]){
			low[n] = min(dfn[e], low[n]);
			stk.emplace_back(n, e);		
		}
	}
}

void dfs2(int n){
	sz[n] = n <= N;
	for(int e : cgraph[n]){
		if(e != par[n]){
			par[e] = n;
			dfs2(e);
			sz[n] += sz[e];
		}
	}
	if(n > N){
		csz[n] = cgraph[n].size();
	}
}

void dfs3(int n, long long tot){
	if(n > N){
		ans -= (csz[n]-1) * (tot-sz[n]) * (tot-sz[n]-1);
	}
	for(int e : cgraph[n]){
		if(n <= N && e == par[n]){
			ans -= (csz[e]-1)*sz[n]*(sz[n]-1);
		}
		if(e != par[n]){
			dfs3(e, tot);
		}
	}
}

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> M;
	for(int i = 1; i<=M; i++){
		int a, b;
		cin >> a >> b;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}
	int C = N;
	for(int i = 1; i<=N; i++){
		if(!dfn[i]){
			dfs1(i);
			if(stk.size()){
				cmp.push_back(stk);
				stk.clear();
			}
			for(auto v : cmp){
				++C;
				for(auto p : v){
					cgraph[C].push_back(p.second);
					cgraph[C].push_back(p.first);
				}
				sort(cgraph[C].begin(), cgraph[C].end());
				cgraph[C].erase(unique(cgraph[C].begin(), cgraph[C].end()), cgraph[C].end());
				for(int n : cgraph[C]){
					cgraph[n].push_back(C);
				}
			}
			dfs2(i);
			dfs3(i, sz[i]);
			ans += sz[i] * (sz[i]-1) * (sz[i] -2);
		}
	}
	cout << ans << "\n";
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Correct 10 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 8 ms 7424 KB Output is correct
7 Incorrect 8 ms 7424 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Correct 10 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 8 ms 7424 KB Output is correct
7 Incorrect 8 ms 7424 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 31080 KB Output is correct
2 Correct 111 ms 31836 KB Output is correct
3 Correct 144 ms 30180 KB Output is correct
4 Correct 128 ms 32168 KB Output is correct
5 Correct 142 ms 26592 KB Output is correct
6 Runtime error 171 ms 60076 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7424 KB Output is correct
2 Correct 10 ms 7552 KB Output is correct
3 Correct 10 ms 7680 KB Output is correct
4 Correct 10 ms 7808 KB Output is correct
5 Correct 10 ms 7680 KB Output is correct
6 Correct 10 ms 7680 KB Output is correct
7 Correct 10 ms 7680 KB Output is correct
8 Correct 9 ms 7680 KB Output is correct
9 Correct 9 ms 7680 KB Output is correct
10 Correct 9 ms 7552 KB Output is correct
11 Correct 10 ms 7680 KB Output is correct
12 Correct 10 ms 7808 KB Output is correct
13 Correct 11 ms 7936 KB Output is correct
14 Correct 21 ms 10880 KB Output is correct
15 Correct 33 ms 13696 KB Output is correct
16 Correct 40 ms 16248 KB Output is correct
17 Correct 9 ms 7680 KB Output is correct
18 Correct 9 ms 7552 KB Output is correct
19 Correct 10 ms 7680 KB Output is correct
20 Correct 9 ms 7680 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 27044 KB Output is correct
2 Correct 158 ms 27684 KB Output is correct
3 Correct 154 ms 27808 KB Output is correct
4 Correct 155 ms 27680 KB Output is correct
5 Correct 161 ms 27684 KB Output is correct
6 Correct 148 ms 36452 KB Output is correct
7 Correct 164 ms 33380 KB Output is correct
8 Correct 141 ms 31912 KB Output is correct
9 Correct 144 ms 30372 KB Output is correct
10 Runtime error 164 ms 50596 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 11 ms 7808 KB Output is correct
3 Incorrect 11 ms 7680 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 27040 KB Output is correct
2 Correct 147 ms 27556 KB Output is correct
3 Incorrect 149 ms 25640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Correct 10 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 8 ms 7424 KB Output is correct
7 Incorrect 8 ms 7424 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Correct 10 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 8 ms 7424 KB Output is correct
7 Incorrect 8 ms 7424 KB Output isn't correct
8 Halted 0 ms 0 KB -