結果

問題 No.408 五輪ピック
ユーザー sntea
提出日時 2016-08-06 00:05:01
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 2,655 ms
コード長 4,215 Byte
コンパイル時間 1,755 ms
使用メモリ 4,300 KB
最終ジャッジ日時 2018-07-15 20:57:01

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_example_01.in AC 3 ms
1,544 KB
00_example_02.in AC 3 ms
1,536 KB
00_example_03.in AC 2 ms
1,536 KB
00_example_04.in AC 3 ms
1,548 KB
00_example_05.in AC 2 ms
1,548 KB
10_rand_01.in AC 13 ms
2,876 KB
10_rand_02.in AC 15 ms
2,872 KB
10_rand_03.in AC 19 ms
3,136 KB
10_rand_04.in AC 11 ms
2,748 KB
10_rand_05.in AC 12 ms
2,808 KB
10_rand_06.in AC 16 ms
2,612 KB
10_rand_07.in AC 15 ms
2,612 KB
10_rand_08.in AC 24 ms
3,404 KB
10_rand_09.in AC 13 ms
3,252 KB
10_rand_10.in AC 7 ms
1,884 KB
20_max_01.in AC 13 ms
2,872 KB
20_max_02.in AC 14 ms
3,040 KB
20_max_03.in AC 16 ms
3,136 KB
20_max_04.in AC 19 ms
3,464 KB
20_max_05.in AC 21 ms
3,620 KB
30_grid_01.in AC 8 ms
2,084 KB
30_grid_02.in AC 5 ms
1,820 KB
30_grid_03.in AC 12 ms
2,608 KB
40_special_01.in AC 22 ms
4,300 KB
40_special_02.in AC 19 ms
3,788 KB
40_special_03.in AC 190 ms
3,140 KB
40_special_04.in AC 28 ms
3,664 KB
40_special_05.in AC 830 ms
3,220 KB
40_special_06.in AC 784 ms
3,508 KB
40_special_07.in AC 2,655 ms
3,568 KB
50_hand_01.in AC 3 ms
1,524 KB
50_hand_02.in AC 2 ms
1,536 KB
テストケース一括ダウンロード

ソースコード

diff #
#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

//library
typedef int cost_t;

class Edge {
public:
	int to;
	cost_t cost;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	bool operator< (const Edge& x) const {
		return cost < x.cost;
	}

	bool operator> (const Edge& x) const {
		return cost > x.cost;
	}
};

class Graph {
private:
	//const long long int INF = (long long)1e18;
	vector<vector<Edge> > v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<vector<Edge> >(x);
	}

	vector<Edge>& operator[](int x){
		return v[x];
	}

	const vector<Edge>& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, Edge e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost){
		add_edge(from,Edge(to,cost));
	}
};

vector<cost_t> dijkstra(int from, const Graph& v) {
	vector<cost_t> dist(v.size(),INF);
	priority_queue<Edge,vector<Edge>,greater<Edge>> que;
	que.push(Edge(from,0));
	while(!que.empty()){
		Edge e = que.top();
		que.pop();
		if(dist[e.to] == INF){
			dist[e.to] = e.cost;
			for(auto to : v[e.to]){
				if(dist[to.to] == INF)
					que.push(Edge(to.to, e.cost+to.cost));
			}
		}
	}
	return dist;
}

vector<cost_t> bellmanford(int from, const Graph& g){
	vector<cost_t> res(g.size(),INF);
	res[from] = 0;
	bool conf = true;
	int cnt = 0;
	while(conf){
		conf = false;
		for(int i = 0; i < g.size(); i++){
			if(res[i] != INF)
			for(const auto& e : g[i]){
				if(res[e.to] > res[i]+e.cost){
					conf = true;
					res[e.to] = res[i]+e.cost;
				}
			}
		}
		if(cnt > g.size()+5) return vector<cost_t>();
		cnt++;
	}
	return res;
}

Graph prim(const Graph g){
	using T = tuple<cost_t, int, int>;
	priority_queue<T, vector<T>, greater<T>> qu;
	int n = g.size();
	assert(n != 0);
	vector<bool> added(n,false);
	qu.emplace(0,0,0);
	Graph res(n);
	while(!qu.empty()){
		int from, to;
		cost_t cost;
		tie(cost, from, to) = qu.top();
		qu.pop();
		if(!added[to]){
			added[to] = true;
			res.add_edge(from, to, cost);
			res.add_edge(to, from, cost);
			for(const auto &e : g[to]){
				if(!added[e.to]){
					qu.emplace(e.cost, to, e.to);
				}
			}
		}
	}
	return res;
}
//liblary


int main()
{
	ios_init();
	int n,m;
	cin >> n >> m;
	vector<P> edge(m);
	Graph g(n);
	REP(i,m){
		int a,b;
		cin >> a >> b;
		a--; b--;
		edge[i] = P(a,b);
		g.add_edge(a,b,1);
		g.add_edge(b,a,1);
	}
	unordered_set<int> s;
	RBP(e,g[0]){
		s.insert(e.to);
	}
	//pite(ALL(s));
	string ans = "NO";
	REP(i,m){
		int a = edge[i].F, b = edge[i].S;
		if(a == 0 or b == 0) continue;
		DEBUG(a); DEBUG(b);
		unordered_set<int> as;
		RBP(e,g[a]){
			if(e.to != b and s.count(e.to)){
				as.insert(e.to);
			}
		}

		//pite(ALL(as));

		if(SZ(as) == 0) continue;

		RBP(e,g[b]){
			DEBUG(e.to);
			if(e.to != a and s.count(e.to) and !(as.count(e.to) and SZ(as) == 1)){
				DEBUG(a); DEBUG(b); DEBUG(e.to);// pite(ALL(as));
				ans = "YES";
				break;
			}
		}
		if(ans == "YES") break;
		//cout << endl;
	}
	cout << ans << endl;
	return 0;
}
0