2016"百度之星" - 初赛（Astar Round2A）

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include<queue>
#include<vector>
using namespace std;
const int N = 5e5+20, M = 1e2+10, mod = 1000000007,inf = 1e9;
typedef long long ll;
struct Matix {
    ll arr[M][M];
};
ll x,m,k,c;
Matix mul(Matix a,Matix b,ll hang ,ll lie) {
    Matix ans;
    memset(ans.arr,0,sizeof(ans.arr));
    for(int i=1;i<=hang;i++) {
      for(int t=1;t<=lie;t++)
        for(int j=1;j<=lie;j++) {
         ans.arr[i][t]+=(a.arr[i][j]*b.arr[j][t]);
         ans.arr[i][t]%=k;
        }
    }
    return ans;
}
Matix pow(Matix ans,Matix a,ll x) {
    while(x) {
        if(x&1) ans=mul(ans,a,2,2);
        a=mul(a,a,2,2);
        x/=2;
    }
    return ans;
}
int main(){
    ll x,y,z;
    int T,cas=1;
    scanf("%d",&T);
    while(T--) {
        scanf("%I64d%I64d%I64d%I64d",&x,&m,&k,&c);
        Matix fir,sec;
        Matix now;
        now.arr[1][1]=x;
        now.arr[1][2]=x;
        memset(fir.arr,0,sizeof(fir.arr));
        sec.arr[1][1]=10;sec.arr[1][2]=0;
        sec.arr[2][1]=1;sec.arr[2][2]=1;
        fir.arr[1][1]=1;
        fir.arr[2][2]=1;
        fir=pow(fir,sec,m-1);fir=mul(now,fir,2,2);
        printf("Case #%d:\n",cas++);
        if(fir.arr[1][1]==c)puts("Yes");
        else puts("No");
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include<queue>
#include<vector>
using namespace std;
const int N = 1e3+20, M = 1e6+10, mod = 1000000007,inf = 1e9;
typedef long long ll;

ll len[N],dp[N],L,R;
ll dfs(ll x){
    if(x<=0) return 0;
    if(x<=2) return x;
    if(x==3) return 2;
    ll ans=0;
    int pos = upper_bound(len+1,len+62,x) - len - 1;
    if(len[pos]==x) return dp[pos];
    if(x-len[pos]==1) return dp[pos]+1;
    ll ret = dp[pos]+1;
    ll shen = x-len[pos]-1;
    return ret+shen - dp[pos] + dfs(len[pos] - shen);
}
int main() {
    dp[1] = 1;
    len[1] = 1;
    for(int i=2;i<=61;i++) {
        len[i] = len[i-1]*2+1;
    }
    for(int i=2;i<=61;i++) {
        dp[i] = dp[i-1] + 1 + len[i-1] - dp[i-1];
    }
    int T;
    scanf("%d",&T);
    while(T--) {
        scanf("%I64d%I64d",&L,&R);
        printf("%I64d\n",dfs(R)-dfs(L-1));
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include<queue>
#include<vector>
using namespace std;
const int N = 5e5+20, M = 1e6+10, mod = 1000000007,inf = 1e9;
typedef long long ll;


int k,c,x,d[N],n,m,vis[N];
vector<int >G[N]; int ans[N];
int main() {
    int T;
    int cas = 1;
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++) G[i].clear();
        for(int i=1;i<=n;i++) vis[i] = 0,d[i] =  0;
        for(int i=1;i<=m;i++) {
            int a,b;
            scanf("%d%d",&a,&b);
            G[a].push_back(b);
            d[b]++;
        }
        priority_queue<int > q;
        
        for(int i=1;i<=n;i++) {
            if(d[i]==0) q.push(i);
        }
        int cnt =0 ;
        while(!q.empty()) {
            int k  = q.top();
            ans[++cnt] = k;
          //  cout<<k<<endl;
            q.pop();
            for(int i=0;i<G[k].size();i++) {
                d[G[k][i]]--;
                if(d[G[k][i]]==0&&!vis[G[k][i]]) {
                    q.push(G[k][i]);

                    vis[G[k][i]] = 1;
                }
            }
        }
        int mi = 1e9;
        ll aa = 0;
        for(int i=1;i<=cnt;i++) {
            mi = min(ans[i],mi);
            aa  = aa + mi;
        }
        printf("%I64d\n",aa);
    }
    return 0;
}