算法训练赛第七场

算法训练赛第七场

链接

A 计蒜客 A1638 合并数字

蒜头君得到了 n 个数，他想对这些数进行下面这样的操作，选出最左边的相邻的差的绝对值为 11 的两个数，只保留较小的数，删去较大的数，直到没有两个相邻的差的绝对值为 11 的数，问最多可以进行多少次这样的操作？

每次比较最左边两个数，并进行删除操作 首先想到栈

1. 每次读入临时变量tmp进行判断并执行操作

2. 若栈不为空，则进行大小比较

   • 若栈顶元素比临时变量大1

     • 将栈顶删除 即执行出栈

     • 计数器cnt进行加1

     • 执行一次后，栈顶进行更新，要将tmp与新的栈顶进行比较

   • 若临时变量比栈顶元素大1
     • 计数器cnt进行加1
   • 若上述均不满足 进行入栈即可

3. 最终输出 计数结果

#include<iostream>
#include<stack>
using namespace std;

stack <int> s;
int N, cnt = 0, tmp;

int main(){
    cin >> N;
    while (N --){
        cin >> tmp;
        while (!s.empty() && s.top() - tmp == 1){
            s.pop();
            cnt ++;
        }
        if (!s.empty() && tmp - s.top() == 1)
            cnt ++;
        else s.push(tmp);
    }
    cout << cnt << endl;
    return 0;
}

B 计蒜客 A2238 找质数

一天蒜头君猜想，是不是所有的偶数（除了 2），都可以用两个质数相加得到呢？于是聪明的蒜头君就找你来验证了。

毒瘤题，数据量有问题

熟悉一下快读和欧拉筛

#include <iostream>
#include <deque>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll maxn = 1e6+10;

int T,N;
int ans[maxn];
bool vis[maxn];
int P[maxn/10],tail;

inline int read(){
    int s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}

void initP(int N){
    for(int i = 2;i < =N;i ++){
        if(!vis[i]) P[tail++] = i;
        for(int j = 0;P[j]<=N/i;j++){
            vis[P[j]*i] = true;
            if(i % P[j] ==0 ) break;
        }
    }
}

int main(){
    initP(1000000);
    cin>>T;
    while(T--){
        N = read();
        for(int i = 0;i<tail && P[i]+P[i]<=N;i++){
            if(!vis[N-P[i]]){
                printf("%d %d\n",P[i],N-P[i]);
                break;
            }
        }
    }

    return 0;
}

C HDU 1312 Red and Black

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on red tiles, he can move only on black tiles.

DFS or BFS模板题

• dfs

  #include <cstring>
  #include <cstdio>
  using namespace std;
  
  int n, m, startx, starty, cnt;
  int nt_sp[4][2] = {-1,0,1,0,0,1,0,-1};
  char str[25][25];
  bool det[25][25];
  bool bdy(int x, int y){
      return (x <= n && x >= 1 && y <= m && y >= 1);
  }
  void dfs(int x,int y){
      cnt++;
      det[x][y] = true;
      for(int i = 0;i<4;i++){
          int nx = x + nt_sp[i][0], ny = y + nt_sp[i][1];
          if(!det[nx][ny] && bdy(nx, ny) && str[nx][ny] == '.')
              dfs(nx,ny);
      }
  }
  
  int main(){
      while(scanf("%d %d",&m,&n)){
          if(m == 0 && n == 0) break;
          cnt = 0;
          memset(det,0,sizeof det);
          for(int i = 1;i<=n;i++){
              for(int j = 1;j<=m;j++){
                  scanf(" %c",&str[i][j]);
                  if(str[i][j] == '@'){
                      startx = i,starty = j;
                  }
              }
          }
          dfs(startx,starty);
          printf("%d\n",cnt);
      }
  
      return 0;
  }
  

• bfs

  #include <iostream>
  #include <cstring>
  #include <queue>
  #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  using namespace std;
  
  int n, m, bx, by, cnt, nx, ny;
  char str[25][25];
  bool det[25][25];
  int nt_sp[4][2] = {-1,0,1,0,0,1,0,-1};
  struct node{
      int x, y;
  };
  queue <node> q;
  bool bdy(int x, int y){
      return (x <= n && x >= 1 && y <= m && y >= 1);
  }
  void bfs(int x ,int y){
      while(!q.empty()) q.pop();
      det[x][y] = true;
      q.push({x, y});
      while (!q.empty()){
          node now = q.front();
          for (int i = 0; i < 4; i ++){
              nx = now.x + nt_sp[i][0], ny = now.y + nt_sp[i][1];
              if(!det[nx][ny] && bdy(nx, ny) && str[nx][ny] == '.'){
                  cnt ++;
                  det[nx][ny] = true;
                  q.push({nx,ny});
              }
          }
          q.pop();
      }
  
  }
  int main(){
      ios;
      while (cin >> m >> n && m && n){
          cnt = 1;
          memset(det, false, sizeof det);
          for (int i = 1; i <= n; i ++)
              for (int j = 1; j <= m; j ++){
                  cin >> str[i][j];
                  if (str[i][j] == '@')
                      bx = i, by = j;
              }
          bfs(bx, by);
          cout << cnt << endl;
      }
      return 0;
  }
  

