题解 | 时津风的资源收集

#include <bits/stdc++.h>
using namespace std;
int bfs(int x){
    queue<pair<int,int>> que;
    que.push({10,0});
    while(!que.empty()){
        auto [a,k]=que.front();
        if(a==x)return k;
        que.pop();
        if(a<x){
            que.push({a+1,k+1});
            que.push({a+10,k+1});
            que.push({a+100,k+1}); 
            que.push({300,k+1});
        }else if(a>x){
            que.push({a-1,k+1});
            que.push({a-10,k+1});
            que.push({a-100,k+1});
            que.push({10,k+1});   
        }
    }
    return 0;
}
int main() {
    int T;
    cin>>T;
    vector<int> ans(350);
    for(int i=10;i<=300;i++){
        ans[i]=bfs(i);
    }
    while(T--){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        cout<<ans[a]+ans[b]+ans[c]+ans[d]<<endl;
    }
}