分析
首先拿道题,操作复杂,而且用 d p dp dp 并不好推出状态与路径。再看一看时间限制,第一反应就是搜索。但是搜索的冗余状态十分的多,而且也会T,于是我们就得想出优化。
对于操作 1 1 1 与操作 2 2 2 ,十分简单,一个是加一,一个是减一,我们很容易知道操作是互逆的,有了这个明显的提示,就想到用双向 b f s bfs bfs 去优化。但是操作三并不容易想出怎么可逆,如果学过逆元,我们就能知道 u p − 2 u^{p-2} up−2 一定是 p p p 的一个逆元,又因为你愿是唯一对应的,所以说 u p − 2 u^{p-2} up−2 的逆元也是 p p p ,也就是 ( u p − 2 ) 2 (u^{p-2})^2 (up−2)2 在题目操作三中是等价于 u u u 的。知道了这些,显然操作三也是可逆的。于是我们就可以用双向 b f s bfs bfs 去优化了。
具体实现:双向 b f s bfs bfs ,在进行操作的时候就可以用一个 m a p map map 记录操作路径与上一个的值,以方便输出路径,但是当从终点反向搜索的时候因为操作一二互逆,所以得反着存一下。当从终点与从起点出发的两条路径相遇了,就可以输出了。
code:
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
#define int long long
using namespace std;
int u,v,p;
struct node{
int num,step;
bool check;
node(){}
node(int Num,int Step,int Check) {num = Num,step = Step,check = Check;}
};
int Pow(int x,int y,int Mod) {
int res = 1;
while(y) {
if(y & 1) res = res * x,res %= Mod;
x = x * x,x %= Mod;
y >>= 1;
}
return res;
}
queue<node> Q;
map<pair<int,int>,pair<int,int> > Mp;
void print(pair<int,int> P1,bool check) {
if(check == 0) {
int x = P1.second;
if(x == -1) return;
print(Mp[make_pair(x,check)],check);
printf("%lld ",P1.first);
}
if(check == 1) {
int x = P1.second;
if(x == -1) return;
printf("%lld ",P1.first);
print(Mp[make_pair(x,check)],check);
}
}
void Double_Way_BFS() {
Q.push(node(u,0,0));
Q.push(node(v,0,1));
Mp[make_pair(u,0)] = make_pair(1,-1);
Mp[make_pair(v,1)] = make_pair(2,-1);
while(!Q.empty()) {
node f = Q.front();
node To = f;
To.step ++;
Q.pop();
if(!To.check) {
To.num = (f.num + 1) % p;
if(!Mp[make_pair(To.num,0)].first)
Mp[make_pair(To.num,0)] = make_pair(1,f.num),Q.push(To);
if(Mp[make_pair(To.num,1)].first) {
printf("%lld\n",To.step * 2 - 1);
print(make_pair(1,f.num),0);
print(Mp[make_pair(To.num,1)],1);
return;
}
To.num = (f.num + p - 1) % p;
if(!Mp[make_pair(To.num,0)].first)
Mp[make_pair(To.num,0)] = make_pair(2,f.num),Q.push(To);
if(Mp[make_pair(To.num,1)].first) {
printf("%lld\n",To.step * 2 - 1);
print(make_pair(2,f.num),0);
print(Mp[make_pair(To.num,1)],1);
return;
}
To.num = Pow(f.num,p - 2,p);
if(!Mp[make_pair(To.num,0)].first)
Mp[make_pair(To.num,0)] = make_pair(3,f.num),Q.push(To);
if(Mp[make_pair(To.num,1)].first) {
printf("%lld\n",To.step * 2 - 1);
print(make_pair(3,f.num),0);
print(Mp[make_pair(To.num,1)],1);
return;
}
}
if(To.check) {
To.num = (f.num + 1) % p;
if(!Mp[make_pair(To.num,1)].first)
Mp[make_pair(To.num,1)] = make_pair(2,f.num),Q.push(To);
if(Mp[make_pair(To.num,0)].first) {
printf("%lld\n",To.step * 2);
print(Mp[make_pair(To.num,0)],0);
print(make_pair(2,f.num),1);
return;
}
To.num = (f.num + p - 1) % p;
if(!Mp[make_pair(To.num,1)].first)
Mp[make_pair(To.num,1)] = make_pair(1,f.num),Q.push(To);
if(Mp[make_pair(To.num,0)].first) {
printf("%lld\n",To.step * 2);
print(Mp[make_pair(To.num,0)],0);
print(make_pair(1,f.num),1);
return;
}
To.num = Pow(f.num,p - 2,p);
if(!Mp[make_pair(To.num,1)].first)
Mp[make_pair(To.num,1)] = make_pair(3,f.num),Q.push(To);
if(Mp[make_pair(To.num,0)].first) {
printf("%d\n",To.step * 2);
print(Mp[make_pair(To.num,0)],0);
print(make_pair(3,f.num),1);
return;
}
}
}
}
signed main() {
scanf("%lld %lld %lld",&u,&v,&p);
Double_Way_BFS();
return 0;
}