D CodeForces 1141A Game 23

Polycarp plays “Game 23”. Initially he has a number n and his goal is to transform it to mm . In one move, he can multiply n by 22 or multiply n by 33 . He can perform any number of moves.

Print the number of moves needed to transform n to mm . Print -1 if it is impossible to do so.

It is easy to prove that any way to transform n to mm contains the same number of moves

取余后判断即可

#include <iostream>
using namespace std;
int n, m, tmp, cnt = 0;
int main(){
    cin >> n >> m;
    if(m % n != 0)
        cout << -1;
    else{
        tmp = m / n;
        while (tmp % 2 == 0)
            tmp /= 2, cnt++;
        while (tmp % 3 == 0)
            tmp /= 3, cnt++;
        if (tmp != 1)
            cout << -1 << endl;
        else
            cout << cnt << endl;
    }
    return 0;
}

E POJ 1321 棋盘问题

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

dfs入门

#include<stdio.h>
#include<string.h>
using namespace std;
char map[9][9];
int vis[50],n,k,ans;
void dfs(int m,int k){
    if(k==0){
        ans++;
        return ;
    }
    for(int i=m;i<n;i++)
        for(int j=0;j<n;j++){
            if(map[i][j]=='.'||vis[j]==1) continue;
            vis[j]=1;
            dfs(i+1,k-1);
            vis[j]=0;
        }
}
int main(){
    while(~scanf("%d%d",&n,&k)){
        if(n==-1&&k==-1)
            break;
        for(int i=0;i<n;i++)
            scanf("%s",&map[i]);
        memset(vis,0,sizeof(vis));
        ans=0;
        dfs(0,k);
        printf("%d\n",ans);
    }
    return 0;
}

F HDU 1087 Super Jumping!

Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.

题意

• 多组输入，每行第一数字为N，其后N个数字代表N个棋盘点，大小代表该点的值
• 我们可从任意一棋盘点进行向右跳跃 但要求跳跃过程，经过点的大小逐次增大
• 输出符合条件的跳跃方案得到的最大值

上升子序列可直接暴力

• 枚举该点前所有点
• 如果arr[i - 1] < arr[i]则可进行跳跃
• 从该点原有的值 与 新跳跃方案所得值中 取最大值
• 遍历完毕得到该点为终点得最大方案
• 最终遍历各点作为终点时的大小，选出最大值输出

#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long ll;
int N;
ll dp[1010];
int arr[1010];
int main(){
    while(scanf("%d",&N) && N){
        memset(dp,0,sizeof dp);
        for(int i = 1;i<=N;i++) scanf("%d",&arr[i]);
        for(int i = 1;i<=N;i++){
            dp[i] = arr[i];
            for(int j = 1;j<i;j++){
                if(arr[j] < arr[i])
                    dp[i] = max(dp[i],dp[j] + arr[i]);
            }
        }
        ll mx = 0;
        for(int i = 1;i<=N;i++) mx = max(mx,dp[i]);
        printf("%lld\n",mx);

    }

    return 0;
}

G HDU 2161 Primes

Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisors are 1 and n. For this problem, the numbers 1 and 2 are not considered primes.

判断质数

编写程序以读取整数列表，并确定每个数字是否为质数

注意输出格式，且题目中指出在该题中2不为质数

#include <cmath>
#include <iostream>
using namespace std;
int ans(int n) {
    long long k = sqrt(n) + 1;
    for (int i = 2; i <= k; i++)
        if (n % i == 0)
            return 0;
    return 1;
}
int a;
int main() {
    int i = 1;
    while (cin >> a && a > 0) {
        cout << i++ << ": ";
        if (a == 1 || a == 2)
            cout << "no";
        else if (ans(a))
            cout << "yes";
        else
            cout << "no";
        cout << endl;
    }
    return 0;
}

H CodeForces 1311B WeirdSort

You are given an array a of length n.
You are also given a set of distinct positions p_1, p_2, \dots, p_m, where 1 \le p_i < n. The position p_i means that you can swap elements a[p_i] and a[p_i + 1]. You can apply this operation any number of times for each of the given positions.

