Submission #138179

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<string>
#include<string.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<complex>
#include<map>
#include<set>
#include<bitset>
#include<iostream>
#include<sstream>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; i++)
#define rrep(i,n) for(int i = 1; i <= n; i++)
#define drep(i,n) for(int i = n-1; i >= 0; i--)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y);
#define mins(x,y) x = min(x,y);
#define pb push_back
#define sz(x) (int)(x).size()
#define popcount __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 1005, INF = 1000000000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1}; //<^>v

// Dijkstra
// Graph
typedef int TT;
struct edge{
	int next, to, lim;
	TT co;
	edge(){}
	edge(int next, int to, TT co=0, int lim=1):next(next),to(to),co(co),lim(lim){}
};
struct graph{
	vector<TT> head; vector<edge> e; int es, vs;
	graph(){}
	graph(int vsz, int esz){ head.resize(vsz); e.resize(esz+1); init(vsz);}
	void init(int vsz){ es = 0; vs = vsz; rep(i,vsz) head[i] = -1;}
	void add(int from, int to, TT co=0, int lim=1){ e[es] = edge(head[from],to,co,lim); head[from] = es++;}
	void add2(int from, int to, TT co=0, int lim=1){ add(from,to,co,lim); add(to,from,co,lim);}
	void addf(int from, int to, TT co=0, int lim=1){ add(from,to,co,lim); add(to,from,-co,0);}
};
//
typedef pair<TT,int> TP;
vector<TT> d1, d2; vector<int> pre;
void dijk(graph& ng, int sv, vector<TT>& ndist){
	ndist.resize(ng.vs); fill(rng(ndist),INF); pre.resize(ng.vs); fill(rng(pre),-1);
	priority_queue<TP, vector<TP>, greater<TP> > q;
	TP p; int v; ng.e[ng.es].to = sv; q.push(TP(0,ng.es));
	while(!q.empty()){
		p = q.top(); q.pop(); v = ng.e[p.se].to;
		if(pre[v] != -1) continue;
		ndist[v] = p.fi; pre[v] = p.se^1;
		for(int i = ng.head[v]; i != -1; i = ng.e[i].next)
			if(ng.e[i].lim > 0 && p.fi+ng.e[i].co < ndist[ng.e[i].to]){
				ndist[ng.e[i].to] = p.fi+ng.e[i].co; q.push(TP(p.fi+ng.e[i].co,i));}
	}
}
//

int main(){
	int n1, n2, m1, m2;
	scanf("%d%d",&n1,&m1);
	
	graph g1(MX,MX*20), g2(MX,MX*20);
	int a, b;
	rep(i,m1){
		scanf("%d%d",&a,&b);
		g1.add2(a,b,1);
	}
	
	scanf("%d%d",&n2,&m2);
	rep(i,m2){
		scanf("%d%d",&a,&b);
		g2.add2(a,b,1);
	}
	
	int x1 = INF, x2 = INF, y1 = 0, y2 = 0, d = 0;
	rep(i,n1){
		dijk(g1,i,d1);
		int r = 0;
		rep(j,n1) r = max(r,d1[j]);
		x1 = min(x1,r);
		y1 = max(y1,r);
		d = max(d,r);
	}
	rep(i,n2){
		dijk(g2,i,d2);
		int r = 0;
		rep(j,n2) r = max(r,d2[j]);
		x2 = min(x2,r);
		y2 = max(y2,r);
		d = max(d,r);
	}
	
	printf("%d %d\n",max(d,x1+x2+1),y1+y2+1);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:79:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:84:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:88:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:90:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result