TwistFate24的博客

#include<cstdio>#include<cstring>using namespace std;const int SEED=13131;unsigned long long s[1000005];unsigned long long p[1000005];int n;bool examin(int pos,unsigned long long s[],unsig...

#include<cstdio>#include<vector>#include<cstring>#include<algorithm>using namespace std;int n,m,ans;int deep[200005],low[200005],fa[200005],pre[200005],tim;vector<int...

做这道题的时候同时复习了 堆优化版本的Dijkstra#include<cstdio>#include<queue>#include<cstring>#include<utility>#include<map>#include<queue>#include<vector>using namespa

  #include<cstdio>#include<algorithm>using namespace std;int n,m,fa[205];struct node{    int u,v,s;}e[1005];bool cmp(node x,node y){    return x.s<y.s;}void init(){   ...

#include<cstdio>#include<algorithm>using namespace std;int n,m,f[105];long long ans;struct node{    int u,v,val;}e[5050];bool cmp(node a,node b){    return a.val<b.val;}int...

#include<cstdio>using namespace std;int n,m;char inpu[1005][1005];int map[1005][1005];int vis[1005][1005];int ans[100005];int dx[4]={0,0,1,-1};int dy[4]={1,-1,0,0};int f[1005][1005];in...

#include<cstdio>#include<cmath>#include<vector>#include<algorithm>#define ll long longusing namespace std;int n,blo,bl[50005];ll a[50005],atag[505];vector<int>ve[505];voi...

#include<cstdio>#include<cstring>#define mod 1000000007using namespace std;int n,m;long long dp[55][55];long long fac[55],inv[55];void initiate(){ fac[0]=inv[0]=1; for(int i=1;i<=54;i++...

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int g[5005],b[5005],d,m,n;int dp[5005][5005];int q[5005];int flag;int head,tail;int main(){ scanf("%d%d%d",&am...

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,m;int h[1000005];int dp[1000005],q[1000005];int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n...

#include<cstdio>using namespace std;long long x1,y1,m,n,L;long long x,y;long long exgcd(long long a,long long b){    if(b==0)    {        x=1;        y=0;        return a;    }    lo...