Submission #486185


Source Code Expand

Copy
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

#include<unordered_map> 

vector<int> e[100];
int n, k;
bool used[100], marked[100];

void dfs(int v) {
	used[v] = true;
	marked[v] = true;
	for (auto to : e[v]) {
		if (marked[to]) marked[v] = false;
	}

	for (auto to : e[v]) {
		if (!used[to]) dfs(to);
	}
}

bool solve(vector<int>& pm) {
	memset(used, 0, sizeof(used));
	memset(marked, 0, sizeof(marked));
	FOR(i, n) random_shuffle(e[i].begin(), e[i].end());
	for (auto v : pm) {
		if (!used[v]) dfs(v);
	}
	int cnt = 0;
	FOR(i, n) if (marked[i]) cnt++;
	return cnt >= k;
}

int main() {
	int e;
	 reader(n, e, k);
	FOR(i, e) {
		int a, b; reader(a, b);
		::e[a].push_back(b);
		::e[b].push_back(a);
	}

	vector<int> pm;
	FOR(i, n) pm.push_back(i);
	random_shuffle(pm.begin(), pm.end());

	FOR(i, ten(8)) {
		bool b = solve(pm);
		if (b) {
			FOR(i, n) {
				if (marked[i]) {
					cout << i << endl;
					k--;
					if (k == 0) break;
				}
			}
			return 0;
		}
	}
}

Submission Info

Submission Time
Task B - B 問題
User math
Language C++11 (GCC 4.9.2)
Score 0
Code Size 4448 Byte
Status
Exec Time 2034 ms
Memory 928 KB

Test Cases

Set Name Score / Max Score Test Cases
All 0 / 10 00_sample_1.txt, 00_sample_2.txt, 00_sample_3.txt, 20_random_1.txt, 20_random_10.txt, 20_random_11.txt, 20_random_12.txt, 20_random_13.txt, 20_random_14.txt, 20_random_15.txt, 20_random_16.txt, 20_random_17.txt, 20_random_18.txt, 20_random_19.txt, 20_random_2.txt, 20_random_20.txt, 20_random_21.txt, 20_random_22.txt, 20_random_23.txt, 20_random_24.txt, 20_random_25.txt, 20_random_26.txt, 20_random_27.txt, 20_random_28.txt, 20_random_29.txt, 20_random_3.txt, 20_random_30.txt, 20_random_4.txt, 20_random_5.txt, 20_random_6.txt, 20_random_7.txt, 20_random_8.txt, 20_random_9.txt
Case Name Status Exec Time Memory
00_sample_1.txt 27 ms 800 KB
00_sample_2.txt 25 ms 916 KB
00_sample_3.txt 25 ms 792 KB
20_random_1.txt 27 ms 916 KB
20_random_10.txt 26 ms 792 KB
20_random_11.txt 27 ms 920 KB
20_random_12.txt 27 ms 796 KB
20_random_13.txt 27 ms 736 KB
20_random_14.txt 27 ms 924 KB
20_random_15.txt 27 ms 796 KB
20_random_16.txt 27 ms 920 KB
20_random_17.txt 27 ms 924 KB
20_random_18.txt 25 ms 800 KB
20_random_19.txt 29 ms 800 KB
20_random_2.txt 28 ms 732 KB
20_random_20.txt 29 ms 924 KB
20_random_21.txt 30 ms 792 KB
20_random_22.txt 26 ms 928 KB
20_random_23.txt 29 ms 928 KB
20_random_24.txt 28 ms 804 KB
20_random_25.txt 26 ms 924 KB
20_random_26.txt 28 ms 840 KB
20_random_27.txt 26 ms 804 KB
20_random_28.txt 27 ms 924 KB
20_random_29.txt 2034 ms 800 KB
20_random_3.txt 26 ms 804 KB
20_random_30.txt 26 ms 676 KB
20_random_4.txt 27 ms 796 KB
20_random_5.txt 26 ms 928 KB
20_random_6.txt 26 ms 928 KB
20_random_7.txt 26 ms 924 KB
20_random_8.txt 26 ms 924 KB
20_random_9.txt 26 ms 924 KB