Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define inf 100000000
vector<int> g[100001];
int L[100001],R[100001],id[100001],n,k;
bool ans=1;
void solve(int v=0,int p=-1){
L[v]=-inf-1;
R[v]=inf+1;
if(id[v]!=-1)
L[v]=R[v]=id[v];
for(int i=0;i<g[v].size();i++){
int to=g[v][i];
if(t... | 514 |
Project_CodeNet | 2,016 | // Header Files {{{
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#incl... | 4,421 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<vector<int> > G;
vector<int> ans;
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
G.resize(n);
... | 350 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100003;
const int Under = -(1 << 30);
const int Up = (1 << 30);
struct node {int nxt, to;} E[N << 1];
int cnt = 0, point[N], fa[N];
void ins(int u, int v) {E[++cnt] = (node) {point[u], v}; point[u] = cnt;}
bool flag = true;
in... | 752 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
struct edges
{
int to,next;
}edge[202020];
int first[101010],now;
void adde(int x,int y)
{
now++;
edge[now].to=y;
edge[now].next=first[x];
first[x]=now;
}
int l[101010],r[101010];
bool lim[101010];
bool... | 574 |
Project_CodeNet | 2,020 | /* Generated by powerful Codeforces Tool
* You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)
* Author: alireza_kaviani
* Time: 2020-05-18 19:56:42
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespa... | 711 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using PP = pair<bool, P>;
struct Graph
{
Graph(const int v)
: V{ v }, edge(v), rev_edge(v) {}
void addEdge(const int from, const int to)
{
edge[from].push_back(to);
rev_edge[to].push_back(from);
}
const ... | 984 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
vector<vector<int> > G(101010);
int P[101010],L[101010],R[101010];
const int INF=1e7;
void bad(){
cout<<"No\n";
exit(0);
}
void dfs(int v,int p,int d){
if(P[v]!=INF){
if(P[v]... | 512 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long ll;
#define INF 1LL<<60
int N;
vector<int> E[101010];
int K;
ll P[101010];
//-----------------------------------------------------------------
ll L[101010], R[101010];
bool ans = true;
void dfs1(int cur, int par) {
... | 753 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <deque>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e... | 932 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int... | 632 |
Project_CodeNet | 2,016 |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <vector>
#define MAXN 100000
using namespace std;
int N, K;
vector <int> adj[MAXN];
int val[MAXN];
int par[MAXN];
bool vis[MAXN];
int parity[MAXN];
int minval[MAXN], maxval[MAXN];
void dfs(int i, int prv) {
par[i] = prv;
for (int j : adj[i]... | 807 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
/*#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper... | 1,335 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i,n,m) for(ll i=n;i<(ll)m;i++)
#define REP(i,n) FOR(i,0,n)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";els... | 792 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
//INSERT ABOVE HERE
signed... | 546 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <vector>
#include <limits>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
#define clr(a,v) memset((a),(v),sizeof(a))
using ll = long long;
constexpr int MAX_N = 100010;
constexpr ll INF = std::numeric_limits... | 830 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
int read();
int n, k;
int res[200005], vis[200005];
vector<int> e[200005], dis[200005];
void add(int f, int t) { e[f].push_back(t), e[t].push_back(f); }
bool check(int x, int y) { return x - y == 1 || y - x == 1; }
int main() {
n = read();
... | 527 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
const int N=100010;
struct edge{int s,t,n;}e[2*N];
int n,k,h[N],a[N],col[N],l[N],r[N],fail;
void dfs1(int x,int f)
{
if ((~a[x])&&((a[x]&1)^col[x])) fail=1;
for (int i=h[x],y; y=e[i].t,i; i=e[i].n)
if (y!=f) col[y]=col[x]^1,dfs1(y,x);
}
void dfs2(int x,int f)
{
... | 583 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a-1); i >= (b); --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)
#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, (v... | 728 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
scanf("%d %d", &u, &v);
u--; v--;
g[u].push_back(v);
g[v].push_back(u);
}
int K;
cin >> K;
vector<int... | 309 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 100009
#define nan 1000000000
using namespace std;
int n,m,tot,fst[N],pnt[N<<1],nxt[N<<1],fa[N],ans[N],lf[N],rg[N];
void gg(){
puts("No"); exit(0);
}
void add(int x,int y){
pnt[++tot]=y; nxt[tot]=fst[x]; fst[x]=tot;
}
void dfs(int x){
int i,y;
for (i=fst[x]; i; i=nxt[i]){
y=pnt[... | 492 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define maxn 200010
#define INF 1e11
#define int ll
#define pb push_back
#define f first
typedef long long ll;
typedef vector <ll> vi;
typedef pair<ll,ll> pi;
#define s second
int N,M;
vi adj[maxn];
pi range[maxn];
int ans[maxn];
pi intersect(pi i,pi j){
return pi(m... | 556 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n = 0, m = 0;
int fir[100500], nxt[200500], to[200500], rez[100500][2];
bool vis[100500];
void dfs1(int x, int fa)
{
for(int i = fir[x]; i; i = nxt[i])
{
int t = to[i];
if(t == fa) continue;
dfs1(t, x);
if(not vis[t]) continue;
if(not vis[x])
{
rez[x][0... | 623 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
#define ll long long
#define ull unsigned ll
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&... | 2,710 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typenam... | 905 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int inf = 1e6;
int n, k;
vector<int> G[N];
int L[N], R[N], a[N];
int parity[N];
void dfs(int u, int p) {
L[u] = -inf, R[u] = inf;
if (a[u] != -1) L[u] = R[u] = a[u], parity[u] = (a[u] & 1);
for (int v : G[u]) if (v != p) {
dfs(v, u);
if... | 507 |
Project_CodeNet | 2,020 | // #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio... | 906 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 944 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<unordered_map>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<complex>
#include<bitset>
#include<iostream>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pa... | 3,015 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 200005
#define inf 0x3f3f3f3f
using namespace std;
int n;
int head[N],ver[N],nxt[N],tot;
void add(int a,int b)
{
tot++;nxt[tot]=head[a];head[a]=tot;ver[tot]=b;return ;
}
int k,v[N],l[N],r[N],flag,s[N];
void dfs(int x,int f)
{
l[x]=-inf;r[x]=inf;s[x]=-1;
for(int i=head[x];i;i=nxt[i])... | 587 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using pii=std::pair<int,int>;
using namespace std;
const int maxn = 1e5 + 5;
int n, k, a, b, v, p, reqparity[2][maxn];
pii mi[2][maxn], ma[2][maxn];
vector<int> adj[maxn];
void combine(int x, int v)
{
int takev = (mi[0][v].second == x);
if(mi[takev][v].first - 1... | 839 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
int n,m;
vector<vi> graph;
vi col,parity;
const int inf = 1e9;
priority_queue<ii,vector<ii> > pq;
vi vis;
int main()
{
int x,y,i;
scanf("%d",&n);
graph.assign(n+1,vi());
for(i=1;i<n;i++)
{
sca... | 551 |
Project_CodeNet | 2,018 | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <iostream>
#include <cstdint>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <algorithm... | 3,652 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<stack>
#include<unordered_map>
#include<bitset>
using namespace std;
#define MOD... | 4,919 |
Project_CodeNet | 2,019 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
... | 2,114 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7, W = 1e6;
int n, m, L[maxn], R[maxn], o = -1, ans[maxn];
int fir[maxn], nxt[2 * maxn], to[2 * maxn], e = 0;
void add(int x, int y) {
to[++e] = y; nxt[e] = fir[x]; fir[x] = e;
to[++e] = x; nxt[e] = fir[y]; fir[y] = e;
}
int d[maxn];
void s(int pos... | 739 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)... | 669 |
Project_CodeNet | 2,017 | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | 804 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <iostream>
#include <set>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <complex>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vi;... | 454 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
struct edge{
int s,t,nxt;
}e[200010];
int hd[100010],e_c;
void add_e(int s,int t)
{
e[e_c].s=s;e[e_c].t=t;e[e_c].nxt=hd[s];hd[s]=e_c++;
e[e_c].s=t;e[e_c].t=s;e[e_c].nxt=hd[t];hd[t]=e_c++;
}
int tl,tr,t... | 699 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef long long ll;
const int N = 100010;
const int mod = 1000000007;
const int oo = 1e9;
const int base = 27;
typedef pair<int,int> pii;
int n , k,v[N];
pii up[N],dw[N];
vector<int> g[N];
void pull(int u,int par){
dw[u] = make... | 571 |
Project_CodeNet | 2,018 | //************************
//* Date: 2018.10.19 *
//* Problem: *
//* Author: xuziyuan *
//************************
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define replet(c) for(char c='a';c<='z';c++)
#define LL lo... | 426 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#... | 933 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
struct range
{
// 0 represents normal one; 1 represents empty one; 2 represents the universal one
int tp,begin,end;
range():tp(2),begin(),end(){}
range(int _tp,int _begin,int _end):tp(_tp),begin(_begin),end(_end){}
range&... | 744 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define REP(i,n) for (int i = 0; i < n; ++i)
#define FORE(x,xs) for (auto x : xs)
#define PB(x) push_back(x)
#define MP(x, y) make_pair(x, y)
... | 752 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using pi = pair<int, int>;
using lint = long long;
const int MAXN = 200005;
int n;
int dep[MAXN], dfn[MAXN], piv;
int val[MAXN], par[MAXN];
vector<int> gph[MAXN];
int minv[MAXN], actually[MAXN];
void solve(int x, int p){
minv[x] = 2e9;
if... | 691 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#define MAX_V 100010
#define INF 1000000000
using namespace std;
vector<int> G[MAX_V];
bool used[MAX_V];
long long V,E,a[MAX_V],l[MAX_V],r[MAX_V],cnt=0;
void dfs(int s, int p){
used[s] = true;
int i = 0;
while(true){
int e = G[s][i];
if(e==-1){
brea... | 620 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+5;
int main() {
int n,k;cin>>n;
vector<vector<int>> edge(n+1);
for(int i=1;i<n;i++) {
int u,v;cin>>v>>u;
edge[v].push_back(u);
edge[u].push_back(v);
}
cin>>k;
vector<i... | 492 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
class segtree {
struct node {
long long v ; // default value for the leafs
long long lazy = 0; // no lazy value
void apply(int l, int r, long long x) {
v -= x;
// set v to the new value of range [l , r] when updated wit... | 1,277 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
vector<int>l(1e5 + 3, -100000000), r(1e5 + 3, 100000000), ans(1e5 + 3), odd(1e5 + 3, -1);
vector<vector<int> >g(1e5 + 3);
void dfs1(int v, int p){
for(int i = 0; i < g[v].size(); i++){
int to = g[v][i];
if(to == p){
continue;
}
... | 689 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
... | 1,605 |
Project_CodeNet | 2,017 | #pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#inc... | 1,148 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define int ll
#define F first
#define S second
const int INF = 1e9 + 10;
const int N = 1e5 + 10;
vector<int> g[N];
int mx[N], vl[N], ans[... | 568 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb... | 694 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) fo... | 1,233 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec... | 482 |
Project_CodeNet | 2,016 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF (1e9+1)
//#define INF (1LL<<59)
#define MAX_V 100000
vector<int> G[MAX_V];
pii mergeSegment(pii a,pii b){ //... | 614 |
Project_CodeNet | 2,016 | # include <stdio.h>
# include <bits/stdc++.h>
using namespace std;
# define fi cin
# define fo cout
# define x first
# define y second
# define ll long long
# define IOS ios_base :: sync_with_stdio(0);cin.tie(0)
# define p(v) cerr << #v << " = " << v << '\n'
# define p2(v) cerr << #v << " = " << (complex < int > (v.x,v... | 579 |
Project_CodeNet | 2,016 | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
int has[100010];
struct P{
int l,r,o;
};
P val[100010];
vector<int> g[100010];
int mark[100010];
int sub(int x,int p){
int ans = mark[x] != -1;
for( auto c : g[x] )
if( c != p ) ans += sub(c,x);
return ans;
}
P merge(P a,P b){
i... | 718 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#inc... | 1,891 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define taskname "A"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e18;
int dp[maxn][2];
vector<int> adj[maxn];
int n,k;
int a[maxn];
int m... | 758 |
Project_CodeNet | 2,019 | /*
树, 我首先指定根
每一个点的值由它下面点的值确定 (一个区间)
当然, 奇偶性也得确定
下面没点, 由上面的值确定
*/
#include <bits/stdc++.h>
#define N 100005
using namespace std;
int n, m;
int fa[N];
int head[N], nex[N << 1], to[N << 1], te;
int l[N], r[N], isOdd[N], val[N];
inline void read(int &x) {
x = 0; bool sgn = false; char ch = getchar();
while(!isdigi... | 835 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long INF = 1e17;
struct lpl{
int fa, deep;
long long data, l, r;
set<long long> s;
}node[maxn];
struct ld{
int u, v;
}que[maxn];
int N, K, root, deg[maxn];
queue<int> q;
vector<int> point[maxn];
bool flag = true;
inline void putit(){... | 1,008 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair <int, int> ii;
const int N = 1e5 + 5;
int n, val[N], k;
vector <int> adj[N];
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj... | 354 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int n, a[N], m, f, wa;
vector<int> G[N];
struct Rg {
int l, r;
}b[N];
Rg dfs(int fa, int u) {
if(f) {
if(a[u] == INF) {
if(fa == 0) {
a[u] = b[u].l;
... | 661 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int INF=1<<29;
int n;
vector<int> T[100000];
int num[100000];
int parity[100000],l[100000],r[100000];
bool dfs1(int u,int p){
if(num[u]!=-1){
if(parity[u]!=num[u]%2) return false;
l[u]=num[u];
r[u]=num[u]+1;
}
else... | 445 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int,int> P;
const int MAX_N = 100000;
const int INF = 100000000;
template <typename T>
struct edge
{
int from, to;
T cost;
};
template<typename T>
struct Graph
{
int n;
vec... | 955 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
//#define FILE_IO
const int INF = 1 << 30;
int N, M;
int v[100005];
int lft[100005], rgt[100005], par[100005];
vector <int> edg[100005];
void DFS(int nod, int fth)
{
lft[nod] = -INF;
rgt[nod] = INF;
par[nod] = -1;
if(v[nod] != -1)
{
lft[nod]... | 784 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
... | 583 |
Project_CodeNet | 2,016 | class in{struct It{int it;const bool rev;explicit constexpr It(int it_, bool rev=false):it(it_),rev(rev){}int operator*(){return it;}bool operator!=(It& r){return it!=r.it;}void operator++(){rev?--it:++it;}};const It i,n;public:explicit constexpr in(int n):i(0),n(n<0?0:n){}explicit constexpr in(int i,int n):i(i,n<i),n(... | 749 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long int ll;
struct Edge{
int to; ll dist;
Edge(){}
Edge(int to,ll dist):to(to),dist(dist){}
};
template <class E>
using Graph = vector<vector<E>>;
template<class D, D INF>
struct Dijkstra {
vector<D... | 570 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = (1<<25);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);... | 860 |
Project_CodeNet | 2,018 | // Zhupengfei 2018
// This program / source file is in public domain.
// Solution for problem: Integers on a Tree 3
#include <bits/stdc++.h>
using namespace std;
// Main segment
vector<int> g[100001];
int val[100001] = {};
int L[100001] = {}, R[100001] = {};
bool known_parity[100001][2] = {};
int par[100001] = {};... | 713 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a,b,c) for(int a=b;a<=(int)c;++a)
#define fd(a,b,c) for(int a=b;a>=(int)c;--a)
#define cu(a,b,c) for(int a=b;a<(int)c;++a)
#define cd(a,b,c) for(int a=(b)-1;a>=(int)c;--a)
#define gcd(... | 675 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define vi vector<int>
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef pair<int,int> P1;
typedef pair<int,P1> P2;
... | 462 |
Project_CodeNet | 2,016 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
typedef pair<int , int> P;
typedef vector<P> vP;
typedef vector<vector<ll>> vvi;
typedef vector<vector<P>> vvP;
#define INF ... | 700 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <istream>
#include <ostream>
#include <cstdlib>
#include <cmath>
#include <cstdio>
using namespace std;
#define fi first
#define ... | 1,059 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 1,131 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
vector<vector<int>> g(100010);
vector<int> l(100010, 1e7), r(100010, -1e7);
pair<int, int> dfs(int v, int p) {
pair<in... | 614 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int N=110000;
const int INF=1e9;
int n,k;
int known[N];
int used[N];
int l[N],r[N];
vector<int> g[N];
int par[N];
vector<int> order;
int val[N];
int know_parity[N][2];
int a,b;
bool shit=0;
int ans[N];
inline void dfs(int v)
{
used[v]=1;
l[v]=-INF;
r[v]=INF;
for... | 582 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a)... | 1,310 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define pb push_back
#define int long long
#define ii pair<int, int>
const int N = 2e5 + 10;
const int oo = 1e14;
int n, k;
int val[N];
vector<int> vi[N];
priority_queue< pair<int, int> > pq;
signed main()
{
//freopen(... | 357 |
Project_CodeNet | 2,020 | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 1,136 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
// Macro Tools /////////////////////////////////////////////////////////////////
#define GET_MACRO_09(A0, A1, A2, A3, A4, A5, A6, A7, A8, NAME, ...) NAME
#define EXPAND_01(MACRO, A0, ...) \
MACRO(A0, ##__VA_ARGS__)
#define EXPAND_02(MACRO, A0, A1, ...) \
MACRO(A0, ##__... | 2,931 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#define MN 100000
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,head[MN+5],cnt=0,b[MN+5],s[MN+5],l[MN+5],r[MN+5],f... | 547 |
Project_CodeNet | 2,017 | #include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<map>
using namespace std;
typedef long long int llint;
#define... | 633 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int absolut(const int vodka){
return max(vodka, -vodka); }
pii intersect(const pii a, const pii b){
return pii { max(a.first, b.first), min(a.second, b.second) }; }
pii enlarge(const pii a){
return pii { a.first - 1, a.second + 1 }; }
boo... | 519 |
Project_CodeNet | 2,019 | #if 0
2019.12.15
每次考虑当前未被考虑的权值最小的点，设该点权值为 w ，检查与该点相连的每个点 v ，
如果 v 权值未知，另 v 的权值为 w + 1 即可。
用优先队列找出每次权值最小的点。
#endif
#include <cstdio>
#include <queue>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
typedef std::pair<int, int> Par;
struct {
inline operator int () { int x; return scanf("%d", &x),... | 552 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 1e9 + 7;//1e9 + 7;//786433;//998244353;
const double Pi = acos(-1);... | 557 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scanin... | 689 |
Project_CodeNet | 2,018 | #pragma GCC optimize(2)
// Happy TLE and WA every day!
// by: zxb
#include<bits/stdc++.h>
#define mp make_pair
#define rep(i,n) for(int i = 0; i < n; i++)
#define foreach(i,c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 3223372036854775807
#define... | 880 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define INF 10e8
using namespace std;
typedef pair<int,int> pii;
void solve();
pii pro(int x);
void drow(int x,bool o);
void write(int x,pii now);
int N,K;
vector<int> G[100010];
pii D[100010]; //max min
int ans[100010];
bool visit[100010] = {0};
bool color[100010] = {0};
int O = -1;
bool can... | 975 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 100005
#define oo (1<<30)
using namespace std;
vector<int> G[N];
int n,k,l[N],r[N],d[N];
void merge(int t,int x,int y)
{
l[t]=max(l[t],x),r[t]=min(r[t],y);
}
void dfs(int t,int fa)
{
int i; d[t]=d[fa]^1;
for(i=0;i<G[t].size();i++)
if(G[t][i]!=fa){
dfs(G[t][i],t);
merge(t,l[G... | 514 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
vector<int>v[100002];
priority_queue<pair<int,int>>q;
int c[100002];
int n,m;
int main() {
scanf("%d",&n);
for(int a,b, i=0;i<n-1;i++){
scanf("%d%d",&a,&b);
v[a].push_back(b);
v[b].push_back(a);
}
scanf("%d",&m);
for(int i=1;i<=n;i++){
c[i]=-1e7;
}
for(int a,b, i=0;i<m... | 270 |
Project_CodeNet | 2,018 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
using namespace std;
typedef long long ll;
vector<int> e[100003];
int eo[100003];
int p[100003];
pair<int, int>... | 867 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
typedef long long ll;
using namespace std;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
ll n, m;
vector<int> graph[1030000];
ll p[1030000];
set<pair<int, int> > q_min;
set<pair<int, int> > q_max;
ll min_value[10300... | 1,070 |
Project_CodeNet | 2,018 | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 914 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
int mx[100000],mi[100000];
bool k[100000]={};
bool used[100000]={};
vector<int> hen[100000];
void dfsx(int i){
used[i]=true;
for(int j=0;j<hen[i].size();j++){
if(used[hen[i][j]])continue;
if(!k[hen[i][j]]) mx... | 609 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int INF=1e9;
const int MX=1e5+5;
int n,k,id[MX],l[MX],r[MX];
vector<int> adj[MX];
bool ok;
void dp(int u,int p){
l[u]=-INF,r[u]=INF;
if(~id[u]) l[u]=r[u]=id[u];
for(int v:adj[u]) if(v!=p){
dp(v,u);
if(l[... | 515 |
Project_CodeNet | 2,017 | // 5:12
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <map>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <stack>
#include <queue>
#include <cstring>
#include <iterator>
#define FOR(n) for(int cnt=0;cnt<(n);++cnt)
#define FOR_R(it,cont) for(auto it=rbegin(cont);... | 699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.