摘要:
代码: #include<bits/stdc++.h>using namespace std;int fa;int degree[100007];vector<int>v[100007];void dfs(int x){ for(auto&it:v[x]){ degree[it]=degree[x] 阅读全文
摘要:
代码: #include<bits/stdc++.h>using namespace std;map<string,int>city;map<int,string>rcity;map<int,vector<pair<int,int> > >edge;//对比string要比对比int慢很多,所以转换 阅读全文
摘要:
代码: #include<bits/stdc++.h>using namespace std;const int inf = 1e9;int sum,n,tar,m;int num[507];int edge[507][507];int u,v,val;int mn=inf,mn_send=inf, 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int st[1000007];int top;int s[1000007],t[1000007];int mx[4000007];int sum[4000007];int head[1000007],to[200 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int vis[100007];vector<int>v[100007];vector<int>vt;int deg[100007];void dfs(int a,int nev){//dfs判环 for(auto 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;const long long mod=998244353;long long f[200007][2],g[200007][2];long long a[200007],b[200007],c[200007];i 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int n,a,b,sum;void dfs(int x,int y,int ban){ if(__builtin_popcount(ban^sum)==1){ printf("%d %d ",y,x^y); re 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int a[200007];int b[200007];long long dp[200007];long long sum[200007];const long long mod =1e9+7;int main( 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int a[300007],b[500007],c[500007];set<int>st[300007];vector<int>v;int main(){ int n,m; scanf("%d%d",&n,&m); 阅读全文
摘要:
#include<bits/stdc++.h>using namespace std;int a[1007][1007];pair<int,int>p1[1007],p2[1007];int rk1[1007][1007],rk2[1007][1007],no1[1007][1007],no2[10 阅读全文