算法进阶指南：基本算法0x02递归与递推

最新推荐文章于 2024-08-08 20:01:31 发布

原创最新推荐文章于 2024-08-08 20:01:31 发布 · 169 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法进阶指南 #递归 #递推 #分治

算法竞赛进阶指南题目专栏收录该内容

11 篇文章

订阅专栏

acwing95:费解的开关

95. 费解的开关 - AcWing题库

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list> 
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define psi pair<string,int>
#define se second 
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const int MOD=9901;
const int N=110;
int a[5][5],res,dx[]={0,1,-1,0,0},dy[]={0,0,0,1,-1};
string s[5];
void turn(int x,int y)
{
	++res;
	rep(i,0,5){
		int nx=x+dx[i],ny=y+dy[i];
		if(nx<0||nx>=5||ny<0||ny>=5) continue;
		a[nx][ny]=1-a[nx][ny];
	}
}
bool che()
{
	rep(i,0,5) if(!a[4][i]) return false;
	return true;
}
void solve()
{
	int ans=1e9;
	rep(i,0,5) cin>>s[i];
	rep(i,0,1<<5){
		res=0;
		rep(j,0,5) rep(k,0,5) a[j][k]=s[j][k]-'0';
		rep(j,0,5) if(i>>j&1) turn(0,j);
		rep(j,1,5) rep(k,0,5) if(!a[j-1][k]) turn(j,k);
		if(che()) ans=min(ans,res); 
	}
	if(ans<=6) cout<<ans<<endl;
	else cout<<-1<<endl;
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _=1;
	cin>>_;
	while(_--){
		solve();
	}
	return 0;
}

acwing 96. 奇怪的汉诺塔

96. 奇怪的汉诺塔 - AcWing题库

#include<bits/stdc++.h>
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
using namespace std;
const int N=15;
int f[N],g[N];
int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    MEM(g,0x3f);
    f[1]=g[1]=1;
    rep(i,2,N) f[i]=2*f[i-1]+1;
    rep(i,2,N) rep(j,1,i) g[i]=min(g[i],2*g[i-j]+f[j]);
    rep(i,1,13) cout<<g[i]<<endl;
    return 0;
}

Fractal Streets

传递门

#include<bits/stdc++.h>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define psi pair<string,int>
#define se second 
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define db double
typedef long long LL;
using namespace std;
pll calc(int n,LL m)
{
    if(n==0) return {0,0};
    LL len=1ll<<(n-1),cnt=1ll<<(2*n-2);
    pll p=calc(n-1,m%cnt);
    int k=m/cnt;
    if(k==0) return {p.se,p.fi};
    else if(k==1) return {p.fi,p.se+len};
    else if(k==2) return {p.fi+len,p.se+len};
    else return {2*len-p.se-1,len-p.fi-1};
}
void solve()
{
    int n;
    LL s,d;
    cin>>n>>s>>d;
    --s,--d;
    pll st=calc(n,s),ed=calc(n,d);
    LL x=st.fi-ed.fi,y=st.se-ed.se;
    printf("%.0lf\n",sqrt(x*x+y*y)*10);
}
int main()
{
	//ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _=1;
	cin>>_;
	while(_--){
		solve();
	}
	return 0;
}