Codeforces Round #677 (Div. 3) D/1433D Districts Connection

https://codeforces.com/contest/1433/problem/D

找两个不同权值的节点A、B连起来，所有与A不同权值的连到A上，相同的连到B上。

#include
#include
#include
#include
#include
#include
#include
#include
#include
#define debug(a) cout<<#a<<"="<>t;
  while(t--)
  {
  	LL n;cin>>n;
  	for(LL i=1;i<=n;i++) cin>>a[i];
  	LL idx=-1;
  	vector>pr;
  	for(LL i=2;i<=n;i++)
  	{
  		if(a[i]!=a[1]){
  			pr.push_back({1,i});
			idx=i;	
		}
	}
	if(idx==-1) {
		cout<<"NO"<




 
CodeForces信息学

相关

Codeforces Round 628 (Div. 2) E. Ehab's REAL Number Theory Problem

Codeforces Round #610 (Div. 2)

Codeforces Global Round 6.E题

Codeforces Round #611 (Div. 3) E题

CF1545X Codeforces Round #732

codeforces和atcoder的思维题目

Codeforces 1373F - Network Coverage（模拟网络流）

CF1481X Codeforces Round #699

CF1485X Codeforces Round #701

Educational Codeforces Round 7 F. The Sum of the k-th Powers 拉格朗日插值法

Codeforces #731 (div3) E. Air Conditioners

Codeforces Round #675

标签