数据量很小，可直接暴力

T组数据，n个数，m个操作

每个操作 b[i]代表可将a[b[i]]与a[b[i] + 1] 进行交换

求经过交换能否数组a变为单调递增数组

#include <iostream>
using namespace std;
int t, m, n, a[1005], b[1005], flag;
int main() {
    cin >> t;
    while (t--) {
        cin >> n >> m;
        flag = 0;
        for (int i = 1; i <= n; i++) cin >> a[i];
        for (int i = 1; i <= m; i++) cin >> b[i];
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++) 
                if (a[b[j]] > a[b[j] + 1])
                    swap(a[b[j]], a[b[j] + 1]);
        for (int i = 2; i <= n; i++)
            if (a[i] < a[i - 1]) {
                flag = 1;
                break;
            }
        if (flag)
            cout << "NO" << endl;
        else
            cout << "YES" << endl;
    }

    return 0;
}

I LightOJ 1078 Integer Divisibility

If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report the number of digits of such multiple.

T组数据，找到N的倍数，该数只能有tim位M组成，输出M

大数取余

有一个大数989565215785528545587（大数）对10003（小数）取余，需要将该大数从最左端开始对10003取余；
start:
　　　　　　9%10003==9;
　　　　　　(9*10+8)%10003==98;
　　　　　　(98*10+9)%10003==989;
　　　　　　(989*10+5)%10003==9895;
　　　　　　(9895*10+6)%10003==8929;
　　　　　　(8929*10+5)%10003==9271;
　　　　　　......

取余变形

123 % 2 等价于 (3 % 2 + 20 % 2 + 100 % 2) % 2

直接暴力可过

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;

int T,N,M;
ll r, tim;
ll fun(){
    r = 0,tim = 0;
    while(true){
        r = (r*10 + M) % N;
        tim++;
        if(r == 0) break;
    }
    return tim;
}
int main(){
    cin>>T;
    int kase = 0;
    while(T--){
        scanf("%d %d",&N,&M);
        ll res = fun();
        printf("Case %d: %lld\n",++kase,res);
    }
    return 0;
}

J HDU 1969 Pie

My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.

N种蛋糕，每个半径给出，要分给F+1个人，要求每个人分的体积一样（形状可以不一样），而且每人只能分得一种蛋糕（即一个人得到的蛋糕只能来自一块），求每人最大可以分到的体积。

double二分搜索
最小值是： 0 （大家都不吃）
最大值是：派的总体积 ÷ 总人数 （超完美平均主义）
每次取中间值 记作：mid，计算如果每个派切出 mid体积 能切多少块
如果能切够 F+1块，则将最小值更新为中间值
如果切不出 F+1块，则将最大值更新为中间值
直到两次中间值的差值 小于 10^(-4) 时就是结果了（精度）

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define PI acos(-1)
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 10;

int T, N, F;
double area[maxn];

bool judge(double x) {
    int cnt = 0;
    for (int i = 1; i <= N; i++) {
        cnt += int(area[i] / x);
    }
    return cnt >= F;
}
int main() {
    cin >> T;
    while (T--) {
        double l = 0, r = 0, mid;
        scanf("%d %d", &N, &F);
        F++;
        for (int i = 1; i <= N; i++) {
            int R;
            scanf("%d", &R);
            area[i] = R * R * PI;
            r = max(r, area[i]);
        }
        l = r / F;
        while (r - l > 1e-5) {
            mid = (l + r) / 2;
            if (judge(mid))
                l = mid;
            else
                r = mid;
        }
        printf("%.4lf\n", l);
    }
    return 0;
}

K HDU 1263 水果

夏天来了好开心啊,呵呵,好多好多水果~~
Joe经营着一个不大的水果店.他认为生存之道就是经营最受顾客欢迎的水果.现在他想要一份水果销售情况的明细表,这样Joe就可以很容易掌握所有水果的销售情况了.

map

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <cstdio>
using namespace std;

int T,M,tag;
struct node{
    string name,place;
    bool operator < (const node & o) const{
        if(place != o.place) return place < o.place;
        return name < o.name;
    }
};
map<node,int> mp;
int main(){
    cin>>T;
    while(T--){
        mp.clear();
        if(tag) puts("");tag = 1;
        cin>>M;
        while(M--){
            string s1,s2;int v;
            cin>>s1>>s2>>v;
            mp[{s1,s2}] += v;
        }
        string lastplace = "-1";
        for(auto p:mp){
            node info  = p.first;
            if(info.place != lastplace){
                cout<<info.place<<endl;
                lastplace = info.place;
            }
            printf("   |----%s(%d)\n",info.name.c_str(),p.second);
        }
    }
    return 0;
}

