답안 #264352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
264352 2020-08-14T06:20:32 Z kaage 철인 이종 경기 (APIO18_duathlon) C++17
8 / 100
195 ms 7172 KB
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 2 "main.cpp"
lint n,m;
bool used[100010];
std::vector<int> vec[100010];
int main(){
	std::cin>>n>>m;
	rep(i,m){
		int a,b;
		std::cin>>a>>b;
		vec[a].emplace_back(b);
		vec[b].emplace_back(a);
	}
	lint ans=0;
	REP(i,n){
		if(used[i]||vec[i].size()>=2)continue;
		std::stack<int> que;
		que.push(i);
		bool f=false;
		lint cnt=0;
		while(!que.empty()){
			int node=que.top();
			que.pop();
			used[node]=true;
			cnt++;
			for(int j:vec[node]){
				if(!used[j])que.push(j);
			}
			if(que.empty()){
				for(int j:vec[node]){
					if(i==j)f=true;
				}
			}
		}
		if(f)ans+=cnt*(cnt-1)*(cnt-2);
		else ans+=cnt*(cnt-1)*(cnt-2)/3;
	}
	REP(i,n){
		if(used[i])continue;
		std::stack<int> que;
		que.push(i);
		bool f=false;
		lint cnt=0;
		used[i]=true;
		while(!que.empty()){
			int node=que.top();
			que.pop();
			cnt++;
			for(int j:vec[node]){
				if(!used[j]){
					used[j]=true;
					que.push(j);
				}
			}
			if(que.empty()){
				for(int j:vec[node]){
					if(i==j)f=true;
				}
			}
		}
		if(f)ans+=cnt*(cnt-1)*(cnt-2);
		else ans+=cnt*(cnt-1)*(cnt-2)/3;
	}
	std::cout<<ans<<std::endl;
}

Compilation message

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 6008 KB Output is correct
2 Correct 172 ms 7160 KB Output is correct
3 Correct 183 ms 7128 KB Output is correct
4 Correct 169 ms 7160 KB Output is correct
5 Correct 166 ms 7160 KB Output is correct
6 Correct 195 ms 7172 KB Output is correct
7 Correct 187 ms 7160 KB Output is correct
8 Correct 164 ms 7160 KB Output is correct
9 Correct 152 ms 7160 KB Output is correct
10 Correct 156 ms 7160 KB Output is correct
11 Correct 154 ms 6964 KB Output is correct
12 Correct 152 ms 6776 KB Output is correct
13 Correct 170 ms 6728 KB Output is correct
14 Correct 169 ms 6520 KB Output is correct
15 Correct 107 ms 6008 KB Output is correct
16 Correct 111 ms 5880 KB Output is correct
17 Correct 16 ms 2816 KB Output is correct
18 Correct 16 ms 2816 KB Output is correct
19 Correct 15 ms 2816 KB Output is correct
20 Correct 24 ms 2816 KB Output is correct
21 Correct 15 ms 2816 KB Output is correct
22 Correct 13 ms 2816 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 162 ms 5936 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 6052 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Halted 0 ms 0 KB -