2017 Multi-University Training Contest - 3

HDU 6058

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <bits/stdc++.h>
 #include <cstdlib>
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define LL long long
 #define mod 1000000007
 using namespace std;
 int t;
 int a[];
 int l[];
 int r[];
 int n,k;
 int main()
 {
      scanf("%d",&t);
     for(int i=;i<=t;i++){
         LL ans=;
         scanf("%d %d",&n,&k);
         for(int j=;j<n;j++)
             scanf("%d",&a[j]);
         for(int j=;j<n;j++){
             int s,t;
             int c1=,c2=;
             for(s=j+;s<n;s++){
                 if(c1>k)
                   break;
                 if(a[s]>a[j])
                     r[c1++]=s-j;
             }
             if(s>=n)
                 r[c1]=n-j;
             for(t=j-;t>=;t--){
                 if(c2>k)
                 break;
                 if(a[t]>a[j])
                     l[c2++]=j-t;
             }
             if(t<=)
                 l[c2]=j+;;
             for(int o=;o<c2;o++){
                 if(k-o->=c1)
                     continue;
                 ans=ans+1LL*a[j]*(l[o+]-l[o])*(r[k-o]-r[k-o-]);
             }
         }
         printf("%lld\n",ans);
     }
     return ;
 }

HDU 6060

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <bits/stdc++.h>
 #include <cstdlib>
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define LL long long
 #define mod 1000000007
 using namespace std;
 int n,k;
 struct node
 {
     int st,ed;
     LL w;
 }N[];
 int pre[];
 LL www[];
 int dp[];

 int nedge=;
 void init()
 {
     nedge=;
     memset(pre,,sizeof(pre));
     memset(www,,sizeof(www));
     memset(dp,,sizeof(dp));
     memset(N,,sizeof(N));
 }
 void add(int s,int t,LL we)
 {
     nedge++;
     N[nedge].ed=t;
     N[nedge].w=we;
     N[nedge].st=pre[s];
     pre[s]=nedge;
 }
 int dfs(int root ,int fa)
 {
     dp[root]=;
     for(int i=pre[root];i;i=N[i].st)
     {
         if(N[i].ed!=fa){
           www[N[i].ed]=N[i].w;
           dp[root]+=dfs(N[i].ed,root);
           }
     }
     return dp[root];
 }
 int main()
 {
     while(scanf("%d %d",&n,&k)!=EOF){
         int a,b;
         LL c;
         init();
         for(int i=;i<n;i++){
             scanf("%d %d %lld",&a,&b,&c);
             add(a,b,c);
             add(b,a,c);
         }
         dfs(,-);
         LL ans=;
         for(int i=;i<=n;i++)
         {
             ans=ans+1LL*min(dp[i],k)*www[i];
         }
         printf("%lld\n",ans);
     }
     return ;
 }

HDU 6063

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <bits/stdc++.h>
 #include <cstdlib>
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define LL long long
 #define mod 1000000007
 using namespace std;
 LL n,k;
 LL fun(LL n,LL k){
   LL ans=;
   LL  b=n;
   while(k){
     if(k%==){
         ans=(ans*b)%mod;
     }
     k/=;
     b=b%mod;
     b=(b*b)%mod;
   }
   return ans;
 }
 int main()
 {
     int t=;
     while(scanf("%lld %lld",&n,&k)!=EOF){
     printf("Case #%d: %lld\n",++t,fun(n,k));
     }
     return ;
 }

HDU 6066

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <bits/stdc++.h>
 #include <cstdlib>
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define LL long long
 #define mod 1000000007
 using namespace std;
 int t;
 int main()
 {
     int ans,exm;
     scanf("%d",&t);
     ans=;
     for(int i=; i<=t; i++)
     {
         scanf("%d",&exm);
         if(exm<=)
             ans++;
     }
     printf("%d\n",ans);
     return ;
 }