L CodeForces 1315A Dead Pixel

Screen resolution of Polycarp’s monitor is a×ba×b pixels. Unfortunately, there is one dead pixel at his screen. It has coordinates (x,y)(x,y) (0≤x<a,0≤y<b0≤x<a,0≤y<b). You can consider columns of pixels to be numbered from 00 to a−1a−1, and rows — from 00 to b−1b−1.

一个区域有一个坏点，找出正常的最大区域

即找出这个点左右上下四部分最大的一部分即可

#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;

int T, A, B, X, Y;
int t1, t2, t3, t4, res;
int main() {
    cin >> T;
    while (T--) {
        scanf("%d %d %d %d", &A, &B, &X, &Y);
        t1 = X * B;
        t2 = (A - X - 1) * B;
        t3 = A * Y;
        t4 = A * (B - Y - 1);
        res = max(max(t1, t2), max(t3, t4));
        printf("%d\n", res);
    }

    return 0;
}

M HDU 1211 Complete the Sequence

You probably know those quizzes in Sunday magazines: given the sequence 1, 2, 3, 4, 5, what is the next number? Sometimes it is very easy to answer, sometimes it could be pretty hard. Because these “sequence problems” are very popular, ACM wants to implement them into the “Free Time” section of their new WAP portal.

差分
n项数列的n-1阶差分，进行n-1次得到第0阶的值 类似于求导，最终差值相同且为常数（类似于求导）

#include <iostream>
using namespace std;
int f[102][102];
int main() {
    int t;
    cin >> t;
    while (t--){
        int m, n;
        cin >> m >> n;
        for (int i = 0; i < m; i++) cin >> f[0][i];//读入原有数据
        for (int i = 1; i < m; i++)
            for (int j = 0; j + i < m; j++)
                f[i][j] = f[i - 1][j + 1] - f[i - 1][j];//进行逐阶求差分
        for (int i = 1; i <= n; i++) f[m - 1][i] = f[m - 1][0];//使最后一行相同 满足差值相等
        for (int i = m - 2; i >= 0; i--)
            for (int j = m - i; j < m + n; j++)
                f[i][j] = f[i][j - 1] + f[i + 1][j - 1];//前缀和求出后续值
        for (int i = m; i < m + n - 1; i++) cout << f[0][i] << " ";
        cout << f[0][m + n - 1] << endl;
    }
    return 0;
}

N LightOJ 1234 Harmonic Number

In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers:

求f(n)=1/1+1/2+1/3+1/4…1/n (1 ≤ n ≤ 108).，精确到10-8

调和级数(即f(n))至今没有一个完全正确的公式，但欧拉给出过一个近似公式：(n很大时)

f(n)≈ln(n)+C+1/2*n

欧拉常数值：C≈0.57721566490153286060651209

• 结合公式

  公式：f(n)=ln(n)+C+1/(2*n);

  此时公式n很大时才适用，故n很小时直接求

  #include <cmath>
  #include <cstdio>
  #include <cstring>
  using namespace std;
  const double c = 0.57721566490153286060651209;
  double ans[10000];
  
  void mul() {
      memset(ans, 0, sizeof(ans));
      for (int i = 1; i < 10000; i++)
          ans[i] = ans[i - 1] + 1.0 / i;
  }
  
  int main() {
      int t, n;
      mul();
      scanf("%d", &t);
      for (int i = 1; i <= t; i++) {
          scanf("%d", &n);
          if (n < 10000)
              printf("Case %d: %.10f\n", i, ans[n]);
          else
              printf("Case %d: %.10f\n", i, log(n) + c + 1.0 / (2 * n));
      }
      return 0;
  }
  

• 打表

  原题n范围为1e8，每隔100个打表，即若199需要将打表所得100再执行99次，t最大为1e4，故最大为1e6，不会超时

  #include <cstdio>
  #include <iostream>
  using namespace std;
  typedef long long ll;
  const ll maxn = 1e6 + 10;//内存大小限制数组所开大小，一般1e6保险
  
  int T, N;
  double ans[maxn];
  void init() {
      double cur = 0;
      for (int i = 1; i <= 100000000; i++) {
          cur += 1 / double(i);
          if (i % 100 == 0)
              ans[i / 100] = cur;
      }
  }
  int main() {
      init();
      cin >> T;
      int kase = 0;
      while (T--) {
          printf("Case %d: ", ++kase);
          scanf("%d", &N);
          double res = ans[N / 100];
          for (int i = N / 100 * 100 + 1; i <= N; i++) {
              res += 1 / double(i);
          }
          printf("%.9lf\n", res);
      }
  
      return 0;
  }