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<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-... | 552 |
Project_CodeNet | 2,016 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int64_t N;
int64_t K;
vector<int64_t> G[100000];
int64_t P[100000];
const int64_t INF = 1e9+1;
vector<int64_t> v[100000];
vector<int64_t> solv1(int64_t a,int64_t b){//頂点a について(b->aという向き) bのありうるパターンについて返す
bool flag=true;//目的の木を作れるかどうか判定
... | 1,107 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i ... | 1,061 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
#define w1 first
#define w2 second
#define ls (x<<1)
#define rs (x<<1|1)
#define pb push_back
#define mid ((l+r)>>1)
#define SZ(x) ((x).size())
#define All(x) (x).begin(),(x).end()
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#d... | 698 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define inf INT_MAX/2
using namespace std;
int l[100050], r[100050], p[100050], ass[100050];
int n, t;
vector<int> adjlist[100050];
bool ans = true;
void dfs(int x, int par){
for(auto i : adjlist[x]) if(i != par){
if(l[x] != -inf and r[x] != inf){ // range is set
l[i] = max(l[i], l[x]-... | 700 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int jo[maxn];
int n, k;
struct Edge
{
int to, nxt;
} e[maxn << 1];
int first[maxn];
inline void add_edge(int from, int to)
{
static int cnt ... | 900 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define DEBUG(x) cerr<<__LINE__<<": "<<#x<<" = "<<x<<"\n"
template<class t,class... | 627 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int P[100000];
int low[100000];
int high[100000];
void search(int pos, int prev, const vector<vector<int>>& g){
low[pos] = high[pos] = (P[pos] != -1 ? P[pos] : -1);
for(int next : g[pos]){
if(next == prev) continue;
search(next, pos,... | 618 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cassert>
#define L first
#define R second
#define travel(x, i) for (int i = fir[x]; i; i = e[i].nxt)
#define fail {puts("No"); exit(0);}
using namespace std;
const int N = 1e5 + 5;
const int INF = 1e7;
struct Constraint {
pair <int, int> range;
... | 805 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typede... | 1,364 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cctype>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
#define repe(i,x) for (edge *i=fst[x]; i; i=i->nxt)
using namespace std;
int n,l[100100],r[100100],root;
struct edge
{
int v;
edge *nxt;
} pool[200100],*tp=pool,*fst[100100];
int getint()
{
char ch;
w... | 525 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
// #include <iostream> // cout, endl, cin
// #include <string> // string, to_string, stoi
// #include <vector> // vector
// #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
// #include <utility> // pair, make_pair
// #include <tuple> // tuple, make_tuple
// #inc... | 1,818 |
Project_CodeNet | 2,019 | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n);... | 1,391 |
Project_CodeNet | 2,016 | #include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<array>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cassert>
#include<functional>
#include<random>
#include<complex>
#include<bitset>
#include<chron... | 1,098 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAXN = 100005;
const int INF = 1e9;
int n, K;
int V[MAXN], P[MAXN];
int et, fir[MAXN], to[MAXN << 1], ne[MAXN << 1];
int s[2][MAXN], v[MAXN];
void link(int u, int v) {
to[++et] = v, ne[et] = fir[u], fir[u] = et;
to[++et] = u... | 820 |
Project_CodeNet | 2,016 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <functional>
#include <array>
#include <cmath>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(t... | 667 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
ty... | 851 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
const int M = 2e5 + 10;
const int maxn = 1e9 + 1e5;
int las[N], nex[M], to[M], sz, val[N], n, K, fa[N], ans[N];
bool visit[N];
struct node {
int l, r;
bool all;
bool empty;
} rem[N], tmp... | 867 |
Project_CodeNet | 2,017 | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<list>
#include<queue>
#include<string.h>
#include<functional>
#include<stack>
#include<deque>
#include<string>
#include<limits.h>
#include<map>
#include<set>
#include<unordered_map>
#include<cmath>
#include<unordered_set>
#define int long... | 912 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<int> g[100005];
bool b[100005];
int c[100005], l[100005], r[100005];
void dfs(int x, int p) {
if (b[x]) l[x] = r[x] = c[x];
else l[x] = -890328, r[x] = 890328;
for (int i : g[... | 469 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int mod=1e4+7;
const int inf=0x3f3f3f3f;
const double eps=1e-8;
//ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
VI g[100010];
i... | 336 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
const int N = 100005;
#define mp(i, j) make_pair(i, j)
#define pii pair<int, int>
#define fir first
#define sec second
using namespace std;
int n, m, head[N], cnte, ans[N];
struct edge { int to, nxt; } e[N << 1];
priority_... | 541 |
Project_CodeNet | 2,016 | /*
____________ ______________ __
/ _________ /\ /_____ _____/\ / /\
/ /\ / / \\ / /\ \ \ / / \
/ / \_____/ / / \__/ / \____\/ / / /
/ / / / / / / / / / / /
/ / / / / / ... | 1,246 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int maxn=100005;
int n,m;
int head[maxn*2],nxt[maxn*2],to[maxn*2],e;
int ans[maxn];
bool vis[maxn];
void add_edge(int x,int y)
{
to[e]=y;
nxt[e]... | 468 |
Project_CodeNet | 2,017 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
int nNode;
int vs[100000+10];
int parity[100000+10];
int lbs[100000+10];
int ubs[100000+10];
vector<int> g[100000+1... | 701 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | 581 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define M 100010
#define inf 1e9
using namespace std;
struct point{
int to,next;
}e[M<<1];
int n,m,num,root;
int ans[M],head[M],odd[M],L[M],R[M];
void add(int from,int to)
{
e[++num].next=head[from];
e[num].to=to;
head[from]=num;
}
void dfs1(... | 634 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// macros
#define overload_rep(_1, _2 ,_3 ,name, ...) name
#define re_p(i, n) for(int i = 0; i < (n); ++i)
#define r_ep(i, x, y) for(int i = (x); i < (y); ++i)
#define rep(...) overload_rep(__VA_ARGS__, r_ep, re_p,)(__VA_ARGS__)
#define all(a) a.begin(), a.end()
#ifndef ST... | 780 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstdlib>
#define cmax(a,b) (a<(b)?a=(b),1:0)
#define cmin(a,b) (a>(b)?a=(b),1:0)
#define dmin(a,b) ((a)<(b)?(a):(b))
#define dmax(a,b) ((a)>(b)?(a):(b))
#define regsiter register
#define CL fclose(stdin),fclose(stdout)
names... | 892 |
Project_CodeNet | 2,016 | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <stdexcept>
using namespace std;
using pii = pair<int, int>;
static const int INF = 1000000000;
pii backward_recur(
int u, int p, vector<int>& lo, vector<int>& hi,
const vector<int>& x, const ve... | 850 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
const int N = 100005, inf = 1e9;
int n, m, dep[N], v[N], s[N], e[N], r;
bool off;
vector<int> adj[N];
bool check (int C, int P) {
dep[C] = dep[P] + 1;
if(v[C] && (v[C]-v[r]+dep[C]-1)%2) return false;
for(auto &T : adj[C]) {
if(T == P) continue;
if(!check(T, C)) ret... | 469 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
if(head==tail) {
... | 1,209 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int mx[100010],mn[100010],head[100010],o=0,k,n,t,a[100010],up_mx[100010],up_mn[100010];
bool sure[100010];
struct edge{
int to,link;
}e[200010];
void add_edge(int u,int v){
e[++o].to=v,e[o].link=head[u],head[u]=o;
e[++o].to=u,e[o].link=head[v],head[v]=o;
}
void dfs(int u... | 540 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int>pi;
const int N=100005,inf=0x3f3f3f3f;
int n,m,col[N],t[N],a[N],num[N];
vector<int>e[N];
pi f[N];
void build(int x,int fa){
num[x]=col[x]!=inf;f[x]={-inf,inf};
for(int v:e[x])if(v!=fa)build(v,... | 570 |
Project_CodeNet | 2,016 | #include <cstdio>
#include <climits>
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <tuple>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
using namesp... | 585 |
Project_CodeNet | 2,017 | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | 1,248 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define mo 1000000007
#define pi 3.1415926535898
#define eps 1e-9
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'... | 539 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i)
const int N = 200005, inf = 1000000007 ;
using namespace std ;
int n, e, ter[N], nxt[N], lnk[N], v[N] ;
struct poi {
int st, l, r ;
} f[N] ;
void... | 849 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#include<bitset>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index... | 907 |
Project_CodeNet | 2,016 | #include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <cassert>
using namespace std;
const int INF = 1e9;
inline bool IsAny(const pair<int, int>& p) {
return p.first == INF && p.second == INF;
}
inline pair<int, int> GetAny() {
return make_pair(INF, INF);
}
inline bool Merge... | 741 |
Project_CodeNet | 2,016 | #include "math.h"
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ifor(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... | 903 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).siz... | 5,935 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
//#define int long long
#... | 1,103 |
Project_CodeNet | 2,019 | /// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) fo... | 1,013 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... | 1,723 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1000000000
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define f first
#define s second
#define pb push_back
//#define mp make_pair
int n, a[101010], k, dist[1010... | 468 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
constexpr int IINF = INT_MAX;
vector<vector<int> > g;
vector<int> p, lo, up, ans;
void dfs(int v, int pre){
if(p[v] >= 0){
lo[v] = max(lo[v], p[v]);
up[v] = min(up[v], p[v]);... | 559 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 703 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int N, M, a[100009], ans[100009], st[100009], dr[100009];
bool type[100009];
vector < int > v[100009];
void Bad ()
{
printf ("No\n");
exit (0);
}
void dfs (int nod, int tata)
{
vector < pair < pair < int, int >, bool > > curr;
bool free = 1;
for (auto... | 803 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii... | 1,290 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5+7, inf = 1e9;
#define pii pair<int,int>
#define fi first
#define se second
vector<int> g[N], ans(N);
vector<pii> range(N, {-inf, inf}), edge;
int n, k;
pii merge(pii x, pii y){
if(x > y) swap(x, y);
return {max(x.fi, y.fi), min(x.se, y.se)};
}
void... | 555 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 10;
vector<int> adj[maxn];
int p[maxn], n, k;
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
freopen("in", "r", stdin);
#endif
scanf("%d", &n); p[n] = -1;
for(int i = 1; i < n; ++... | 363 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (ll (i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (ll (i) = (a); (i) < (b); (i)++)
#define int long long
using namespace std;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int INF = 1e... | 405 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> boo... | 786 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
... | 1,435 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
const int inf = 1 << 30;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
int l[100010], r[100010];
int N, K;
int P[100010];
vector<int> G[100010];
bool flag = true;
bo... | 719 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | 971 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef pair <int,int> pii;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-... | 571 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) {if(a<b) {a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) {if(a>b) {a=b;return 1;} return 0;}
const int INF = 1LL<<28;
bool updated = false;
vector<vector<int>> G;
vector<int> P, ... | 999 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
vector<int> adj[N];
pair<int, int> range[N];
int v[N];
bool valid = true;
bool combine(const pair<int, int>& a, pair<int, int>& b) {
if ((a.first & 1) != (b.first & 1)) return false;
if (a.second < 1 || b.second < 1) return false;
if (a.first +... | 845 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll MOD=1000000007;
//const ll MOD=998244353;
template<typename T,typename U>istream & operator >> (istr... | 548 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn=1e5+5;
vector<int> G[maxn],order;
int n,a,b,known[maxn],val[maxn],l[maxn],r[maxn],k,used[maxn],known_parity[maxn][2],shit,par[maxn],ans[maxn];
void dfs(int v)
{
used[v]=1;
l[v]=-1e9;
r[v]=1e9;
for (int i=0;i<G[v].size();i++)
{
int... | 585 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int n, k, num[100007];
vector<int>e[100007];
priority_queue<pair<int, int> >q;
bool vis[100007];
int read()
{
int num = 0;
char c = getchar();
while (c < '0' || c>'9')c = getchar();
while (c >= '0' && c <= '9')num = num * 10 + c - '0', c = getchar();
return num;
}
int m... | 419 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define inf 1111111116
#define next nxt
int n,x[N],y[N],p[N],next[N],f[N];
priority_queue<pair<int,int> > q;
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
... | 396 |
Project_CodeNet | 2,020 | #include<queue>
#include<cstdio>
#include<cstdlib>
const int N=1e5+6;
using namespace std;
struct data{
int u,d;
inline bool operator<(const data&rhs)const{return d>rhs.d;}
};
priority_queue<data>q;
int n,k,w[N];
bool vis[N];
vector<int>G[N];
int main(){
scanf("%d",&n);
for(int i=1;i<n;++i){
int u,v;
scanf("%d%... | 290 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <numeric>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define pb push_back
#define int long lo... | 546 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 1e5+5;
vector<int> adj[maxn];
int has[maxn];
bool flex[maxn];
int pari[maxn];
int lb[maxn], rb[maxn];
int ans[maxn];
int n, k;
bool solve(int u, in... | 863 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void... | 656 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 872 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#... | 756 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdio>
using namespace std;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return res;
}
template <c... | 760 |
Project_CodeNet | 2,018 | #include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
int n;
int k;
typedef pair<int,int> P;
vector<P> edges[100001];
int l[100001];
int r[100001];
queue<int> que;
int INF = 1e9;
bool solve()
{
while(!que.empty())
{
int v = que.fro... | 506 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, k, mi[N], ma[N];
bool has[N];
vector<int> a[N];
void check( int x, int y )
{
if ( has[y] ) {
bool flag = 1;
if ( has[x] && (mi[x]-mi[y])%2==0 ) flag = 0;
mi[x] = max(mi[x], mi[y]-1);
ma[x] = min(ma[x], ma[y]+1);
... | 457 |
Project_CodeNet | 2,017 | #include"bits/stdc++.h"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = (l);x<=(u);x++)
#define RREP(x,l,u) ... | 932 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <functional>
#include <cstring>
#include <regex>
#include <random>
#include <cassert>
#include <stack>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(... | 1,051 |
Project_CodeNet | 2,017 | // Copyright (C) 2017 __debug.
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; with... | 1,201 |
Project_CodeNet | 2,018 | // author: hjy
// Problem:
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define rep(i,n) for(register int i=0; i<(int)(n); ++i)
#define pe... | 555 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 957 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x)... | 993 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 50;
typedef pair<int, int> P;
int n, m, k;
vector<int> G[N];
int res[N];
int main() {
cin >> n;
memset(res, -1, sizeof(res));
for(int i = 0; i < n - 1; i++) {
int a, b; cin >> a >> b; a--, b--;
G[a].push_back(b);
... | 337 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <ma... | 432 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, K;
scanf("%d", &N);
vector<vector<int>> edge(N+1);
for (int i = 0; i < N-1; i++) {
int A, B;
scanf("%d %d", &A, &B);
edge[A].push_back(B);
edge[B].push_back(A);
}
scanf("%d",... | 459 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin>>N;
vector<vector<int>> E(N);
for (int i=0; i<N-1; i++)
{
int A, B;
cin>>A>>B;
E[A-1].push_back(B-1);
E[B-1].push_back(A-1);
}
int K... | 577 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 100005
using namespace std;
struct edge{
int t,next;
}e[N*2];int ecnt,head[N];
void addedge(int f,int t){
e[++ecnt]=(edge){t,head[f]};head[f]=ecnt;
e[++ecnt]=(edge){f,head[t]};head[t]=ecnt;
}
int n,k,val[N];
priority_queue<pair<int,int> > pq;//ʵ¼ÊÉÏʹÓöÓÁо͹»ÁË
int main(){
mems... | 362 |
Project_CodeNet | 2,018 | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N, K, x[100009]; vector<int> G[100009], que[1100009];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N - 1; i++) {
int va, vb;
cin >> va >> vb; va--, vb--;
G[va].push_back(vb);
G[vb]... | 350 |
Project_CodeNet | 2,016 | /* -*- coding: utf-8 -*-
*
* c.cc: E: 木と整数 / Integers on a Tree
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeri... | 819 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define N 100010
#define RG register
using namespace std;
bool odd[N],even[N];
int a,b,k,n,v,hd[N],lef[N],num[N],rig[N],to[N<<1],nex[N<<1];
inline int gi(){
RG int x=0;RG bool flag=0;RG char c=getchar();
while((c<'0'||c>'9')&&c!='-') c=getchar();
if(c=='-') c=getchar(),flag=1;
wh... | 759 |
Project_CodeNet | 2,019 | // Crt. 2019-12-08 12:05:35
// Stt. 2019-12-08 15:06:05
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 200005
using namespace std;
const int INF = 0x3f3f3f3f;
int n, K, w[N], dep[N], L[N], R[N];
int tot, fir[N], nxt[N << 1], to[N << 1];
inline void addE(int u, int v) {
n... | 937 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<int> &lb, vector<int> &ub, vector<int> &P, vector<vector<int>> &ch, bool &ok, int v = 0){
for (int w : ch[v]){
dfs(lb, ub, P, ch, ok, w);
if (!ok){
return;
}
lb[v] = max(lb[v], lb[w] - 1);
ub[v] = min(ub[v], ub[w] + 1);
}
if (... | 855 |
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... | 513 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,flag,tot,hh,dep[500001],a[500001],e[500001],nt[500001],hd[500001],v[500001],l[500001],r[500001];
void build(int x,int y){
tot++;
e[tot]=y;
nt[tot]=hd[x];hd[x]=tot;
}
void dfs(int x,int fa){
int i;
dep[x]=dep[fa]+1;
for(i=hd[x];i;i=nt[i]){
i... | 611 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl
const int INF = 1e9;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight w... | 805 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=100100;
int a[N],l[N],r[N],h[N];
int n,m,tot,x,y,flag,root;
struct edge{int y,next;}g[N*2];
void adp(int x,int y){
g[++tot].y=y;
g[tot].next=h[x];
h[x]=tot;
}
void dfs(int x,int fa,int d){
if (a[x]!=-1){
if ((a[x]%2==a[root... | 478 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | 726 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#defin... | 1,257 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long l... | 403 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | 777 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
int const MAX = 100005;
int const P_MAX = 20000006;
vector<int> v[MAX];
int p[MAX];
int parent[MAX];
stack<int> st,ack;
struct high_low
{
int high; int low;
};
high_low hl[MAX];
int value[MAX];
int main() {... | 930 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
int parents[100500];
vector<int> children[100500];
vector<int> pathes[100500];
int n;
int p[100050];
int maxi[100050];
int mini[100050];
int checker[100050];
int a... | 970 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9;
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].push_back(b);
g[b].push_back(a);
}
int k, rt; cin >> k;
vector... | 485 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.