Submission #201827

#	Time	Username	Problem	Language	Result	Execution time	Memory
201827		_7_7_	Meetings (JOI19_meetings)	C++14	0 / 100	3066 ms	16504 KiB

meetings

#include "meetings.h"

#include <bits/stdc++.h>

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e3 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

using namespace std;

int res[N][N], cnt[N];
vi g[N];



int ask (int x, int y) {
	if (x > y)
		swap(x, y);
	if (res[x][y] != -1)
		return res[x][y];
	return res[x][y] = Query(0, x, y);
}

bool cmp (int x, int y) {
	return cnt[x] > cnt[y];	
}

bool bad[N];



void Solve(int n) {
	memset(res, -1, sizeof(res));
	forn (i, 1, n - 1) {
		forn (j, 1, n - 1)
			if (i != j && ask(i, j) == i)  {
				g[i].pb(j);						 
				++cnt[i];
			}
		g[0].pb(i);
	}

	queue < int > q;
	q.push(0);

	while (sz(q)) {
		int v = q.front();
		q.pop();
		sort(all(g[v]), cmp);
		for (auto x : g[v])
			bad[x] = 0;		

		for (auto x : g[v]) 
			if (!bad[x]) {
				Bridge(min(x, v), max(x, v));
				for (auto y : g[x])
					bad[y] = 1;
			}
	}
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 71