2023杭电第三场补题报告1005 1011

2023杭电第三场补题报告1005 1011

1005 Out of Control (hdu.edu.cn)

思路

直接二维dp，当长度为i以j结尾的时候方案数直接计数。

代码

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fi first
#define sc second

using namespace std;
const int INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
typedef pair<int, int> PII;
int n;
int a[N];

int f[3010][3010];
void solve() {
  cin >> n;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) f[i][j] = 0;
  }

  map<int, int> mp;
  vector<int> p(n + 10);
  for (int i = 1; i <= n; i++) cin >> a[i], mp[a[i]]++;
  sort(a + 1, a + n + 1);
  int m = mp.size();
  int idx = 1;
  for (auto [i, j] : mp) {
    p[idx] = p[idx - 1] + j;
    idx++;
  }
  for (int i = 1; i <= m; i++) {
    f[1][i] = 1;
  }
  for (int i = 2; i <= n; i++) {
    int pre = 0;
    for (int j = 1; j <= m; j++) {
      if (p[j] >= i)
        f[i][j] = (f[i][j] + pre + f[i - 1][j]) % mod;
      else
        f[i][j] = (f[i][j] + pre) % mod;
      // f[i][j]=f[i-1][j]*
      pre += f[i - 1][j];
      pre %= mod;
    }
  }

  // for (int i = 1; i <= n; i++) {
  // for (int j = 1; j <= m; j++) {
  // cout << f[i][j] << " ";
  // }
  // cout << "\n";
  // }

  for (int i = 1; i <= n; i++) {
    int sum = 0;
    for (int j = 1; j <= m; j++) {
      sum += f[i][j];
      sum %= mod;
    }
    cout << sum << "\n";
  }
}

signed main() {
  IOS;
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
}

1011 8-bit Zoom (hdu.edu.cn)

思路

直接按比例等比例缩放即可，签到。

代码

#include <bits/stdc++.h>
using namespace std;
void solve();
int main(){
	//cin.sync_with_stdio(0);
	//cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}
#define N 100
char g[N][N],g1[N*3][N*3];

void solve(){
	int n, z;
	cin >> n >> z;
	
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++){
			cin >> g[i][j];
		}
	}
	if(n * z % 100 != 0){
		cout << "error\n"; 
		return;
	}
	int tmp = __gcd(z,100);
	int tmp1 =  z / tmp;
	tmp = 100 / tmp;
	if(n % tmp) {
		cout << "error\n"; 
		return;
	}
	for(int i = 1;i <= n;i+=tmp){
		for(int j = 1;j <= n;j+=tmp){
			char c = g[i][j];
			for(int x = 0;x < tmp;x ++) {
				for(int y = 0;y < tmp;y ++) {
					if(c != g[i+x][j+y]) {
						cout << "error\n"; 
						return;
					}
				}
			}
			for(int x = 1;x <= tmp1;x ++) {
				for(int y = 1;y <= tmp1;y ++) {
					g1[((i-1)*tmp1/tmp)+x][((j-1)*tmp1/tmp)+y] = c;
				}
			}
		}
	}
	
	
	for(int i = 1;i <= n * tmp1 / tmp;i ++){
		for(int j = 1;j <= n * tmp1 / tmp;j ++){
			cout<<g1[i][j];
		}
		cout<<endl;
	}
}