Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const int MAXN = 100010;
void bye() { std::cout << "No" << std::endl; exit(0); }
struct info {
int l, r, typ;
info operator + (info b) {
if (typ != b.typ) return (info) {0, 0, -233};
return (info) {std::max(l, b.l), std::min(r, b.r), typ};
}
info ex() { return (info) {l - 1, r + 1, typ... | 728 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int... | 626 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <queue>
using std::priority_queue;
const int MAXN=100011;
int abs(int a){
return (a>0)?a:(-a);
}
int N, K;
struct Vert{
int FE;
int Val;
bool Vis;
} V[MAXN];
struct Edge{
int y, next;
} E[MAXN<<1];
int Ecnt;
void addE(int a, int b){
++Ecnt;
E[Ecnt].y=b;E[Ecnt].next=V[a].FE;V[a]... | 476 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<set>
#include<iomanip>
#define sqr(x)(x)*(x)
#define fz1(i,n) for (i=1;i<=n;i++)
#define fd1(i,n) for (i=n;i>=1;i--)
#define fz0g(i,n) for (i=0;i<=n;i++)
#define fd0g(i,n) for (i=n;i>=... | 1,106 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
//MACROS
#define pb push_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
int orcol[1<<20], pos[1<<20], col[1<<20], n, k;
vector <int> g[1<<20];
int dfs1(int v, int p) {
... | 437 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ft first
#define sd second
#define fr(i,n) for(int i=0;i<(n);++i)
#define Fr(i,n) for(int i=1;i<=(n);++i)
#define ifr(i,n) for(int i=(n)-1;i>=0;--i)
#define iFr(i,n) for(int i=(n);i>0;--i)
vector<vector<int>> v;
vector<int> p,m,M,ans;
bool f=0;... | 664 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 100000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int root;
bool flag=true;
int n,k;
vector<int> G[500001];
int ans[500001];
int mini[500001];
int maxi[500001];
int dist[500001];
int kos[500001];
vector<int> bro[500001];
void dfs(int v,int p,int c){
di... | 985 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cmath>
#include <vector>
template <class Cost = int>
struct Edge {
int src, dst;
Cost cost;
Edge(int src = -1, int dst = -1, Cost cost = 1)
: src(src), dst(dst), cost(cost){};
bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
bool opera... | 708 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100010
#define inf 1000000
using namespace std;
struct edge{int x, y, next;}a[N*2];
int n, l, p[N], x, y, k, ff, L[N], R[N];
inline void add(int x, int y){a[++l].x=x; a[l].y=y; a[l].next=p[x]; p[x]=l;}
inline void dfs1(int x, int fa){
for(int i=p[x]; i; ... | 488 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a)... | 695 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <cassert>
using namespace std;
const int INF = 1145141919;
int n;
vector<int> et[100000]; //et[i] = 頂点iから行ける頂点の集合
int num[100000]; //num[i] = 頂点iに書かれている値 (なければINF)
pair<int, int> range[100000]; //range[i] = 頂点i以下で矛盾を無くしたいときに頂点iに書ける値の範囲 (閉区間)
//開始頂点の番号を返す
int input()... | 903 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 100030; // Change as necessary
const ll MODD = 1000000009; //
vector<int> adj[MAX_N];
int colour[MAX_N];
int val[MAX_N];
void c(int v,int col){
colour[v] = col;
for(auto x : adj[v])
if(colour[x] == 0)
c(x,3-col);
... | 638 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
typedef pair<int, int> ii;
const int N = 1e5 + 5;
int n, m, a[N], f[N], l[N], r[N], v[N], real[N];
vector<int> graph[N];
const int inf = 1e11;
void dfs(int u, int p){
... | 720 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 1,472 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+20;
const ll mod=1e9+7;
int n,k,rt;
bool flag;
int l[N],r[N],a[N];
vector<int> e[N];
void init()
{
flag=true;
for(int i=1;i<=n;i++)
{
e[i].clear(),a[i]=-1;
l[i]=-1e8,r[i]=1e8;
}
}
void dfs(int u,int fa,int dep)
{
int x=-1e9,y=... | 578 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 2,113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | 994 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
const int maxn=200020,mod=998244353;
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read(){
int x=0,f=0;char ch=getchar();
while... | 1,262 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX_N = 100005, INF = 0x3f3f3f3f;
typedef pair<int, int> pii;
class Edge {
public:
int nxt, to;
} e[MAX_N << 1];
int head[MAX_N], cnt;
void addedge(int u, int v) {
e[++cnt] = (Edge){head[u], v}, head[u] = cnt;
e[++cnt] = (... | 723 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(i... | 1,896 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
constexpr auto INVALID = 1L << 30;
bool calc_range(const vector<vector<int64_t>>& adjs, const vector<int64_t>& p,
vector<pair<in... | 725 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typede... | 760 |
Project_CodeNet | 2,017 | // Integers on a Tree
// * frank_c1
// * 2017 / 09 / 27
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(1e5) + 5;
int a[maxn], l[maxn], r[maxn], T[maxn];
vector<int> nxt[maxn], g[maxn];
int n;
void dfs(int x, int f) {
for (int i = 0; i < (int)nxt[x].size(); ++i) if (nxt[x][i] ^ f) {
dfs(n... | 866 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1,004 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<queue>
#include<cstring>
using namespace std;
int n,k;
int dist[100010];
bool vis[100010];
int ans[100010];
vector<pair<int,int> >v[100010];
void dij(int st)
{
for(int i=1;i<=n;i++)dist[i]=1e9;
priority_queue<pair<int,int> , vector<pair<i... | 562 |
Project_CodeNet | 2,018 | /*
ID:wmj20041
TASK:
LANG:C++
*/
#include<functional>
#include<algorithm>
#include<exception>
#include<stdexcept>
#include<streambuf>
#include<iterator>
#include<string.h>
#include<stdlib.h>
#include<typeinfo>
#include<valarray>
#include<iostream>
#include<sstream>
#include<istream>
#include<stdio.h>
#include<climits>
... | 1,370 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define N 100005
#define inf 0x3f3f3f3f
using namespace std;
inline int read(){
int ans=0;
char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
return ans;
}
int n,k,first[N],cnt,fa[N],val[N],low[N],high[N],ans[N],rt;
bool is[N];
... | 589 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll L... | 504 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).... | 1,448 |
Project_CodeNet | 2,020 | #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | 913 |
Project_CodeNet | 2,018 | /*
* UM.
* J@B@1 iO@1
* Y@@@B@BB. 7B@B@B@
* :@B@i,B@B@O ... | 6,304 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
struct N {
int i, v;
};
bool operator<(const N &l, const N &r) {
return l.v > r.v;
}
int main() {
cin.tie(nullptr);
ios::sync_... | 444 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
//const ll... | 667 |
Project_CodeNet | 2,020 | /// IN THE NAME OF METAL
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define sz(x) (ll) x.size()
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
... | 557 |
Project_CodeNet | 2,017 | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define... | 902 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
pair<int,int> dfs(int v,int pre,Graph& g,vector<int> &l,vector<int> &r,vector<int>& vp){
int lres=-1e9;
int rres=1e9;
if(vp[v]!=-1) lres=rres=vp[v];
for(int i=0;i<g[v].size();i++){
if(g[v][i]!=pre){
aut... | 654 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 200000;
const int INF = 10000000;
int L[N], R[N];
vector <int> bi[N];
int ai[N], r;
void dfs1(int t, int f, int d)
{
if (ai[t] != -1 && ((ai[t] & 1) ^ d)) puts("No"), exit(0);
L[t] = 0; R[t] = INF; if (ai[t] != -1) L[t] = R[t] = ai[t];
fo... | 651 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+5,M=2*N,inf=1e8;
int n,i,et,he[N],l[N],r[N];bool flag;
struct edge{int l,to;}e[M];
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
void put(int x){if (x>9) put(x... | 516 |
Project_CodeNet | 2,020 | //const int N = 1e6+5;
//vi adj[N];
//int val[N];
//void __(){
// _(int,n);
// _(vpii,edges,n-1);
// for(auto _ : edges){
// int u,v;
// tie(u,v) = _;
// adj[u].pb(v);
// adj[v].pb(u);
// }
// int k;
// cin >> k;
// vvi with_value(N);
// vb visited(n+1);
// rep(i,k... | 1,154 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair... | 469 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int a[111111];
set<pair<int, int> > s;
vector<int> g[111111];
int main(){
// freopen("input.inp", "r", stdin);
scanf("%d",&n);
for(int i = 1; i < n; ++i){
int x, y;
scanf("%d%d",&x,&y);
g[x].push_back(y);
g[y].push_back(x);
}
scanf("%d",&m);
memset... | 325 |
Project_CodeNet | 2,020 | #include <cassert>
#include "limits.h"
#include <limits>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | 1,113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 100000
vector<int> G[MAX];
int p[MAX];
using P = pair<... | 622 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define For(i, l, r) for(register int i = (l), i##end = (int)(r); i <= i##end; ++i)
#define Fordown(i, r, l) for(register int i = (r), i##end = (int)(l); i >= i##end; --i)
#define Set(a, v) memset(a, v, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define debug(x) cout << #x << ": " <<... | 742 |
Project_CodeNet | 2,016 | #include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <tuple>
#include <queue>
#... | 926 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
#define pb(x) push_back(x)
using namespace std;
vector<int> v[100005];
int num[100005][2];
pair<int,int> dfs(int n,int f){
for(vector<int>::iterator it=v[n].begin();it!=v[n].end();it++){
if(f==*it)
continue;
pair<int,int>p=dfs(*it,n);
num[n][0]=max(num[n][0],p.first);
num[n][1]=min(n... | 483 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int n;
struct st{
int lef;
int rig;
st(){
lef = INT_MAX;
rig = INT_MAX;
}
st(int lef_, int rig_){
lef = lef_;
rig = rig_;
}
st add(){
st r;
r.lef = lef;
r.rig = rig;
if (r.lef != INT_MAX){
r.lef--;
r.rig++;
}
return r;
}
};
int k;
#defi... | 712 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<long long int>len( N + 1, LLONG_MAX / 6 );
len[0] = 0;
vector<vector<long long int>>AB( N + 1 );
for( size_t i = 1; i < N; i++ ) {
long long int A, B;
cin >> A >> B;
AB[A].push_back( B );
AB[B].push_back( A );
}... | 463 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define F first
#define S second
const int N = 1e5 + 87, inf = 1e9;
vector<int> g[N];
pii dp[N];
void dfs(int p,int u)
{
for (int v : g[u]) if (v != p) {
dfs(u,v);
dp[u].F = max(dp[u].F,dp[v].F-1);
dp[u].S = min(dp[u].S,... | 504 |
Project_CodeNet | 2,016 | #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>
#include <stack>
#include... | 657 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 845 |
Project_CodeNet | 2,016 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
using namespace std;
const int MX = 150500;
vector<int> e[MX];
int ans[MX];
int main()
{
//freopen("in.txt","r", stdin);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for(int i = 1; ... | 422 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
con... | 513 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<string>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<bitset>
#include<map>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<ctime>
#include<complex>
#include<list>
using namespace ... | 584 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int n, k;
vector<int> adj[MAXN];
int p[MAXN];
vector<pair<int, int>> edge;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].e... | 402 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 400005
using namespace std;
int n,m,x,y,q[N],b[N];
struct T
{
int x,y;
}a[N];
bool cmp(T a,T b)
{
return a.y>b.y;
}
int to[N*2],nxt[N*2],fst[N],l;
void link(int x,int y)
{
to[++l]=y;nxt[l]=fst[x];fst[x]=l;
to[++l]=x;nxt[l]=fst[y];fst[y]=l;
}
void biu()
{
puts("No");
exit(0);
}
in... | 515 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = int(1e5) + 7;
const int mod = int(1e9) + 7;
typedef pair<int, int> pii;
int n, k, u, v, root;
ll l[N], r[N], va... | 692 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 100100;
const int inf = 1e8;
vector<int>g[maxn];
int n, k, value[maxn];
int result[maxn];
int li[maxn], ri[maxn];
bool defined[maxn];
bool check;
void dfs(int node, int p) {
int cnt[2] = ... | 693 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
using Pii = pair<int, int>;
int N;
vector<vector<int> > G;
int K;
vector<int> P;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
cin >> N;
G.resize(N);
for ( int i = 0; i < N-1; i++ ) {
... | 475 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int N = 1e5 + 1;
const int inf = 1e9 + 7;
typedef pair<int,int> ii;
vector<int> g[N];
int n, k;
ii L[N];
int h[N];
int ans[N];
void dfs(int u,int p) {
for(int v : g[u])
if(v != p) {
h[v] = h[u] + 1;
dfs(v,... | 532 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 669 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 435 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=100005,inf=1047483647;
struct node { int y,next; } a[N<<1];
int z[N],l[N],r[N],head[N],i,j,k,n,m,x;
bool h[N],p[N],F,F1,F2;
char c;
inline char getc()
{
#define VV 10000000
static char s[VV],*l=s,*r=s;
if (l==r)
l=s,r=s+fread(s,1,VV,stdin);
re... | 608 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
#define bit(x, y) ((x >> y) & 1)
const int N = 100005;
int n, k;
vector<int> g[N];
int l[N], r[N];
bool ok = 1;
int col[N];
int ans[N];
void dfs(int u, int ... | 553 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-1... | 582 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N=1e5+5, INF=1e9;
using namespace std;
int n, k, val[N], par[N], l[N], r[N];
vector<int> adj[N];
bool can=true;
void dfs2(int u, int x)
{
if(l[u]<=x-1 && x-1<=r[u])
{
val[u]=x-1;
}
... | 714 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 1e9;
vector<int> E[maxn];
int n , odd[maxn];
bool ok;
// 判断奇偶性
void dfs1 (int u , int fa)
{
for (auto v : E[u]){
if (v == fa) continue;
dfs1(v , u);
// cout << "现在在" << u << "点，它的奇偶性为 " << odd[u] << " 它的儿子... | 754 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1061109567
#define pb push_back
#define in(s) freopen(s,"r",stdin);
#define out(s) freopen(s,"w",stdout);
#define fi first
#define se second
#define bw(i,r,l) for (int i=r-1;i>=l;i--)
#define fw(i,l,r) for (int i=l;i<r;i++)
#define fa(i,x) for (auto i:x)
using... | 684 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define MOD 1000000007LL
#define endl "\n"
const ll INF=1e9;
const ll UNDEF = INF;
template<typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, tr... | 1,267 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cassert>
using namespace std;
using VI = vector<int>;
using P = pair<int, int>;
VI adj[101010];
int main() {
int n;
cin >> n;
VI num(n, -1);
for (int i = 0; i < n - 1; i++) {
int a, b;
... | 338 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) static_cast<int>((x).size())
using LL = long long;
template<class T, size_t D>
struct vec : vector<vec<T, D - 1>> {
template<class... Args>
vec(size_t n = 0, Args... args)
: vector<vec<T, D - 1>>(n, vec<T, D - 1>... | 996 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define ch... | 740 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using name... | 610 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<utility>
#include<cmath>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void sort(int &a,int &b)
{
if(a... | 706 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll nibu[100005]={0};
bool used[100005]={false};
ll ans[100005]={0},nans[100005]={0};
ll lb[100005]={0},rb[100005]={0};
vector<ll> node[100005];
void dfs(ll pos,ll nu... | 731 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <vector>
#include <set>
#include <cassert>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
... | 743 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <queue>
#include <cmath>
using namespace std;
#define For(i , a , b) for (int i = a , _b = b ; i <= _b ; ++i)
#define Ford(i , a ,b) for (int i = a , _b = b : i >= _b ; --i)
#define Rep(i , n) for (int i = 0 , _n ... | 1,115 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
int ans[100003];
vector<int>v[100003];
int main(){
int n,a,b,k;
cin>>n;
ans[0]=-1;
for(int i=1;i<n;i++)
{
ans[i]=-1;
cin>>a>>b;
a--;b--;
v[a].push_back(b);
v[b].push_back(a);
}
c... | 336 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
using Graph = vector<vector<int>>;
void recur(const Graph &G, vector<int> &A, vector<int> &B, int node, int prv) {
for (auto nxt : G[node]) if (nxt != prv) {
A[nxt] = max(A[nxt], A[node] - 1);
B[nxt] = min(B[nxt], B[node] + 1);
}... | 583 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_b... | 460 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N=100005;
typedef pair<int,int> pii;
vector<int>g[N];
int n,k;
vector<int>dist(N,INT_MAX),vis(N,0);
int main()
{ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
cin>>n;
for(int i=1;i<n;i++){
int u,v;cin>>u>>v;g[u].push_back(v);g[v].push_back(u)... | 331 |
Project_CodeNet | 2,017 | #include <cassert>
#include <cstdio>
#include <algorithm>
#include <vector>
static const int MAXN = 100005;
static const int INF = 0x3fffffff;
int n, k;
std::vector<int> e[MAXN];
int val[MAXN];
bool feasible = true;
int min[MAXN], max[MAXN], parity[MAXN];
void dfs_traverse(int u, int p = -1)
{
min[u] = -INF, max... | 696 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... | 669 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 441 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
struct seg {
int l, r, op;
seg move() {
seg ret;
if (op != -1) ret.op = op^1;
else ret.op = -1;
if (op == 3) ret.op = 3;
ret.l = l-1;
ret... | 883 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... | 423 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<cla... | 2,451 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define ll long long
using namespace std;
struct edge{int to,cap,rev;};
vector<int> nex[114514];
int mi[114514],ma[114514],st;
int col[114514];
int used[114514];
int ans[114514];
int used2[114514];
bool fl = ... | 840 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 564 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e5 + 1;
int n, m;
int a[N];
bool vis[N];
vector<int> adj[N];
int32_t main() { cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
c... | 418 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+5,Z=1<<29;
int n,k,i,a,b,ans[N];
struct atom{
int v,l,r;
inline bool ask(int x){return v==-1?1:l<=x && x<=r && (x&1)==v;}
inline bool empty(){return v!=-1 && (l>r || (l==r && (l&1)!=v));}
inline void operator&=(atom rhs){
if(rhs.v==-1)return;
if(v==-1... | 428 |
Project_CodeNet | 2,019 | //Created Time:2019年12月19日 星期四 09时12分26秒
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define N 100005
#define pb push_back
using namespace std;
int n, k;
int res[N], l[N], r[N], ty[N];
vector < int > G[N];
void dfs(int ,int);
void solve(int ,int);
int main(){
sc... | 737 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <cstdio>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <cassert>
#include <cfloat>
#include <climits>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#includ... | 581 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define Fore(x) for (vector<int>::iterator i = g[x].begin(); i != g[x].end(); i++) if (*i != par)
#define FAIL puts("No"), exit(0)
int rd() {
int f = 1; char c; do{ c = getchar(); if (c == '-') f = -1; }while (!i... | 608 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
... | 950 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | 612 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <queue>
#include <vector>
#include <utility>
using namespace std;
vector<int> e[100010];
int f[100010];
int done[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
int x, y;
scanf("%d%d", &x, &y);
--x; --y;
e[x].push_back(y);
e[y].push_back(x);
}
fo... | 447 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 2,293 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#define N 100005
using namespace std;
struct edge{
int k,next;
}e[N<<1];
int w[N],home[N],n,m,cnt=-1,L[N],R[N],D=1;
const int inf=1<<28;
void add(int x,int y){
cnt++;
e[cnt].k=y;
e[cnt].next=home[x];
home[x]=cnt;
}
void dfs(int k,int F){
if(w... | 488 |
Project_CodeNet | 2,018 | /*
* UM.
* J@B@1 iO@1
* Y@@@B@BB. 7B@B@B@
* :@B@i,B@B@O ... | 6,303 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.