Submission 1086 | MatCom Online Grader

Id	Date	User	Problem	Result	Time	Mem	Lang
1086	20/05/2013 15:13:40	otero1991	D - Técnico de laboratorio	Accepted	1685	17.4 KiB	GNU G++ 5.1.0

Code

#include <cstdio>
#include <sstream>
#include <iostream>

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <complex>
#include <cstring>

#include <ctime>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define FOR(i,n) for (int i = 1; i <= (n); ++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPI(i,c) for (typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define MP make_pair

#define DB(x) cout << #x << " = " << x << endl;
#define CK(x) if(!(x)) cout << '(' << #x << ") is false!!!" << endl;

typedef long long int64;
typedef unsigned long long uint64;
typedef complex<int> point;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int INF = 1 << 30;
const double EPS = 1e-7;

const int MAXN = 100001;

vector<int> G[MAXN];
vector<int> T[MAXN];
int lowlink[MAXN],discover[MAXN],finish[MAXN],depth[MAXN],pi[MAXN];
int t,n,e;

void DFS(int s, int d)
{
	discover[s] = ++t;
	depth[s] = d;
	lowlink[s] = d;
	REPI(i,G[s])
	{
		if(depth[*i]==-1)
		{
			T[s].push_back(*i);
			pi[*i] = s;
			DFS(*i,d+1);
			lowlink[s] = min(lowlink[s],lowlink[*i]);
		}
		else
		{
			if(*i != pi[s])
				lowlink[s] = min(lowlink[s],depth[*i]);
		}
	}
	finish[s] = ++t;
}
bool is_ancestor(int a, int b)
{
	return discover[a] >= discover[b] && finish[a]<=finish[b];
}

bool solve1(int a, int b, int g1, int g2)
{
	if(pi[g1] != g2 && g1 != pi[g2]) return true;//no arista arbol
	if(pi[g1] == g2) swap(g1,g2);
	if(lowlink[g2]<depth[g2]) return true;//no puente
	return (is_ancestor(a,g2)==is_ancestor(b,g2));
}

void init()
{
	for(int i = 1; i <= n; i++)
	{
		depth[i] = -1;
		pi[i] = -1;
	}
}
int main()
{
	ios::sync_with_stdio(false);

cin>>n>>e;
	for(int i = 0; i < e; i++)
	{
		int u,v; cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	init();
	t = 0;
	DFS(1,0);
	int q; cin>>q;
	while(q--)
	{
		int a,b,g1,g2; cin>>a>>b>>g1>>g2;
		cout<<(solve1(a,b,g1,g2)?"si":"no")<<endl;
	}

return 0;
}
// Daniel Otero Baguer (UH++)

Judgement Details

Test 01: 0.015 0.000 3768K ok
Test 02: 0.014 0.000 3764K ok
Test 03: 2.978 1.638 16980K ok
Test 04: 0.016 0.000 3780K ok
Test 05: 0.281 0.218 6440K ok
Test 06: 0.479 0.390 7952K ok
Test 07: 0.650 0.546 9592K ok
Test 08: 1.041 0.780 12172K ok
Test 09: 0.510 0.452 10848K ok
Test 10: 0.634 0.515 12352K ok
Test 11: 2.701 1.685 17784K ok
Accepted

Matcom Online Grader