Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
const pii inf=make_pair(-1e7,1e7);
const pii fail=make_pair(1e7,-1e7);
vector<pii> range;
vector<int> edge[100000];
bool visited[100000];
pii dfs(int v){
if(visited[v]) return inf;
visited... | 600 |
Project_CodeNet | 2,018 | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cstring>
#include<cstdlib>
#inc... | 768 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int N=200005;
int tot,fi[N],zz[N],ne[N],n,m,x,y,vis[N],flag[N],flag2[N],l[N],r[N],v[N];
void jb(int x,int y){
ne[++tot]=fi[x];
fi[x]=tot;
zz[tot]=y;
}
void GG(){
puts("No");
exit(0);
}
void dfs1(int x,int y){
flag2[x]=flag[x];
l[x]=-1e9,r[x]=1e9;
for (int i=fi[... | 535 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<set>
using namespace std ;
#define MAXN 1000007
int n ;
vector < int > v[ MAXN ] ;
int val[ MAXN ] ;
int root ;
pair < int , int > aux[ ... | 924 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_... | 2,234 |
Project_CodeNet | 2,019 | //#pragma GCC optimize ("-O3","unroll-loops")
#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<cas... | 1,194 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const int Maxn = 1e5 + 1;
using std::cin;
using std::cout;
using std::pair;
using std::vector;
using std::priority_queue;
int n, k, w[ Maxn ];
bool b[ Maxn ];
std::vector < int > v[ Maxn ];
std::priority_queue < pair < int, int >, vector < pair < int, int > >, std::greater < pair < int, int > >... | 514 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define inf 1000000000
const int maxn = 1e5 + 5;
vector<int> G[maxn];
int l[maxn],r[maxn];
int id[maxn];
bool flag;
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... | 668 |
Project_CodeNet | 2,016 | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | 454 |
Project_CodeNet | 2,018 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 901 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops, no-stack-protector")
#pragma GCC target("avx,avx2,fma")
using namespace std;
using namespace __gnu_pbds;
using namespace __gn... | 1,072 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | 802 |
Project_CodeNet | 2,017 | #ifndef __RANGE_H__
#define __RANGE_H__
#include <utility>
#include <iterator>
#include <string>
#include <sstream>
#include <iostream>
template<class T>
struct Range {
T inf_m;
T sup_m;
bool inf_inclusive_m;
bool sup_inclusive_m;
static Range Empty_range();
void Reduce();
public:
static bool Equal(const Ra... | 2,363 |
Project_CodeNet | 2,016 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | 682 |
Project_CodeNet | 2,020 | /**
*
*/
#define ASSERT_LV 1
// header {{{
#ifndef ASSERT_LV
# define ASSERT_LV 1
#endif
#if ASSERT_LV == 0
# define NDEBUG
#endif
#if defined(__GNUC__) && !defined(__clang__)
#include <bits/stdc++.h>
#else
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climit... | 11,486 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make... | 2,076 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
/*
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
template <cla... | 758 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define de(x) cout<<#x<<"="<<x<<endl
#define rff freopen("input.txt","r",stdin)
#else
#define de(x)
#define rff
#endif
#define itr(x) for(__typeof((x).begin()) it=(x).begin();it!=(x).end();it++)
#define For(i,n) for (int i=1;i<=(int)(n);i++)
#define rep(i... | 594 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
constexpr int inf = 10000000;
int N;
vector<vector<int> > edge;
int K;
vector<int> P;
vector<int> low, high;
bool flg;
vector<int> ans;
void calclh(int now, int prev)
{
int min_tmp = -inf, max_tmp = inf;
if (P[now] >= 0) min_tmp = max_tmp = P[now];
fo... | 541 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define forr(i,p,n) for(ll i=p;i<n;i++)
#define tam 310010
#define offset 30010
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<map<int,int> ,int> mi;
typedef pair<ii,ii> iiii;
typedef ... | 950 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
const int MAXN = 1e5+5;
const int INF = 1e7;
vector <int> adj[MAXN];
int L[MAXN], R[MAXN];
int ans[MAXN];
int n, k;
void bye() {
printf("No\n");
exit(0);
}
... | 689 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, ... | 561 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// --- DEBUG begin --- cut here ---
template <class... Args>
string dbgFormat(const char* fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args...);
ret... | 1,275 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
using namespace std;
int n,k;
vector<int> f[110000];
int v[110000];
struct node
{
int id,x;
friend bool operator <... | 367 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v)... | 917 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007... | 913 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll lon... | 656 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define pb push_back
#define mp make_pair
int n, k;
vec<vec<int>> kids;
vec<int> v;
vec<pair<int, int>> range;
vec<int> check;
vec<bool> dp;
int fla... | 707 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int ... | 633 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
const int MAX_V = 100000;
const int INF = 100000000;
int root;
vector<int> G[MAX_V];
int depth[MAX_V], l[MAX_V], r[MAX_V], num[MAX_V];
bool dfs(int v, int p, int d) {
bool res = true;
if (num[v] != INF) {
l[v] = max(l[v], num[v]);
r[v] = min(r[v], num[v]);
}
for... | 616 |
Project_CodeNet | 2,018 | #include<iostream>
#include<stdio.h>
#include<fstream>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<string>
#include<queue>
#include<map>
#include<iomanip>
#include<cassert>
#include<complex>
#include<functional>
#include<list>
#include<cmath>
#include<... | 626 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <iostream>
#define maxn 100009
#define maxm
#define PS system("pause");
using namespace std;
const int INF=1e9;
int n,m;
vector<int>G[maxn];
int val[maxn];
bool mark[maxn];
int ll[maxn],rr[maxn];
bool dfs(int u,int fa... | 529 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int n, k, a, b; vector<int>x[100007];
int s[100007], t[100007], dist[100007];
queue<int>Q;
void bfs() {
for (int i = 0; i < 100007; i++) { dist[i] = 100000007; }
Q.push(1); dist[1] = 0;
while (!Q.empty()) {
int a1 = Q.fron... | 605 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
const int MAX=100010;
const int INFTY=1<<30;
int n,col[MAX],d[MAX];
vector<pair<int,int>> Q[MAX];//target,weight
void dijkstra(int s)
{
priority_queue<pair<int,int>> PQ;//weight,id
for(int i=0;i<n;i++)
{
d[i]=INFTY;
... | 561 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define all(a) (a).begin(),(a).end()
#de... | 1,210 |
Project_CodeNet | 2,018 | #include<cstdio>
const int MaxN=100010,inf=1<<25;
int N;
struct edge{int to;edge*next;}E[MaxN*2],*ne=E,*fir[MaxN];
void link(int u,int v){*ne=(edge){v,fir[u]};fir[u]=ne++;}
bool limed[MaxN];
int fa[MaxN],lim[MaxN],l[MaxN],r[MaxN];
bool dfs1(int i){
bool lm=0;
int st=0;
l[i]=-inf;r[i]=inf;
for(edge*e=fir[i];e;e=e->n... | 585 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | 872 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9+7;
const i64 INF = 1e18+7;
signed main(){
int n;
cin >> n;
vector<vector<int>> edges(n);
for(int i = 0; i < n - 1; ++i){
int a, b;
cin >> a >> b;
edges[--a].emplace_back(--b);
edge... | 839 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
vector<int>E[100000];
int a[100000], b[100000];
int ans[100000];
void dfs(int v, int p, int d) {
for (int u : E[v]) {
if (u == p)continue;
dfs(u, v, d ^ 1);
a[v] = max(a[v], a[u] - 1);
b[v] = min(b[v], b[u] + 1);
}
if (a[v]... | 460 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define pa pair<int,int>
#define maxn 100005
using namespace std;
priority_queue<pa>q;
vector<int>v[maxn];
int A,B,a[maxn];
bool used[maxn],has[maxn];
int main(){
int n;scanf("%d",&n);for(int i=1;i<n;i++){
scanf("%d%d",&A,&B);
v[A].push_back(B);
v[B].push_back(A);}
... | 297 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N, K;
vector<vector<int> > adj;
vector<int> col;
vector<pii> dp;
vector<int> pari;
void dfs(int u, int p) {
for(int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if(v == p) continue;
pari[v] = pari[u] ^ 1;
... | 719 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int> > g;
vector<int> a;
vector<int> dep;
void dfs(int cur, int par, int depth = 0){
dep[cur] = depth;
for(int u : g[cur]){
if(u == par) continue;
dfs(u, cur, depth+1);
}
}
typedef pair<int, int> ii;
bool ans = true;
ii merge(ii a, ii b){
i... | 937 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u... | 692 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define ... | 740 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <vector>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(i, n) printf("%d%c", a[i], i + 1 == n ? '\n' : ' ')
//-----------------------------------------------------------------... | 912 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
const int DIM = 1e5 + 5;
int val[DIM];
vector<int> edg[DIM];
priority_queue<pair<int, int>> prq;
int main(void) {
int n;
cin >> n;
fill(val + 1, val + n + 1, -1);
for (int i = 2; i <= n; ++i) {
int x, y;
cin >> x >> y;
... | 342 |
Project_CodeNet | 2,016 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define... | 778 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#defi... | 1,136 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... | 601 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003;
const ll INF=1LL<<30;
vector<int> G[MAX];
int score[MAX];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;
int main(){
int N;cin>>N;
f... | 335 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main() {
int N; cin >> N;
vector<vector<int>> G(N);
for(int i = 0; i < N - 1; ++i) {
int a, b; cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
int K; cin >> K;
vec... | 656 |
Project_CodeNet | 2,020 | #include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
... | 2,052 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
vector <int> from[100010];
int L[100010], R[100010];
int id[100010];
bool ans;
void solve(int u = 0, int p = -1){
L[u] = -INF - 1, R[u] = INF + 1;
if (id[u] != -1) L[u] = R[u] = id[u];
for (int i = 0; i < from[u].size(); i++){
int v = fro... | 617 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> E[100010];
int D[100010];
int mn[100010]; int mx[100010];
int INF = 1145141919;
int ans[100010] = {};
void dfs1(int now, int parent, int dist){
D[now] = dist;
for(int i = 0; i < E[now].size(); i++){
if(E[now].at(i) == parent) continue;
d... | 711 |
Project_CodeNet | 2,017 | #include<ctime>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<string>
#include<sstream>
#include<fstream>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<stack>
#include<set>
#include<bitset... | 872 |
Project_CodeNet | 2,016 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 808 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define MAXN 100000
const int INF=1e9;
using namespace std;
vector<int> G[MAXN+5];
int d[MAXN+5],val[MAXN+5];
int L[MAXN+5],R[MAXN+5];
bool vis[MAXN+5];
void Init()
{
memset(vis,0,sizeof(vis));
for(int i=0;i<=MAXN+3;i++)
L[i]=-INF,R[i]=INF;
}
b... | 637 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <cstdio>
#include <string>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define L... | 879 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int... | 712 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
vector<int>G[100001];
bool used[100001];
int ub[100001];
int lb[10... | 920 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v, w; };
#define rep(i, N) for (int i = 0; i < N; ... | 461 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define r... | 932 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 986 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define trace1(x) cerr<<#x<<":... | 1,039 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
// #define int long long
typedef long long ll;
#define fi first
#define se second
#define pii pair<ll,int>
#define endl '\n'
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define sz(s) (int)s.size()
#define y1 fdfbvfds
typedef long double f80;
#define ... | 912 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | 1,318 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<vector>
#include<assert.h>
using namespace std;
int const N = 2e5 + 41;
int const INF = 1e7 + 41;
int n, k, st[N], cnt[N], ans[N], f[N];
vector<int> e[N];
void prepare(){
#ifdef _DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
void re... | 751 |
Project_CodeNet | 2,018 | #include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdio>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
using namespace std;
const int N=100005,INF=1000000000;
bool jdg;
int n,m,x,c[N],h[N],L[N],R[N],siz[N],cnt;
struct edge{int v,n;} e[N<<1];
int getint()
{
char ch;
while(!isdigit(ch=getchar()));
int x=... | 842 |
Project_CodeNet | 2,019 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf_int = 1e9 + 100;
const ll inf_ll = 1e18;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll... | 1,173 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}... | 1,739 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
using namespace std;
typedef long long s64;
const int ONE = 200005;
const int INF = 214748364;
#define next nxt
int get()
{
int res = 1, Q = 1; char c;
while( (c = getchar... | 865 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int inf = 0x3f3f3f3f;
vector <int> g[N];
int n, k, dist[N];
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
void input(){
scanf("%d", &n);
for (int i = 1; i <= n - 1; i++) {
int u,... | 390 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#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 pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0... | 728 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
vector<int> G[123456];
int d[123456];
int main()
{
int n;
ios::sync_with_stdio(0);
cin >> n ;
for (int i=0;i<n-1;i++)
{
int x,y;
cin >> x>> y;
--x,--y;
G[x].push_back(y);
G[y].push_back(x);
}
int k;
cin... | 367 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
vector<int> v[100005];
pair<int,int> r[100005];
int dep[100005],sz[100005];
bool del[100005];
void get(int node,int p)
{
dep[node]=dep[p]+1;
r[node]={-1e9,1e9};
for (int u:v[node])
{
if (u!=p)
get(u,node);
}
}
int pre(int node,int p)
{
sz[node]=1;
for (int u:v[no... | 617 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#include <iomanip>
#define all(x) x.begin(),x.end()
#define ff first
#define s... | 688 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int N,K;
typedef pair <int,int> P;
vector<int> G[100001];
int dist[100001];
int main() {
cin >> N;
for(int i = 0; i < N-1; i++) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
cin >> K;
priority_queue<P,vector<P>... | 338 |
Project_CodeNet | 2,017 | #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef... | 1,049 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(... | 421 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int N=1e5+10;
int n,k,q[N],v[N];
vector<int> e[N];
bool is[N];
int root,Min0[N],Min1[N],dep[N];
void dfs(int x,int fa){
if (is[x]){
Min1[x]=(v[x]-v[root]+dep[x])/2;
Min0[x]=dep[x]-Min1[x];
if (v[root]+Min1[x]-Min0[x]!=v[x]) puts("No"... | 522 |
Project_CodeNet | 2,016 | #define _USE_MATH_DEFINES
#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>
#i... | 496 |
Project_CodeNet | 2,017 | #include<cmath>
#include<ctime>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define next nex
using namespace std;
const int MAXN = 200005;
int first[MAXN], next[MAXN << 1], go[MAXN << 1], t;
int n, m, i, j, k, x, y, z, l[MAXN], r[MAXN], a[MAXN];
int w[MAXN];
bool ok;
inlin... | 708 |
Project_CodeNet | 2,016 | #define DINGER_GISBAR
#include <bits/stdc++.h>
using namespace std;
const long long MOD = static_cast<int>(1e9) + 7;
//{{{TEMPLATE_BEGIN
#include <unistd.h>
using namespace std::rel_ops;
#ifdef ZEROKUGI
#include <dumper.hpp>
#define dump(x) dumper::dumper(cerr, __LINE__, (#x), (x), 50, 1, 1)
#define tick(...) dumper::t... | 1,462 |
Project_CodeNet | 2,016 | //This is getting accepted!
// I HATE BUG
// God Of The Bugs
#include<bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FI first
#define SE second
#define pb push_back
#define mp make_pair
#define ll long long
#define sz(a) ((int)(a).size())
#define __builtin_popcount __builtin_popc... | 1,178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define L long long
#define pb push_back
#define pi pair<int,int>
#define aa first
#define bb second
#define mp make_pair
using namespace std;
int n,m,f[100010];
vector<int> a[100010];
set<pi> x;
pi w;
bool g[100010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int ... | 364 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long lli;
lli n;
vector<vector<lli> > g;
lli k;
vector<pair<lli,lli> > r;
vector<bool> vs;
void marge(pair<lli,lli>& a,pair<lli,lli> b){
a.first = max(a.first,b.first);
a.second = min(a.second,b.second);
}
pair<lli,lli> dfs... | 554 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
#define FOR(i,k,n) for(int i = (k);i < (n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) begin(x),end(x)
using namespace std;
using namespa... | 935 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;++i)
#define For(i,a,b) for(int i=(a),i##_end=(b);i<i##_end;++i)
#define per(i,a,b) for(int i=(b),i##_st=(a);i>=i##_st;--i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define dbg(x) cer... | 704 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define MX 100005
#define oo 123123123
using namespace std;
struct NODE
{
int l, r;
NODE () {l = -oo, r = +oo;}
NODE (int l0, int r0) : l(l0), r(r0) {}
NODE operator + (const NODE& t)
{
if(l <= -oo) return t;
else if(t.l <= -oo) re... | 589 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<vector<ll>> Graph;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#d... | 1,325 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
vector<vector<int>> Tr(100010);
vector<int> Arr(100010, INT32_MIN);
int main(){
int N, a, b;
cin >> N;
for (int i = 1;i < N;i++) {
cin >> a >> b;
a--;b--;
Tr[a].push_back(b);
Tr[b].push_back(a);
}
int ... | 301 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
constexpr int INF = 0x3f3f3f3f;
vector<int> edges[100001];
struct Range {
int lowerBound, upperBound;
Range(int lb = -INF, int ub = INF): lowerBound(lb), upperBound(ub) {}
bool have(int v) const {
return lowerBound <= v && v <= u... | 571 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> range;
bool ok = true;
#define l first
#define r second
int n, k;
vector<int> g[100005];
range a[100005];
bool vis[100005];
int h[100005];
bool mergerange(range& a, range b) {
if (a.l > b.r+1 || a.r < b.l-1) return false;
if (b.l >... | 626 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
int h[maxn],mem;
struct
{
int v,next;
}e[maxn<<1];
int num[maxn];
void add(int u,int v)
{
e[mem].v=v;
e[mem].next=h[u];
h[u]=mem++;
}
bool can;
int deep[maxn];
int mi[maxn],mx[maxn];
void dfs(int u,int f)
{
if(num[u]){
mx[u... | 638 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,l,r) for(ll i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define pb push_back
#define eb emplace_back... | 731 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#include<chrono>
#include<random>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long ... | 769 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int INF = 1<<30;
vector<int> g[maxn];
int lb[maxn], ub[maxn];
int father[maxn], color[maxn];
int n;
vector<int> odd,even;
void link(int u, int v) { g[u].push_back(v); g[v].push_back(u); }
void dfs(int u, int p)
{
for (auto v : g[u])
... | 612 |
Project_CodeNet | 2,020 | #ifdef LOCAL
#include <header.hpp>
#else
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#endif
#define lp(i, l, r) for (int i = int(l); i <= int(r); ++i)
#define rp(i, r, l) for (int i = int(r); i >= int(l); --i)
#define ls(i, s) for (int i = 0; s[i]; ++i)
#def... | 3,729 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pi 3.1415926535897932384626
using namespace std;
struct P{
int x,y;
bool operator < (const P &a )const{
//if(y!=a.y)
return y>a.y;
};
};
int a,b,c,d,i,k,n,m,e,dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1};
int o[100031];
int l[103331];
int j[3331];
long l... | 557 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int val[100010], l[100010], r[100010];
queue<int> wl;
vector<int> graph[100010];
int n, u, v, k, p;
bool had_val[100010];
int main() {
memset(r, 63, sizeof(r));
memset(l, -63, sizeof(l));
scanf("%d", &n);
for(int i = 1; i < n; i++) {
scanf("%d%d", ... | 593 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.