Summer training #5

B:分析序列 构造树(优先队列)

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-8
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
vector<int> tree[];
int visit[];
int pop=;
int pop1=;
int scan[];
priority_queue<int, vector<int>, greater<int> > leaf;
int maxn=;
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 int now;
 //TS;
 while(scanf("%d ",&now)!=EOF)
 {
        scan[++pop]=now;
        maxn=max(maxn,now);
        visit[now]++;
 }
 //cout<<maxn<<endl;
 visit[maxn]++;
 //TS;
 for(int i=;i<=maxn;i++)
 {
        if(visit[i]==)
        {
        leaf.push(i);
        }
 }
 while(!leaf.empty())
 {
        int cur;
        cur= leaf.top();
        leaf.pop();
        tree[scan[pop1]].push_back(cur);
        //cout<<scan[pop1]<<"pushin:"<<cur<<endl;
        tree[cur].push_back(scan[pop1]);
        //cout<<cur<<"pushin:"<<scan[pop1]<<endl;
        if(--visit[scan[pop1]]==)
        leaf.push(scan[pop1]);
        pop1++;
 }
 for(int i=;i<=maxn;i++)
 {
        //printf("%d ",tree[i].size());
        sort(tree[i].begin(),tree[i].end());
        printf("%d:",i);
        for(int j=;j<(int)tree[i].size();j++)
        {
        printf(" %d",tree[i][j]);
        }
        printf("\n");
 }
  return ;
}

C:求满足题意的正方形个数(二维前缀和 前缀和思想)  更难的相似的:http://agc015.contest.atcoder.jp/tasks/agc015_c

F: 打表找规律

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-8
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 int t;
 cin >> t;
 while(t--)
 {
        int s,k;
        scanf("%d %d",&s,&k);
        if(k%==)
        {
        if(s%==)
        {
        cout<<<<endl;
        continue;
        }
        else
        {
        cout<<<<endl;
        continue;
        }
        }
        else
        {
        /*int now=0;
        while(s>0)
        {
        now+=s%k;
        s/=k;
        }
        cout<<now<<endl;*/
        int now=s%(k+);
        if(now%==)
        cout<<<<endl;
        else
        {
        if(now==k)
        cout<<k<<endl;
        else
        cout<<<<endl;
        }
        }
 }
  return ;
}

G:水

H:二进制分析(lucky 测试数据没有失败的也没有要求最优解的)

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-8
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int er[];
int er2[];
int ans[];
ll l,r;
int pop=;
ll anser1=;
void init(ll t)
{
 int pop=;
 while(t>)
 {
   er[pop++]=t%;
   t=t/;
 }
}
void init2(ll t)
{
 int pop=;
 while(t>)
 {
   er2[pop++]=t%;
   t=t/;
 }
}
ll now[];
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 mem(ans,-);
 int flag=;
 int have=;
 int n;
 cin >> n;
 for(int i=;i<=n;i++)
        cin>>now[i];
 for(int i=;i<n;i++)
 {
        if(flag==)
        break;
        mem(er,);
        mem(er2,);
        ll cur=now[i];
        ll next=now[i+];
        init(cur);
        init2(next);
        int flag2=;
        for(int j=;j>=;j--)
        {
        if(er[j]!=er2[j])
        {
        //        cout<< j<<endl;
        if(er[j]==&&er2[j]==)
        {
        if(ans[j]==-)
        {
        ans[j]=;
        have++;
        flag2=;
        break;
        }
        else if(ans[j]==)
        {
        flag2=;
        break;
        }
        }
        else if(er[j]==&&er2[j]==)
        {
        if(ans[j]==-)
        {
        ans[j]=;
        have++;
        flag2=;
        break;
        }
        else if(ans[j]==)
        {
        flag2=;
        break;
        }
        }
        }
        }
        if(flag2==)
        flag=;
 }
 if(flag==)
 {
  cout<<<<endl;
  return ;
 }
 ll anser=1LL*<<(-have);
 cout<<anser<<endl;
  return ;
}

I:数位DP

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-8
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000007
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
ll ans[][];
void init()
{
        ans[][]=,ans[][]=ans[][]=;
        for(int i=;i<=;i++)
        {
           ans[i+][]=(ans[i][]+ans[i][]+ans[i][])*%MOD;
           ans[i+][]=ans[i][]%MOD,ans[i+][]=ans[i][]%MOD;
        }
}
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 init();
 int t;
 cin >> t;
 while(t--)
 {
        int n;
        scanf("%d",&n);
        ll anser=(ans[n][]+ans[n][]+ans[n][])%MOD;
        cout<<anser<<endl;
 }
  return ;
}