Compare text

Find the difference between two text files

Real-time diff

Unified diff

Collapse lines

Highlight change

Syntax highlighting

Tools

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Comparing sensitive data, confidential files or internal emails?

Most legal and privacy policies prohibit uploading sensitive data online. Diffchecker Desktop ensures your confidential information never leaves your computer. Work offline and compare documents securely.

Download Diffchecker Desktop Learn more

Untitled diff

Created 9 years agoDiff never expires

0 removals

101 lines

3 additions

104 lines

#include <iostream>

#include <cstring>

#include <vector>

#include <set>

using namespace std;

const int MAX = 100005;

vector<int> adj[MAX];

long long ver[MAX], num[MAX], den[MAX];

int n, m, k;

bool mark[MAX];

bool cmp(pair<long long, long long> a, pair<long long, long long> b)

{

return (a.first * b.second < a.second * b.first);

}

struct cmpp

{

bool operator ()(pair<pair<long long, long long>, int> l, pair<pair<long long, long long>, int> r)

{

if (cmp(l.first, r.first))

return true;

if (cmp(r.first, l.first))

return false;

return (l.second < r.second);

}

};

set<pair<pair<long long, long long>, int>, cmpp> s;

pair<long long, long long> ans;

void go(pair<long long, long long> lim)

{

memset(mark, false, sizeof(mark));

for (int i = 0; i < k; i++)

mark[ver[i]] = true;

s.clear();

for (int v = 0; v < n; v++)

if (!mark[v])

{

num[v] = den[v] = 0;

for (int i = 0; i < adj[v].size(); i++)

{

int u = adj[v][i];

den[v]++;

if (!mark[u])

num[v]++;

}

if (num[v] < den[v])

s.insert(make_pair(make_pair(num[v], den[v]), v));

}

while (!s.empty())

{

int v = s.begin()->second;

s.erase(s.begin());

if (cmp(ans, make_pair(num[v], den[v])))

ans = make_pair(num[v], den[v]);

if (!cmp(make_pair(num[v], den[v]), lim))

break;

mark[v] = true;

for (int i = 0; i < adj[v].size(); i++)

{

int u = adj[v][i];

if (!mark[u])

{

s.erase(make_pair(make_pair(num[u], den[u]), u));

num[u]--;

s.insert(make_pair(make_pair(num[u], den[u]), u));

}

for (int i = 0; i < n; i++)

if (!mark[i])

ans = make_pair(1, 1);

}

int main()

{

ios::sync_with_stdio(false);

ans.first = 0;

ans.second = 1;

cin >> n >> m >> k;

for (int i = 0; i < k; i++)

{

cin >> ver[i];

ver[i]--;

}

for (int i = 0; i < m; i++)

{

int u, v;

cin >> u >> v;

u--;

v--;

adj[u].push_back(v);

adj[v].push_back(u);

}

go(make_pair(2, 1));

go(ans);

int cnt = 0;

for (int i = 0; i < n; i++)

if (!mark[i])

cnt++;

cout << cnt << endl;

for (int i = 0; i < n; i++)

if (!mark[i])

cout << i + 1 << " ";

cout << endl;

return 0;

}

Saved diffs

Original text

Open file

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
const int MAX = 100005;
vector<int> adj[MAX];
long long ver[MAX], num[MAX], den[MAX];
int n, m, k;
bool mark[MAX];
bool cmp(pair<long long, long long> a, pair<long long, long long> b)
{
	return (a.first * b.second < a.second * b.first);
}
struct cmpp
{
	bool operator ()(pair<pair<long long, long long>, int> l, pair<pair<long long, long long>, int> r)
	{
		if (cmp(l.first, r.first))
			return true;
		if (cmp(r.first, l.first))
			return false;
		return (l.second < r.second);
	}
};
set<pair<pair<long long, long long>, int>, cmpp> s;
pair<long long, long long> ans;
void go(pair<long long, long long> lim)
{
	memset(mark, false, sizeof(mark));
	for (int i = 0; i < k; i++)
		mark[ver[i]] = true;
	s.clear();
	for (int v = 0; v < n; v++)
		if (!mark[v])
		{
			num[v] = den[v] = 0;
			for (int i = 0; i < adj[v].size(); i++)
			{
				int u = adj[v][i];
				den[v]++;
				if (!mark[u])
					num[v]++;
			}
			if (num[v] < den[v])
				s.insert(make_pair(make_pair(num[v], den[v]), v));
		}
	while (!s.empty())
	{
		int v = s.begin()->second;
		s.erase(s.begin());
		if (cmp(ans, make_pair(num[v], den[v])))
			ans = make_pair(num[v], den[v]);
		if (!cmp(make_pair(num[v], den[v]), lim))
			break;
		mark[v] = true;
		for (int i = 0; i < adj[v].size(); i++)
		{
			int u = adj[v][i];
			if (!mark[u])
			{
				s.erase(make_pair(make_pair(num[u], den[u]), u));
				num[u]--;
				s.insert(make_pair(make_pair(num[u], den[u]), u));
			}
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	ans.first = 0;
	ans.second = 1;
	cin >> n >> m >> k;
	for (int i = 0; i < k; i++)
	{
		cin >> ver[i];
		ver[i]--;
	}
	for (int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	go(make_pair(2, 1));
	go(ans);
	int cnt = 0;
	for (int i = 0; i < n; i++)
		if (!mark[i])
			cnt++;
	cout << cnt << endl;
	for (int i = 0; i < n; i++)
		if (!mark[i])
			cout << i + 1 << " ";
	cout << endl;
	return 0;
}

Changed text

Open file

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
const int MAX = 100005;
vector<int> adj[MAX];
long long ver[MAX], num[MAX], den[MAX];
int n, m, k;
bool mark[MAX];
bool cmp(pair<long long, long long> a, pair<long long, long long> b)
{
	return (a.first * b.second < a.second * b.first);
}
struct cmpp
{
	bool operator ()(pair<pair<long long, long long>, int> l, pair<pair<long long, long long>, int> r)
	{
		if (cmp(l.first, r.first))
			return true;
		if (cmp(r.first, l.first))
			return false;
		return (l.second < r.second);
	}
};
set<pair<pair<long long, long long>, int>, cmpp> s;
pair<long long, long long> ans;
void go(pair<long long, long long> lim)
{
	memset(mark, false, sizeof(mark));
	for (int i = 0; i < k; i++)
		mark[ver[i]] = true;
	s.clear();
	for (int v = 0; v < n; v++)
		if (!mark[v])
		{
			num[v] = den[v] = 0;
			for (int i = 0; i < adj[v].size(); i++)
			{
				int u = adj[v][i];
				den[v]++;
				if (!mark[u])
					num[v]++;
			}
			if (num[v] < den[v])
				s.insert(make_pair(make_pair(num[v], den[v]), v));
		}
	while (!s.empty())
	{
		int v = s.begin()->second;
		s.erase(s.begin());
		if (cmp(ans, make_pair(num[v], den[v])))
			ans = make_pair(num[v], den[v]);
		if (!cmp(make_pair(num[v], den[v]), lim))
			break;
		mark[v] = true;
		for (int i = 0; i < adj[v].size(); i++)
		{
			int u = adj[v][i];
			if (!mark[u])
			{
				s.erase(make_pair(make_pair(num[u], den[u]), u));
				num[u]--;
				s.insert(make_pair(make_pair(num[u], den[u]), u));
			}
		}
	}
	for (int i = 0; i < n; i++)
		if (!mark[i])
			ans = make_pair(1, 1);
}
int main()
{
	ios::sync_with_stdio(false);
	ans.first = 0;
	ans.second = 1;
	cin >> n >> m >> k;
	for (int i = 0; i < k; i++)
	{
		cin >> ver[i];
		ver[i]--;
	}
	for (int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	go(make_pair(2, 1));
	go(ans);
	int cnt = 0;
	for (int i = 0; i < n; i++)
		if (!mark[i])
			cnt++;
	cout << cnt << endl;
	for (int i = 0; i < n; i++)
		if (!mark[i])
			cout << i + 1 << " ";
	cout << endl;
	return 0;
}