oj.uz

Submission #340668

# Submission time Handle Problem Language Result Execution time Memory
340668 2020-12-28T05:51:35 Z amunduzbaev Shymbulak (IZhO14_shymbulak) C++14
30 / 100
 1130 ms 188652 KB 
/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 5000;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, used[N];
pii dis[N][N], ans;
vector<vii> edges(N), v(N);

void bfs(int cur){
	queue<pii> q;
	q.push({cur, 0});
	while(!q.empty()){
		auto cc = q.front();
		q.pop();
		if(used[cc.ff] && dis[cur][cc.ff].ff == cc.ss){
			dis[cur][cc.ff].ss++;
			for(auto x:edges[cc.ff]){
				q.push({x, cc.ss+1});
			}
			continue;
		}else if(used[cc.ff]) continue;
		used[cc.ff] = 1;
		dis[cur][cc.ff] = {cc.ss, 1};
		for(auto x:edges[cc.ff]){
			q.push({x, cc.ss+1});
		}
	}
}

void solve(){
	cin>>n;
	for(int i=0;i<n;i++){
		int a, b;
		cin>>a>>b;
		edges[a].pb(b);
		edges[b].pb(a);
	}
	for(int i=1;i<=n;i++){
		memset(used, 0, sizeof used);
		bfs(i);
	}
	
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(dis[i][j].ff > ans.ff){
				ans = dis[i][j];
			}else if(dis[i][j].ff == ans.ff){
				ans.ss += dis[i][j].ss;
			}
		}
	}
	cout<<ans.ss<<endl;
	return;
}

int main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 15 ms 4588 KB Output is correct
15 Correct 12 ms 4588 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 7276 KB Output is correct
2 Correct 24 ms 8940 KB Output is correct
3 Correct 43 ms 12524 KB Output is correct
4 Correct 52 ms 12524 KB Output is correct
5 Correct 1130 ms 188652 KB Output is correct
6 Runtime error 11 ms 964 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 1004 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -