AtCoder ABC 132E Hopscotch Addict

题目链接：https://atcoder.jp/contests/abc132/tasks/abc132_e

题目大意

　　给定一张 N 个点 M 条边无自环无重边的一张有向图，求从起点 S 能否三步三步跳到终点 T，输出跳的次数。

分析

　　是一个步长为 3 的 BFS。

代码如下

  1 #include 
  2 using namespace std;
  3  
  4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
  6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
  7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
  8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
  9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 12  
 13 #define pr(x) cout << #x << " = " << x << "  "
 14 #define prln(x) cout << #x << " = " << x << endl
 15  
 16 #define LOWBIT(x) ((x)&(-x))
 17  
 18 #define ALL(x) x.begin(),x.end()
 19 #define INS(x) inserter(x,x.begin())
 20 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
 21 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c 
 22 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
 23 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 24  
 25 #define ms0(a) memset(a,0,sizeof(a))
 26 #define msI(a) memset(a,inf,sizeof(a))
 27 #define msM(a) memset(a,-1,sizeof(a))
 28 
 29 #define MP make_pair
 30 #define PB push_back
 31 #define ft first
 32 #define sd second
 33  
 34 template
 35 istream &operator>>(istream &in, pair &p) {
 36     in >> p.first >> p.second;
 37     return in;
 38 }
 39  
 40 template
 41 istream &operator>>(istream &in, vector &v) {
 42     for (auto &x: v)
 43         in >> x;
 44     return in;
 45 }
 46  
 47 template
 48 ostream &operator<<(ostream &out, const std::pair &p) {
 49     out << "[" << p.first << ", " << p.second << "]" << "\n";
 50     return out;
 51 }
 52 
 53 inline int gc(){
 54     static const int BUF = 1e7;
 55     static char buf[BUF], *bg = buf + BUF, *ed = bg;
 56     
 57     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
 58     return *bg++;
 59 } 
 60 
 61 inline int ri(){
 62     int x = 0, f = 1, c = gc();
 63     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
 64     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
 65     return x*f;
 66 }
 67 
 68 template<class T>
 69 inline string toString(T x) {
 70     ostringstream sout;
 71     sout << x;
 72     return sout.str();
 73 }
 74 
 75 inline int toInt(string s) {
 76     int v;
 77     istringstream sin(s);
 78     sin >> v;
 79     return v;
 80 }
 81 
 82 //min <= aim <= max
 83 template
 84 inline bool BETWEEN(const T aim, const T min, const T max) {
 85     return min <= aim && aim <= max;
 86 }
 87  
 88 typedef long long LL;
 89 typedef unsigned long long uLL;
 90 typedef pair< double, double > PDD;
 91 typedef pair< int, int > PII;
 92 typedef pair< int, PII > PIPII;
 93 typedef pair< string, int > PSI;
 94 typedef pair< int, PSI > PIPSI;
 95 typedef set< int > SI;
 96 typedef set< PII > SPII;
 97 typedef vector< int > VI;
 98 typedef vector< double > VD;
 99 typedef vector< VI > VVI;
100 typedef vector< SI > VSI;
101 typedef vector< PII > VPII;
102 typedef map< int, int > MII;
103 typedef map< int, string > MIS;
104 typedef map< int, PII > MIPII;
105 typedef map< PII, int > MPIII;
106 typedef map< string, int > MSI;
107 typedef map< string, string > MSS;
108 typedef map< PII, string > MPIIS;
109 typedef map< PII, PII > MPIIPII;
110 typedef multimap< int, int > MMII;
111 typedef multimap< string, int > MMSI;
112 //typedef unordered_map< int, int > uMII;
113 typedef pair< LL, LL > PLL;
114 typedef vector< LL > VL;
115 typedef vector< VL > VVL;
116 typedef priority_queue< int > PQIMax;
117 typedef priority_queue< int, VI, greater< int > > PQIMin;
118 const double EPS = 1e-8;
119 const LL inf = 0x7fffffff;
120 const LL infLL = 0x7fffffffffffffffLL;
121 const LL mod = 1e9 + 7;
122 const int maxN = 1e5 + 7;
123 const LL ONE = 1;
124 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
125 const LL oddBits = 0x5555555555555555;
126 
127 int N, M, S, T, ans = -1;
128 VI v[maxN];
129 int vis[maxN][3];
130 
131 void bfs() {
132     int cnt = 1, times = 0;
133     queue< int > Q;
134     Q.push(S);
135     vis[S][0] = 1;    
136     
137     while(!Q.empty()) {
138         int tmp = Q.front(); Q.pop();
139         --cnt;
140         
141         foreach(i, v[tmp]) {
142             if(vis[*i][2]) continue; // 如果从 *i 向下走两步已经执行过，就跳过 
143             vis[*i][2] = 1;
144             
145             foreach(j, v[*i]) {
146                 if(vis[*j][1]) continue; // 如果从 *j 向下走一步已经执行过，就跳过 
147                 vis[*j][1] = 1;
148                 
149                 foreach(k, v[*j]) {
150                     if(vis[*k][0]) continue; // 如果从 *k 向下走零步已经执行过，就跳过 
151                     vis[*k][0] = 1;
152                     
153                     if(*k == T) {
154                         ans = times + 1;
155                         return;
156                     }
157                     Q.push(*k);
158                 }
159             }
160         }
161         
162         if(cnt == 0) {
163             cnt = Q.size();
164             ++times;
165         }
166     }
167 } 
168 
169 int main(){
170     //freopen("MyOutput.txt","w",stdout);
171     //freopen("input.txt","r",stdin);
172     INIT();
173     cin >> N >> M;
174     Rep(i, M) {
175         int x, y;
176         cin >> x >> y;
177         v[x].PB(y);
178     }
179     cin >> S >> T;
180     bfs();
181     cout << ans << endl;
182     return 0;
183 }

View Code

 

转载于:https://www.cnblogs.com/zaq19970105/p/11109617.html