Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,017 | #include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int inf = 2e9;
const int maxn = 2e5 + 7;
int n, k;
int edge, fir[maxn], go[maxn], nex[maxn];
int l[maxn], r[maxn], bo[maxn];
int v[maxn];
int ans[maxn];
inline void Ins(int x, int y)
{
... | 914 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | 1,491 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
const int INF = 1e9;
typedef pair<int, int> pii;
const int maxn = 1e5 + 10;
vector<int> E[maxn];
int n, k, pos[maxn], val[maxn], dep[maxn], d[maxn];
pii range[maxn];
void no() { puts("No"); exit(0);}
void getdep(int x, int fa)
{
dep[x] = de... | 601 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#define Inf 0x7f7f7f7f
int dist[100005];
int head[100005],arrive[200005],nxt[200005],tot;
void add_edge(int from,int to){
arrive[++tot]=to;
nxt[tot]=head[from];
head[from]=tot;
}
int mx(int a,int b){
return a>b?a:b;
}
int mn(int a,int b){
return a<b?a:b;
}
int left[100005],righ... | 686 |
Project_CodeNet | 2,016 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(... | 642 |
Project_CodeNet | 2,016 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
typedef pair<int, int> P;
#define INF 1145141919
int N, K;
vector<P> G[100010];
int D[100010];
int main() {
cin >> N;
for (int i=0; i<N-1; i++) {
int a, b;
cin >> a >> b;
... | 481 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template ... | 1,044 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
int num[111111],x,y,n,q;
vector<int> g[111111];
priority_queue<pair<int,int> > pq;
int main()
{
scanf("%d",&n);
for (int i=1;i<n;i++)
{
scanf("%d%d",&x,&y);
g[x].push_back(y);
g[y].pus... | 357 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
#define per(i,j,k) for(int i=(int)j;i>=(int)k;i--)
#define rep(i,j,k) for(int i=(int)j;i<=(int)k;i++)
using namespace std;
const int N=110000;
int head[N],np[N<<1],p[N<<1],tot;
int key[N];
int n,K;
int root;
int fa[N];
int dep[N];
int dx[2]={-1,1};
int seg[N],cl[N*35],cr[N*35],segtot,mi[N*35][2]... | 1,235 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 100000;
struct edge{
int to;
edge *nxt;
}edges[2*MAXN + 5], *adj[MAXN + 5];
edge *ecnt = &edges[0];
void addedge(int u, int v) {
edge *p = (++ecnt);
p->to = v, p->nxt = adj[u], adj[u] = p;
p = (++ecnt);
p->to = u, p->nxt = adj[v], adj[v] =... | 782 |
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... | 903 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ld = long double;
const int maxn = 1<<18;
void bad() {
cout << "No";
exit(0);
}
const int fu = -(1<<30);
array<int, 2> dp[maxn];
int n, c[maxn];
vector<int> g[maxn];
array<int, 2> merge(array<int, 2> a, array<in... | 572 |
Project_CodeNet | 2,017 | # include<bits/stdc++.h>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define eps 1e-8
# define MOD 1000000007
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(register int i=a; i<=n; ++i)
# define FDR(i,a,n) for(register int i=a; i>=n; --i)
# define ... | 1,012 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b)... | 800 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define priqu... | 2,766 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using PII = pair<int, int>;
constexpr int INF = numeric_limits<int>::max() / 2;
int N, K;
vector<int> V(100000), P(100000);
vector<int> l(100000, -INF), r(100000, INF), res(100000, -1);
vector<vector<int>> g(100000);
bool f = true;
int root = -1;
P... | 695 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cstdio>
const int N=100005;
int L[N],R[N],v[N],fst[N],tot,rt;
bool flag=1;
struct Edge{
int to,nxt;
}e[N*2];
void addedge(int x,int y){
e[++tot].to=y;e[tot].nxt=fst[x];fst[x]=tot;
}
void dfs(int x,int father){
for (int i=fst[x];i && flag;i=e[i].nxt){
int y=e[i].to;
if (y!=fathe... | 471 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
vector<int>V[N];
int l[N], r[N], n, k, col[N];
void Dfs (int u, int fa) {
for (auto v: V[u]) if (v != fa) {
Dfs(v, u);
if (r[v] + 1 < r[u]) r[u] = r[v] + 1;
if (l[v] - 1 > l[u]) l[u] = l[v] - 1;
if (l[u] > r[u]) puts("No"), exit(0);
}
}
... | 477 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=100100,oo=1000000000;
int i,j,k,n,m,ch,x,y,rt,Fg,En;
int l[N],r[N],a[N],h[N];
struct edge { int s,n;} E[N<<1];
void R(int &x) {
x=0;ch=getchar();
while (ch<'0' || '9'<ch) ch=getchar();
while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=... | 619 |
Project_CodeNet | 2,016 | #include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int main() {
int N, K;
vector<int> e[100000], v[100000]; /*eは辺のメモ、vは整数min + iが書かれている頂点はどこかのメモ*/
int a[100000], vp[100000], P[100000];/*aは実際に書かれている整数のメモ*/
int min;
int i,j,k,v1,v2;
scanf("%d", &N);
for (i = 0; i < N - 1; i++) {
scanf... | 553 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define inf 0x7fffffff
#define RG register
#define inf 0x7fffffff
#define mkp make_pair
#define maxn 100205
typedef unsigned int U;
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
inline ll read(){
ll x = 0, f = 1;
... | 672 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll inf=1e17+500;
const ll maxn=5e5+500;
vector<pii> ger[maxn];
ll p[maxn];
ll minn[maxn];
int main(... | 443 |
Project_CodeNet | 2,020 | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
int n;
const int maxN = 1e5 + 10;
vector < int > g[maxN];
int clr[maxN];
void dfs(int v, int p) {
for (int to : g[v]) {
if (to == p) continue;
... | 500 |
Project_CodeNet | 2,020 | // 解き直し.
// https://img.atcoder.jp/data/arc/063/editorial.pdf
#include <bits/stdc++.h>
using namespace std;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for... | 2,163 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int N=100005;
int l[N],r[N],v[N];
vector<int> path[N];
bool bo;
void dfs1(int o,int fa)
{
if(v[o]>=0) l[o]=r[o]=v[o];
for(int i=0;i<(int)path[o].size();i++)
{
int to=path[o][i];
if(to==fa) continue;
dfs1(to,o);
if(l[to]==INT_MIN) continue;
//co... | 492 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 684 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define INF 1e9
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
vector <int> a[MAXN];
int l[MAXN]... | 617 |
Project_CodeNet | 2,016 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
constex... | 674 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(... | 756 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | 1,073 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e5+10;
struct Edge{ int to,next; };
Edge way[N<<1];
int n,tot,num[N],l[N],r[N],col[N],k;
void Build(int a,int b) { way[++tot]=(Edge){b,num[a]}; num[a]=tot; }
void Init()
{
scanf("%d",&n);
int a,b;
for (int i=2;i<=n;++i)
{
scanf("%d%d",... | 696 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> II;
const int MAXN = (int) 1e5 + 10;
const int MAXA = (int) 1e9;
int n, k, a[MAXN], h[MAXN];
vector<int> adj[MAXN];
struct Range {
int l, r;
Range() {};
Range(int l, int r): l(l), r(r) {};
friend Range Merge(Range A, Range... | 803 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N;
cin >> N;
vector<vector<int>> G(N);
REP(i, N-1){
int A, B;
... | 347 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeo... | 1,109 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
typedef int Weight;
struct Edge{
int from, to;
Weight weight;
int rev; // ネットワークフロー時の逆辺
vector<int> vs;
Edge(int from, int to, Weight w... | 1,412 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 998244... | 685 |
Project_CodeNet | 2,016 | #include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
#define INF 1010001000
typedef pair<int, int> i_i;
int main()
{
int n, a, b;
cin >> n;
vector<vector<int> > G(n);
for (int i = 0; i < n-1; i++) {
cin >> a >> b;
G[--a].push_back(--b);
... | 354 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <vector>
using namespace std;
typedef long long LL;
#define pb push_back
const int maxn = 100005;
const int inf = 1<<28;
int ehead[maxn],ecnt;
struct edge {
int u,v,next;
}edg[maxn*2];
void add(int u,int v) {
edg[++ecnt]=(edge)... | 615 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define RI register int
#define Cannot puts("No"), exit(0);
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 == p2) p2 = (p1 = buf) + fread(bu... | 884 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
using P=pair<int,int>;
const int INF=1e9;
int main()
{
int N; cin>>N;
Graph 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; cin>>K;
vector<... | 345 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int Max_N(100050);
inline void GG()
{
puts("No"), exit(0);
}
int N, K, Head[Max_N], Total, To[Max_N << 1], Next[Max_N << 1], L[2][Max_N], R[2][Max_N], Ans[Max_N];
inline void Add_Edge(int s, int t)
{
++Total, To[Total] = t, Next... | 724 |
Project_CodeNet | 2,017 | #include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<math.h>
#include<time.h>
#include<vector>
#include<bitset>
#include<memory>
#include<utility>
#include<fstream>
#include<stdio.h>
#include<sstream>
#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<algor... | 755 |
Project_CodeNet | 2,020 | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1... | 515 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) <... | 1,066 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cctype>
#include <cstring>
#include <queue>
const int MX = 0x3f3f3f3f, MN = 0x9f9f9f9f;
using namespace std;
const int N = 100005, M = 200005;
int to[M], nt[M], hd[N], tot = 0;
int lb[N], rb[N], fa[N], dep[N], ord[N], cnt = 0;
int type[N];
bool have_result = true;
inline void in(int &x){
... | 982 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
const int MN=100000+5;
using namespace std;
typedef long long ll;
template<typename T>T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
in*=f;return in;
}
int n,k;
int nxt[MN*2],to[MN*2],h[MN],cnt;
int rt,a... | 576 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 1,645 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define sd(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define pd(n) printf("%d",n)
#define pl(n) printf("%lld",n)
#define sf(n) scanf("%f",&n)
#define pf(n) printf("%.12f",n)
#define psp printf(... | 950 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 28;
vector<int> G[100000];
int X[100000];
int l[100000];
int r[100000];
bool dfs1(int v, int p, int mod) {
if(X[v] != INF && X[v] % 2 != mod) return false;
for(auto c : G[v]) {
if(c == p) continue;
if(!dfs1(c, v, 1 - mod)) ... | 580 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector< vector<ll> > M;
M.resize(N);
for (ll i = 0; i < N; ++i) {
M[i].clear();
}
for (ll i = 0; i <... | 768 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> par;
typedef vector<int> vct;
typedef vector<par> vp;
const int mod=1e9+7;
int low[100007],high[100007],n,k,u,v,a[100007];
vct HMS[100007];
int f=0;
void d... | 493 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vecto... | 818 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 100010;
int n, m, tot, head[maxn], ans[maxn], l[maxn], r[maxn];
bool flag = 1;
struct line {
int to, nxt;
} edge[maxn * 2];
void add(int u, int v) {
edge[++tot].to = v, edge[tot].nxt = head[u], he... | 1,107 |
Project_CodeNet | 2,016 | ///exit(0)으로 할 것, 코딩적 습관 보다는 내 머리를 믿을 것 , 아는 문제는 빨리 풀 수 있도록 노력 할 것
#include<bits/stdc++.h>
#define INF 987654321
#define N 1000050
using namespace std;
struct A{
int num,lef,rig;
} s[N];
vector<int> V[N];
int n,m,ai[N],bi[N],visit[N],visit2[N];
void dfs(int from)
{
int to,i,st,ed;
st=-INF;
ed=INF;
... | 671 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
using namespace std;
#define N 100005
vector<int> adj[N];
int P[N];
bool hasValue[N];
int maxi[N],mini[N],myParent[N];
int dfsOrd[N], dfsPos = 0;
bool dfs(int no... | 688 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,k,val[100005],l[100005],r[100005];
vector<int> g[100005];
void die()
{
cout<<"No"<<endl;
exit(0);
}
void solve(int v,int p)
{
l[v]=-1e9-1;
r[v]=1e9+1;
if(val[v]!=-1) l[v]=r[v]=val[v];
for(int i=0;i<g[v].size();i++)
{
int to=g[v][i];
if(to==p) continue;
sol... | 481 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<algorithm>
#include<cstdlib>
using namespace std;
struct Edge{
int to,nxt;
}edge[500100];
struct Point{
int minn,maxn,ans,opt;
}point[500100];
int cnt,head[500100],n,m;
void Exit(){
puts("No");
exit(0);
}
void addedge(int x,int y){
edge[++cnt].to=y;
edge[cnt].nxt=head[x];
head[x]=cnt;
}... | 751 |
Project_CodeNet | 2,016 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100005;
const int inf = 1000000007;
int n,m;
struct P {
int val,l,r;
bool fail,has;
} p[maxn];
vector<int>e[maxn];
void init() {
for(int i... | 680 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P... | 1,241 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <utility>
#define FR first
#define SE second
using namespace std;
typedef pair<int,int> pr;
struct Edge {
int t,next;
Edge() {}
Edge(int a,int b):t(a),next(b) {}
};
Edge e[200005];
int head[100005];
pr can[100005];
inline p... | 750 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int... | 632 |
Project_CodeNet | 2,020 | /*
/+==================================================+\
//+--------------------------------------------------+\\
|.|\\...>>>>>>> Hollwo_Pelw(ass) 's code <<<<<<<...//|.|
\\+--------------------------------------------------+//
\+==================================================+/
*/
#include <bits/stdc++.h>
using ... | 1,062 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#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;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for... | 925 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int MAXN = 100005,INF=0x3f3f3f3f;
struct Edge{
int to,next;
}e[MAXN<<1];
int val[MAXN],n,cnt,k,head[MAXN];
inline void insert(int u,int v)
{
e[++cnt].to=v,e[cnt].next=head[u],head[u]=cnt;
e[++cnt].to=u,e[c... | 722 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
typedef long long ll;
const ll INFT = 1000000000;
ll p[100000];
ll hi[101010];
ll lo[101010];
ll n;
ll k;
vector<int> graph[101010];
ll dep[101010];
void dfs(ll p, ll rt, ll d){... | 512 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
#define MP make_pair
#define F first
#define S second
constexpr pair<int, int> all = MP(-1e9, 1e9);
int N, K;
pair<int, int> val[100001];
vector<int> adj[100001];
int ans[100001];
bool both(int a, int b) {
bool b1 = (a%2==0);
bool b2 = (b%2==0);
return !(b1^b... | 603 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#define N 100005
#define M 100005
#define inf 1000000000
using namespace std;
typedef long long ll;
const ll mod = 1000000007LL;
int n;... | 877 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
const int N = 100010;
struct point
{
int num, first, left, right;
bool visited, odd;
};
struct edge
{
int next, to;
};
int cnt = 1, n, k;
edge e[N << 1];
point p[N];
void addedge(int u, int v)
{
e[++ cnt].next = p[u].first;
p[u].first = cnt;
e[cnt].to = v;
e[++ cn... | 687 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
#define MAX 100010
#define INF 100000000
bool visited[MAX] = {0};
vector<int> G[MAX];
int high[MAX], low[MAX], ans[MAX];
bool dfs(int i, int a) {
//cerr << i << ' ' << low[i]... | 621 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
const int mod = 1e9+7;
const int mx = INT_MAX;
const long double pi = 4*atan((long ... | 477 |
Project_CodeNet | 2,016 | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<... | 886 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 11;
int L[N], R[N], n, mark[N], ans[N];
int head[N], nex[N<<1], to[N<<1], size;
void add(int u, int v){
nex[++size] = head[u];
to[size] = v;
head[u] = size;
}
void dfs(int u, int fa){
for(int i = head[u];i;i = nex[i]){
int v = to[i... | 796 |
Project_CodeNet | 2,016 | #include<iostream>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
using ulong = unsigned long;
using ll = long long;
const int M = 1e9 + 7;
#pragma unused(M)
struct Node{
vector<Node*> nodes;
int mini = -... | 1,130 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#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()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(... | 641 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int N=100100;
int n,val[N],m,vis[N];
vector<int>g[N];
priority_queue<pair<int,int> >pq;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<n;++i){
int x,y;cin>>x>>y;
g[x].push_back(y);g[y].push_back(x);
}
for(cin>>m;m --> 0;){
... | 265 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
const ll mi = -(1LL << 60); //MAX 9223372036854775807
int main()
{
ll n;
cin >> n ;
vector<vector<ll>> g(n);
//多重辺がないならsetでもよい（辺を消去したいときなど）この場合はinsert
//set<ll> g[n];
rep(i, n-1)
{
ll a,... | 1,226 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
c... | 737 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
int co[100010],L[100010],R[100010];
std::vector<int>edge[100010];
bool ok,vi[100010];
bool in[100010];
void dfs(int x){
if(co[x]!=-1){
L[x]=R[x]=co[x];
in[x]=true;
}
for(int k=0;k<edge[x].size();k++){
int y=edge[x][k];
if(vi[y]) continue;
vi[y]... | 579 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
const db pi=acos(-1.0);
#define low... | 844 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, m, num[N], was[N];
vector<int> g[N], cols[N + N];
int main() {
ios::sync_with_stdio(false);
cin >> n;
fill(num, num + n, -1);
for (int i = 0; i < n - 1; ++i) {
int x, y;
cin >> x >> y;
--x; --y;
... | 345 |
Project_CodeNet | 2,016 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
template <class E>
using Graph = vector<vector<E>>;
template<class D, D INF>
struct Dijkstra {
vector... | 628 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int INF = 10e+7;
typedef pair<int, int> P;
vector<int> G[100000];
int p_max[100000];
int p_min[100000];
int p_ans[100000];
int depth[100000];
void dfs_p(int v, int p){
if(p_min[v] <= p-1) p_ans[v] = p-1;
else p_ans[v] = p+1;
... | 726 |
Project_CodeNet | 2,016 | /* ***************************************
Author :Scau.ion
Created Time :2016/11/06 20:46:54 UTC+8
File Name :ion.cpp
*************************************** */
#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define PB push_back
#define MP make_pair
#define PII pair<int,int>... | 579 |
Project_CodeNet | 2,016 | #include<stdio.h>
#include<vector>
#include<stdlib.h>
#define pb push_back
using namespace std;
int H;
int c[100005],C[100005],L[100005],R[100005],g[100005],M[100005],V[100005];
vector<int> r[100005],X[100005];
void f(int x, int h)
{
int i;
H=max(H,h);
c[x]++;
X[h].pb(x);
for(i=0;i<r[x].size();i++... | 648 |
Project_CodeNet | 2,016 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
#define ran 111111
int n,k;
vector<int> e[ran];
bool g[ran];int f[ran];
int L[ran],R[ran];bool ff[ran];
void dfs(int x,int fat){
ff[x] = false;
for(vector<int>::iterator it = e[x].begin(); it != e[x].end();... | 632 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <vector>
#include <cstdlib>
#include <utility>
#include <algorithm>
const int N = 1e5 + 10, INF = 1e7;
int n, rt, f[N], p[N], k;
std::vector<int> to[N], c[N];
std::pair<int, int> r[N];
bool o1, o2, d[N], h[N], res;
inline std::pair<int, int> merge(std::pair<int, int> a, std::pair<int, int> ... | 645 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int, int >
#define F first
#define S second
#define int long long int
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
/// khodaya ko... | 901 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i... | 1,569 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int n,k,dist[100005];
vector<int>g[100005];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;
int main()
{
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int a,b;
scanf("%d%d",&a,&b);
a--;b--;
g[a].push_back(b);
g[b].push_back(a);
}
scan... | 331 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#in... | 2,970 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define maxn 100010
#define inf 1000000007
using namespace std;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=ge... | 613 |
Project_CodeNet | 2,016 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <time.h>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(i... | 684 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
bool chmax(int &a, int b) {if (a < b) { a = b; return true; } else return false; }
bool chmin(int &a, int b) {if (a > b) { a = b; return true; } else return false; }
const int MAX = 110000;
const int NON = -1000000;
int N;
vector<int> tree[MAX];
int K;
int P[MAX];
int lo... | 715 |
Project_CodeNet | 2,016 | #include <iostream>
#include <utility>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int,int> D;
int P[100005];
vector<int> G[100005];
int main( void )
{
ios::sync_with_stdio(false);
int N, a, b, K, v, p;
cin >> N;
for( int i=0; i<N-1; i++ ){
cin >> a >> b;
G[b].push_back( a );
... | 367 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 1000000007
using namespace std;
vector<int> g[100010],order;
int d[100010],anss[100010],r[100010],l[100010],par[100010],n,k;
bool ans;
void solve(int v,int p)
{
l[v]=-INF-1;r[v]=INF+1;
if(d[v]!=-1){
l[v]=d[v];
r[v]=d[v];
}
for(int i=0;i<g[v].size();i++){
int nx=g[v][i];
... | 551 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5;
vector< ll > adj[N];
ll n,k,ans[N];
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin>>n;
for(ll i=1;i<=n;i++)ans[i]=-N;
for(ll i=1,u,v;i<=n-1;i++)cin>>u>>v,adj[u].push_back(v),adj[v... | 280 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DBG(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
using uint=unsigned int;
using ll=long long;
usi... | 820 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<vector>
#include<bitset>
#include<cstdlib>
#include<iostream>
#define nc getchar
#define pb push_back
using namespace std;
const int N = 100005;
inline void read(int &x) {
char b = nc(); x = 0;
for (; !isdigit(b); b = nc());
for (; isdigit(b); b = nc()) x = x * 10 + b - '0';
}
int n, m, a[N... | 612 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
#define ROF(i,a,b) for(ll i=a;i>=b;i--)
#define per(i,a) ROF(i,a,0)
#define pb push_back
using namespace std;
using ll=long long;
using ld=long double;
using ch=char;
typedef pair<ll,ll> P;
typedef vecto... | 783 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#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 repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n)... | 1,492 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.