调手表（bfs）（蓝桥杯2018）

 

调手表 - 蓝桥云课 (lanqiao.cn)

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#define int long long 
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e5 + 10,M = N * 5,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;

int f[N];
int dist[N];
int n,k;
int ans= 0;

void bfs() // 宽搜每次到第一个点的时候 就是到这个点的最短距离
{
	queue<int> q; 
	dist[0] = 0;
	q.push(0);
	while(q.size())
	{
		auto t = q.front();q.pop();
		ans = max(ans,dist[t]);
		int u = (t + 1 ) % n;  // 往后走一步
		if(dist[u] == 0 && u ) //  避免重复遍历 0 号点 
		{
			dist[u] = dist[t] + 1; 
			q.push(u);
		}
		u = (t + k ) % n ;   // 往后走k步
		if(dist[u] == 0 && u)
		{
			dist[u] = dist[t] + 1; 
			q.push(u);
		}	
	}	
	
	cout << ans << endl;
	
	
}


inline void solve()
{
	cin >> n >> k; 
	bfs();
		
		
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}