1065B - Vasya and Isolated Vertices

whitewall_9

于 2022-03-07 00:07:57 发布

阅读量108

点赞数

分类专栏：练习题目文章标签：组合数学构造

本文链接：https://blog.csdn.net/qq_28409093/article/details/123320606

版权

练习题目专栏收录该内容

340 篇文章 1 订阅

订阅专栏

// Problem: B. Vasya and Isolated Vertices
// Contest: Codeforces - Educational Codeforces Round 52 (Rated for Div. 2)
// URL: https://codeforces.com/problemset/problem/1065/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-06 21:31:58
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	ll n, m;
	cin >> n >> m;
	
		cout << max((ll)0, n - 2 * m) << " ";
		ll t = (1 + sqrt(1 + 8 * m)) / 2;
		if (t * (t - 1) < m * 2) t ++;
		if (m)
		cout << n - t << endl;
		else 
		cout << n << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

给定一个n个顶点和m个边的无向图。求最少和最多通过研究小的样例得到最终结果