solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
inline void upd1(T1& a, const T2& b) {
a = a < b ? a : b;
}
template <class T1, class T2>
inline void upd2(T1& a, const T2& b) {
a = a > b ? a : b;
}
template <class T>
inline bool equ(const T& a, const T& b) {
return !memcmp(&a, &b, size... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
vector<pair<int, int> > e;
set<pair<int, int> > f;
vector<int> adj[MAXN];
int n, m, k, deg[MAXN], num;
bool kicked[MAXN];
vector<int> ans;
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d %d"... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
set<int> e[N];
int deg[N], x[N], y[N], ans[N], q[N], del[N];
int n, m, k, tail = 0, head = 1;
void delv(int u) {
if (deg[u] >= k || del[u]) return;
del[u] = 1;
q[++tail] = u;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= m;... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct DATA {
int first, second;
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
vector<vector<int>> adj(n + 1);
vector<int> degree(n + 1, 0);
set<pair<int, int>> good_set;
vector<bool> check(n + 1, true);
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, k, l, i, ans, a[N], b[N], in[N], x[N], y[N], z[N], head[N], go[N + N],
Next[N + N];
bool f[N], use[N + N];
inline void Add(int u, int v) {
Next[++l] = head[u], head[u] = l, go[l] = v, use[l] = 1;
}
inline void bfs(int x) {
int l, r, j... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, cnt;
struct Edge {
int u, v;
};
vector<Edge> vE;
vector<int> ans;
const int maxN = 2 * 100000 + 1;
set<int> edge[maxN];
set<int> nodes;
queue<int> Q;
int do_remove() {
while (!Q.empty()) {
int s = Q.front();
Q.pop();
if (edge[s].size() < k) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MN = 2e5 + 5;
int n, m, k, x, y;
set<int> al[MN], t;
vector<pair<int, int> > el;
void del(int u) {
if (!t.count(u) || al[u].size() >= k) return;
t.erase(u);
for (int v : al[u]) al[v].erase(u);
for (int v : al[u])
if (al[v].size() < k) del(v);
}
int mai... | 11 | CPP |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int MAX = 200005;
int ans[MAX];
vector<int> P[MAX];
pair<int, int> edges[MAX];
bool O[MAX];
int SZ[MAX];
set<pair<int, int> > wziete;
int main() {
ios_base::sync_with_... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, cnt[222222], x[222222], y[222222], all, idx[222222], idy[222222],
ans[222222];
bool used[222222];
vector<pair<int, int> > g[222222];
void upd(int i) {
used[i] = 1;
all--;
for (int j = 0; j < g[i].size(); j++) {
if (!g[i][j].second) continue;
c... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 10, cut = 700;
int n, m, k, cnt[mx], lv, x[mx], y[mx], dead[mx];
vector<pair<int, int> > adj[mx];
vector<int> res;
void er(int a, int b) {
auto it = lower_bound(adj[a].begin(), adj[a].end(), make_pair(b, 0));
if (it->second) return;
it->second = 1... | 11 | CPP |
#include <bits/stdc++.h>
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
const int MAX_N = 2e5 + 7;
struct bg_edge {
int a, b;
} edges[MAX_N];
struct bg_state {
int node;
long unsigned int deg;
bool operator>(const bg_state& o) const { return deg > o.deg; }
};
static ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n, m, k, deg[N], ans[N], s[N], t[N];
map<int, bool> adj[N];
vector<int> g[N];
bool alive[N];
void solve() {
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
q;
memset(alive, 1, sizeof(al... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> edge[200009];
set<int> g[200009];
int vis[200009];
int ar[200009];
int ans;
int n, m, k;
void dfs(int v) {
if (g[v].size() >= k || vis[v] == 1) return;
--ans;
vis[v] = 1;
for (auto u : g[v]) {
g[u].erase(v);
dfs(u);
}
}
int main() {
ios_ba... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, fs;
std::vector<int> yol[200005];
pair<int, int> o[200005];
int ans, yaz[200005], say[200005], del[200005];
map<pair<int, int>, int> mp;
void sil(int k) {
if (del[k] == 1) return;
del[k] = 1;
ans--;
for (int i = 0; i < yol[k].size(); ++i) {
if (mp[make... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void del(int edge, vector<set<int>>& g, map<int, int>& degr, int k) {
degr.erase(degr.find(edge));
for (auto neigh : g[edge]) {
g[neigh].erase(edge);
auto it = degr.find(neigh);
if (it != degr.end()) {
if (--degr[neigh] < k) {
del(neigh, g, deg... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
while (cin >> n >> m >> k) {
set<pair<int, int> > st;
vector<vector<int> > G(n + 1);
vector<int> deg(n + 1), vis(n + 1), x(m), y(m), ans(m);
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i];
deg[x[i]]++;
deg[y... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1123456;
template <typename T>
T sqr(T x) {
return x * x;
}
template <typename T>
void vout(T s) {
cout << s << endl;
exit(0);
}
long long bp(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2) res *= a;
a *= a;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, a, b, x;
vector<int> edge[200005];
pair<int, int> amie[200005];
int deg[200005], ans[200005];
set<pair<int, int> > s, r;
void go(int y, int z) {
while (!s.empty() && s.begin()->first < k) {
a = s.begin()->second;
b = (int)edge[a].size();
s.erase(s... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
struct Node {
int x, y;
} a[200010];
int deg[200010];
bool fl[200010];
set<int> v[200010];
int ans;
int ans1[200010];
int pos[200010];
void solve(int x) {
if (deg[x] >= k || !fl[x]) {
return;
}
queue<int> q;
q.push(x);
fl[x] = 0;
ans--;
whil... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int max_N = 2e5 + 10;
int x[max_N], y[max_N];
set<int> E[max_N];
void remove(int u);
int N, M, K;
int ans = 0;
int active[max_N];
int main() {
cin >> N >> M >> K;
for (int i = 1; i <= M; ++i) {
cin >> x[i] >> y[i];
E[x[i]].insert(y[i]);
E[y[i]].insert(... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<pair<int, int> > > g;
set<pair<int, int> > good;
vector<char> very_good;
vector<int> d;
int k;
void check(long long int i) {
while (!good.empty() && good.begin()->first < k) {
int v = good.begin()->second;
for (auto &y : g[v]... | 11 | CPP |
from collections import deque
def solve(adj, m, k, uv):
n = len(adj)
nn = [len(a) for a in adj]
q = deque()
for i in range(n):
if nn[i] < k:
q.append(i)
while q:
v = q.popleft()
for u in adj[v]:
nn[u] -= 1
if nn[u] == k-1:
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
long long a[200005], b[200005], deg[200005];
vector<long... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m, k;
cin >> n >> m >> k;
vector<vector<int> > edges(m, vector<int>(2));
vector<vector<int> > graph(n + 1);
vector<int> degrees(n + 1, 0);
for (int i = 0; i < m; ++i) {
scanf("%d %d", &edges[i][0], &edges[i][1]... | 11 | CPP |
#include <bits/stdc++.h>
using std::queue;
const int N = 2e5 + 6;
template <class T>
inline void read(T &x) {
T f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 + s - '0';
s = getchar();
}
x *=... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k, r[200005], redd[200005], t, xx[200005], yy[200005],
ans[200005];
vector<pair<long long, long long> > v[200005];
void red(long long x, long long time) {
if (time == 5) {
}
redd[x] = 1;
t++;
for (int i = 0; i < v[x].size(); i++) {
if (v[x]... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int m, n, k, d[N];
set<int> ad[N];
int ans[N], dd[N];
pair<int, int> ed[N];
int main() {
;
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m >> k;
for (int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
ad[u]... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, k;
cin >> n >> m >> k;
vector<vector<pair<long long, long long> > > friends(n);
vector<long long> pointers(n);
for (long long i = 0; i < m; i++) {
long long a, b;
cin >> a... | 11 | CPP |
#include <bits/stdc++.h>
const int N = 200005;
using namespace std;
int n, m, k, deg[N], ans[N];
set<pair<int, int> > st;
vector<pair<int, int> > g[N], h;
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int deg[200005];
vector<pair<int, int> > g[200005];
bool notInSet[200005];
int main() {
int n, m, k, x, y, i;
cin >> n >> m >> k;
vector<pair<int, int> > v;
for (i = 0; i < m; i++) {
cin >> x >> y;
v.push_back({x, y});
deg[x]++, deg[y]++;
g[x].push_b... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int d[MAXN];
int a[MAXN], b[MAXN], f[MAXN], ans[MAXN];
int n, m, k;
int q[MAXN], fr, re;
vector<int> E[MAXN];
set<long long> S;
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; ++i) {
scanf("%d%d", a + i, b + i);
d[a[i]]+... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 200005;
struct edge {
int u, v, next;
} G[max_n * 2];
int head[max_n];
int total;
bool visit[max_n * 2];
int in[max_n];
set<pair<int, int> > s;
int n, m, k;
int u, v;
int ans[max_n];
void add_edge(int u, int v) {
G[total].u = u;
G[total].v = v;
G[t... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int u, v;
};
int n, m, k, f[1000000 + 1], ans[1000000 + 1], q[1000000 + 1], lq = 0, rq = -1,
cur;
edge b[1000000 + 1];
vector<int> a[1000000 + 1], e[1000000 + 1];
bool remoed[1000000 + 1], remove... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
pair<int, int> vv[m];
set<int> adj[n];
int deg[n];
for (int i = 0; i < n; i++) deg[i] = 0;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n, m, k, X[MAXN], Y[MAXN], deg[MAXN], cnt;
vector<pair<int, int> > E[MAXN];
bool removed[MAXN];
void ukloni(int x, int tijme) {
if (!removed[x] && deg[x] < k) {
removed[x] = true;
cnt--;
for (auto e : E[x])
if (e.second < ti... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long M = 2e5 + 10;
vector<long long> v[200009], deg(M), vis(M);
map<pair<long long, long long>, long long> ed;
void dfs(long long s, long long k, long long p, long long &ans) {
vis[s] = 1;
ans--;
for (auto u : v[s]) {
pair<long long, long long> p1;
p1.fir... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 5;
struct edge {
int u, v, ne, num;
} e[maxn];
int n, m, k, sum;
int d[maxn], no[maxn], vis[maxn];
int head[maxn], len;
int ans[maxn];
void add(int u, int v, int num) {
e[len].u = u;
e[len].v = v;
e[len].num = num;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int n, m, k, used[N], w[N], all, deg[N];
bool c[N];
vector<set<int> > g(N);
vector<int> res;
vector<pair<int, int> > reb;
queue<int> q;
void bfs() {
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto& u : g[v]) {
if (deg[u] == ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int t, id, next;
Edge() {}
Edge(int a, int b, int c) : t(a), id(b), next(c) {}
};
Edge e[400005];
int head[200005], ans[200005], k;
int cur;
int d[200005], sum;
bool col[200005];
void dfs(int x) {
col[x] = 0;
sum--;
for (int i = head[x]; i; i = e[i... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, m, k, indi[(int)5e5 + 110];
set<int> gra[(int)5e5 + 110];
int arr[(int)5e5 + 110], bra[(int)5e5 + 110], result[(int)5e5 + 110],
donno[(int)5e5 + 110];
int track;
void funck(int u) {
queue<int> pq;
pq.push(u);
while (!pq.empty()) ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void func(void) {
freopen("input.c", "r", stdin);
freopen("output.c", "w", stdout);
}
void print(vector<long long> &v) {
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
printf("%lld ", v[i]);
}
printf("\n");
}
void print(vector<pair<long long,... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<int> adj[N];
int deg[N], ans[N];
pair<int, int> ed[N];
queue<int> lazy;
bool rem_e[N], rem_v[N];
int k, tot;
void erase(int i) {
if (rem_e[i]) return;
rem_e[i] = true;
for (int u : {ed[i].first, ed[i].second}) {
if (deg[u] == k) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INFTY = 20000000;
const int MAX = 500100;
const int MOD = 10000000;
void coutTab(int* tab, int n) {
for (int i = 0; i < n; i++) {
cout << tab[i] << " ";
}
cout << "\n";
}
int n, m, k;
vector<set<int> > G(MAX);
int s[MAX];
bool was[MAX];
pair<int, int> E[... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double EPS = 1e-8;
const int MOD = 998244353;
template <typename T>
void cmin(T &x, T y) {
if (y < x) x = y;
}
template <typename T>
void cmax(T &x, T y) {
if (y... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<pair<int, int> > arr(m);
vector<vector<int> > G(n);
vector<int> in(n), vis(n);
for (auto& it : arr) {
int u, v;
cin >> u >> v;
in[--u]++;
in[--v]++;
it = {u, v};
G[u].push_back(v);
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
long long n, tot = 1... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int u, v, nxt;
} e[400010];
int tot;
int first[200010];
int d[200010];
void build(int u, int v) {
e[++tot] = (Edge){u, v, first[u]};
first[u] = tot;
d[u]++;
return;
}
int ans[200010];
bool book[200010];
bool is[200010];
int n, m, k;
queue<int> q;
voi... | 11 | CPP |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <typename T>
void DBG(const char* name, T&& H) {
cerr << name << " = " << H << ')' << '\n';
}
template <typename T, typename... Args>
void DBG(const char* names, T&... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double Pi = 3.14159265359;
const long long MOD = (long long)1e9 + 7;
const long long MAXN = (long long)2e5 + 10;
const long long INF = (long long)9223372036854775;
const long double EPS = (long double)1e-8;
set<long long> ans;
set<long long> g[MAXN];
vector<pair<... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int Int() {
int x;
scanf("%d", &x);
return x;
}
long long Long() {
long long x;
scanf("%lld", &x);
return x;
}
double Double() {
double x;
scanf("%lf", &x);
return x;
}
const int N = 2 * (int)1e5 + 5;
const long long MOD = (int)1e9 + 7;
int us[N], vs[N], a... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using pii = pair<int, int>;
using vi = vector<int>;
const int maxn = 5e5;
const int inf = 1e9;
const int mod = 1e9 + 7;
const ll inf64 = 1e18;
const ld pi = acos(-1.0);
const ld eps = 1e-6;
int n, m, k, deg[maxn];
set<int> g[maxn];
i... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxi = 1e6 + 2;
int a[maxi], b[maxi];
int res[maxi];
vector<int> v[maxi];
string s;
int n, m, k;
int ok;
int rem[maxi];
int deg[maxi];
map<pair<int, int>, int> mp;
queue<int> q;
void skloni(int poz) {
while (!q.empty()) {
int x = q.front();
deg[x] = 0;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
set<int> V[200200];
pair<int, int> edges[200200];
set<int> active;
int answer[200200];
void fix(int i) {
if (active.find(i) == active.end()) return;
if (V[i].size() < k) {
for (int x : V[i]) V[x].erase(i);
for (int x : V[i]) fix(x);
active.erase... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
struct edge {
int v, nxt;
} e[200005 * 2];
int cnt = 1, head[200005];
void adde(int u, int v) {
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
int vis[200005 * 2], d[200005], ans[200005], res;
struct ege2 {
int u, v;
} edge[200005];
queue<int>... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
set<int> adj[maxn];
int K;
queue<int> Q;
bool deleted[maxn];
int delc;
void del_edge(int u, int v) {
if (adj[u].count(v) != 0) {
adj[u].erase(v);
if (!deleted[u] && (int)adj[u].size() < K) {
deleted[u] = 1;
delc++;
Q.push... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int u[200050];
int v[200050];
int ans[200050];
int n, m, k;
set<int> s, num[200050];
void dfs(int u) {
if (num[u].size() < k && s.erase(u)) {
for (auto i : num[u]) {
num[i].erase(u);
dfs(i);
}
}
}
int main() {
scanf("%d%d%d... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> v[200100];
int lv[200100];
vector<int> gr[200100];
int in[200100];
vector<int> go;
map<pair<int, int>, int> taiat;
int n, m, k, cont;
void dfs(int nod) {
in[nod] = 0;
cont--;
for (auto &x : gr[nod]) {
if (taiat[{nod, x}]) {
continue;
}
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int i, j, n, m, a, b, c, d, op, mini, mij, ls, ld, ul, timp, k, maxl, rasp;
int dp[1000005], flower[1000005], viz[1000005];
int good[1000005];
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
q;
int sol[1000005];
vector<p... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n, m, ans[N], cur, done[N], deg[N], k;
vector<pair<int, int> > ve[N];
pair<int, int> e[N];
void bfs(int u, int time) {
queue<int> qu;
done[u] = 1;
cur--;
qu.push(u);
int v;
while (!qu.empty()) {
u = qu.front();
qu.pop();
fo... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5;
int n, m, k, u[N], v[N];
int deg[N], ans[N];
vector<int> G[N], id[N];
bool ok[N];
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= m; i++) {
scanf("%d %d", &u[i], &v[i]);
G[u[i]].push_back(v[i]);
G[v[i]].push_back(u[i]);
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, m, k;
int du[maxn];
set<int> g[maxn];
vector<pair<int, int> > ar;
set<pair<int, int> > st;
set<int>::iterator it;
int ans[maxn];
void dfs() {
if (st.size() == 0) return;
if (st.begin()->first < k) {
int u = st.begin()->second;
st... | 11 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
namespace Xrocks {}
using namespace Xrocks;
namespace Xrocks {
class in {
} user_input;
class out {
} output;
in& operator>>(in& X, int& Y) {
scanf("%d", &Y);
return X;
}
in& operator>>(in& X, char* Y) {
scanf("%s", Y);
return X;
}
in... | 11 | CPP |
#include <bits/stdc++.h>
const int maxn = 2e5 + 10;
const int maxm = 1.5e7 + 10;
const int mod = 998244353;
using namespace std;
int n, m, k, ans;
int num[maxn], vis[maxn], sum[maxn];
pair<int, int> a[maxn];
set<int> st[maxn];
void check(int x) {
if (num[x] >= k || !vis[x]) return;
vis[x] = 0;
ans--;
queue<int>... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
int n, m, k, deg[N], x[N], y[N], ans[N], cnt;
bool del[N];
set<int> G[N];
set<int>::iterator it;
void Del(int rt) {
if (deg[rt] >= k || del[rt]) return;
queue<int> q;
q.push(rt);
del[rt] = 1;
cnt--;
while (!q.empty()) {
int u = q.front... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int l[200100], r[200100];
int n, m, k;
int de[200100];
bool ex[200100];
struct ind {
int id, de;
ind(int a, int b) : id(a), de(b) {}
bool operator<(const ind &b) const {
return de != b.de ? de < b.de : id < b.id;
}
};
vector<int> pa[200100];
set<ind> S;
int fd(i... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
set<int> v[200005];
int x[200005];
int y[200005];
int an[200005];
set<pair<int, int> > s;
void r(int i, int k) {
if (v[x[i]].size() >= k && v[y[i]].size() >= k) {
s.erase(pair<int, int>(v[x[i]].size(), x[i]));
s.erase(pair<int, int>(v[y[i]].size(), y[i]));
v[x... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int u[200005], v[200005];
int cnt[200005];
unordered_set<int> adj[200005];
unordered_set<int> take;
stack<int> ans;
queue<int> cac, toerase;
int n, m, k;
void emptycac() {
while (cac.size()) {
int node = cac.front();
cac.pop();
for (auto j : adj[node]) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<pair<int, int> > arr(m);
vector<vector<int> > G(n);
vector<int> in(n), vis(n);
for (auto& it : arr) {
int u, v;
cin >> u >> v;
in[--u]++;... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
vector<int> v[maxn];
pair<long long, long long> a[maxn];
long long q[maxn], siz[maxn];
bool c[maxn];
long long n, m, k;
set<pair<long long, long long> > s;
map<pair<long long, long long>, bool> mark;
int main() {
ios_base::sync_with_stdio(false... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 210000;
int n, m, k;
int s[MAXN], t[MAXN];
int d[MAXN];
int ans[MAXN], vis[MAXN];
vector<int> edge[MAXN];
pair<int, int> mk(int x, int y) {
return x > y ? make_pair(y, x) : make_pair(x, y);
}
set<pair<int, int> > S;
queue<int> q;
int main() {
scanf("%d ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010, M = 400010, mod = 1e9 + 7;
int n, m, k;
int h[N], e[M], ne[M], idx;
int a[N], b[N], ans[N];
int ind[N], oud[N], cnt;
bool stn[N], stm[M];
struct Edge {
int a, b;
} edge[M];
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }
queue<in... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const long long MOD = 1e9 + 7;
pair<int, int> es[200000];
vector<pair<int, int> > g[200000];
int degree[200000];
set<pair<int, int> > st;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, k;
scanf("%d%d%d", &n, ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
set<int> adj[200005];
bool removed[200005];
int main() {
int n, m, k;
scanf("%d %d %d", &n, &m, &... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(b... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
set<int> st[N], s;
int ans[N], x[N], y[N];
int n, m, k;
void dfs(int v) {
if (st[v].size() >= k || !s.count(v)) return;
s.erase(v);
for (auto u : st[v]) {
st[u].erase(v);
if (s.count(u) && st[u].size() < k) {
dfs(u);
}
}
}
i... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e5 + 9;
set<int> g[mxn];
int k;
set<int> se;
void can_now(int u) {
if (g[u].size() < k && se.find(u) != se.end()) {
se.erase(u);
for (auto &v : g[u]) {
g[v].erase(u);
can_now(v);
}
}
}
int res[mxn];
pair<int, int> e[mxn];
int mai... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[200010], b[200010];
vector<pair<int, int> > G[200010];
int deg[200010];
int ans[200010], cnt;
queue<int> q;
inline void spfa(int x) {
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < G[u].size(); i++) {
int v = G[u]... | 11 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
using namespace std;
const int maxn = 2e5 + 10;
int N, M, K;
set<int> g[maxn];
set<pair<int, int> > person;
int deg[maxn];
int ans[maxn];
pair<int, int> edges[maxn];
int main() {
scanf("%d %d %d", &N, &M, &K);
for (int i = 1; i <= M; ++i) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> m1, m2;
const long long int N = 3 * 1e5;
vector<long long int>::iterator itr, itr1;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<pair<int, int> > Edges(m);
vector<int> Ans(m);
vector<int> degree(n);
vector<vector<pair<in... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
vector<pair<int, int> > edge(200003);
vector<vector<pair<int, int> > > ad... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, M, K;
int xList[200005], yList[200005];
int deg[200005], ans[200005];
set<int> Adj[200005];
set<pair<int, int> > s;
set<pair<int, int> >::iterator p;
void work(int u) {
s.erase(make_pair(deg[u], u));
int v;
set<int>::iterator k;
for (k = Adj[u].begin(); k != ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int from, to, vis, next;
} e[400020];
int top, head[200020];
vector<int> g[200020];
int in[200020], gg[200020];
int n, m, k;
int ans[200020], cnt;
void add_edge(int from, int to) {
e[++top].to = to;
e[top].from = from;
e[top].next = head[from];
head[... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, m;
int u[200005], v[200005];
set<int> e[200005];
int deg[200005];
bool alive[200005];
int alc;
queue<int> delet;
void del(int x) {
alive[x] = false;
alc--;
for (int y : e[x]) {
if (alive[y]) {
deg[y]--;
if (deg[y] == k - 1) {
delet.pu... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int to, net;
};
int head[2000000];
int e_n;
edge edges[2000000];
int deg[2000000];
bool sd[2000000];
int v1[2000000], v2[2000000];
set<pair<int, int> > help;
set<pair<int, int> > tt;
void Init() {
help.clear();
e_n = 0;
memset(sd, 0, sizeof(sd));
mem... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)2e5 + 5;
int n, m, k;
vector<pair<int, int> > out[maxn];
int la[maxn];
int pos[maxn];
int deg[maxn];
int add[maxn];
bool dead[maxn];
set<pair<int, int>, greater<pair<int, int> > > s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n... | 11 | CPP |
#include <bits/stdc++.h>
const int N = 200005;
int n, m, k, ans[N], in[N], cnt;
std::map<int, bool> vis[N];
std::vector<int> G[N];
std::vector<std::pair<int, int> > e;
std::queue<int> q;
void topo() {
while (!q.empty()) {
int u = q.front();
q.pop();
in[u] = 0;
for (int i = 0; i < (signed)G[u].size(); ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf32 = 1e9 + 9;
const long long inf64 = 1e18 + 18;
const int N = 2e5 + 5;
const long long mod = 1e9 + 9;
vector<int> gr[N];
set<pair<int, int> > deg;
int pw[N];
bool used[N];
void solve() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
vector<pair<int, int> > e... | 11 | CPP |
#include <bits/stdc++.h>
struct pnt {
int hd;
int ind;
bool ded;
} p[1000000];
struct ent {
int twd;
int lst;
} e[1000000];
int cnt;
int n, m, k;
int lft;
int ans[1000000];
int u[1000000], v[1000000];
void ade(int f, int t) {
cnt++;
e[cnt].twd = t;
e[cnt].lst = p[f].hd;
p[f].hd = cnt;
p[f].ind++;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int x[202020];
int y[202020];
set<int> v[202020];
int d[202020];
int z[202020];
vector<int> q;
int c;
vector<int> r;
int p[202020];
void lol() {
for (int i = 0; i < q.size(); i++) {
int x = q[i];
if (!z[x]) continue;
z[x] = 0;
c--;
for (au... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int N, M, K;
int x[MAXN], y[MAXN];
unordered_set<int> adj[MAXN];
int ans[MAXN];
struct cmp {
bool operator()(const int &lhs, const int &rhs) const {
if (adj[lhs].size() != adj[rhs].size())
return adj[lhs].size() < adj[rhs].size();
r... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int ans[N];
int deg[N];
bool trip[N];
set<int> g[N];
int cnt, k;
void remove(int u) {
if (!trip[u]) return;
queue<int> q;
q.push(u);
trip[u] = false;
while (!q.empty()) {
u = q.front();
q.pop();
cnt--;
for (int v : g[u]) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 2e5 + 5;
const int mod = 1e9 + 7;
vector<int> g[nmax];
int destroyed;
pair<int, int> ej[nmax];
int deg[nmax], ans[nmax];
bool vis[nmax];
map<pair<int, int>, int> mp;
void dhongsho(int u, int k, int p) {
if (vis[u]) return;
vis[u] = true;
destroyed++;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long int n, m, k;
cin >> n >> m >> k;
vector<pair<long long int, long long int> > edges(m);
set<long long int> adj[n];
for (int i = 0; i < m; ++i) {
long long int u, v;
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<set<int> > g;
int n, m, k;
vector<pair<int, int> > q;
set<int> s;
void remove(int v) {
if (g[v].size() < k && s.erase(v)) {
for (auto to : g[v]) g[to].erase(v), remove(to);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m >> k;
q.resize(m);
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
vector<int> p[maxn];
int vis[maxn];
int ans[maxn];
int num[maxn];
int v[maxn], w[maxn];
int now;
int n, m, k;
void dfs(int j, int v) {
ans[j]--;
for (int i = 0; i < p[v].size(); i++) {
num[p[v][i]]--;
if (vis[p[v][i]] == 1) {
if (... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<int> G[N];
int n, m, k;
int qu[N], qv[N], vis[N], du[N], ans[N], res;
void dfs(int u) {
if (vis[u]) return;
if (du[u] < k) {
vis[u] = 1;
for (int v : G[u])
if (!vis[v]) du[v]--;
for (int v : G[u]) {
if (!vis[v]) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, k, sum;
int x[N], y[N];
vector<int> Edge[N];
int del[N], deg[N];
int ans[N];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
set<int> s, G[N];
int n, m, k;
int U[N], V[N], ans[N];
void check(int u) {
if (G[u].size() < k && s.erase(u)) {
for (auto v : G[u]) {
G[v].erase(u);
check(v);
}
}
}
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
pair<int, int> edge[maxn];
int deg[maxn], ans[maxn];
bool del[maxn], vis[maxn];
set<pair<int, int> > dic;
vector<pair<int, int> > g[maxn];
int main() {
int n, m, k, u, v;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; i++) {
scanf("%d... | 11 | CPP |
#include <bits/stdc++.h>
template <typename T>
inline T const &MAX(T const &a, T const &b) {
return a > b ? a : b;
}
template <typename T>
inline T const &MIN(T const &a, T const &b) {
return a < b ? a : b;
}
inline void add(long long &a, long long b) {
a += b;
if (a >= 1000000007) a -= 1000000007;
}
inline voi... | 11 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.