摘要：
#include#include#include#include#includeusing namespace std;#define maxn 60000typedef long long ll;ll gcd(ll x,ll y){ if(x>y)return gcd(y,x); return x==0?y:gcd(y%x,x);}ll S;struct P{ ll l,r,c; bool operatoraa[i-1].r)for(int j=aa[i-1].r+1;jaa[i-1].l)for(int j=aa[i-1].l;j<aa[i].l;j++)dele(j); i. 阅读全文
摘要：
在并查集的同时维护到第一个点的距离#include#include#include#include#includeusing namespace std;#define maxn 200int f[maxn];int t[maxn];int get(int x){ if(f[x]==x)return x; int l=get(f[x]); t[x]+=t[f[x]]; return f[x]=l;}int n,m;int w;int main(){ scanf("%d",&w); while(w--){ bool p=0; scanf("%d%d" 阅读全文
摘要：
#include#include#include#includeusing namespace std;#define maxn 1604#define maxm 60002#define inf 0x3fffffff#define s(a) ((ab)swap(a,b);add(t(a),s(b),z,1);add(s(b),t(a),-z,0);}do do ff++;while(zeng(S,inf));while(modlab());cout<<cost;} 阅读全文