Codeforces 743A. Vladik and flights

最新推荐文章于 2022-02-13 23:54:15 发布

weixin_30896511

最新推荐文章于 2022-02-13 23:54:15 发布

阅读量110

点赞数

原文链接：http://www.cnblogs.com/ToTOrz/p/6856335.html

版权

本文介绍了一个关于寻找从Vladik家到国际信息学奥林匹克竞赛最经济路线的问题。Vladik需要找到从机场a到机场b的最低成本路径，路径成本取决于机场所属公司。文章提供了一个简单的解决方案，并附带了C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.

Vladik knows n airports. All the airports are located on a straight line. Each airport has unique id from 1 to n, Vladik's house is situated next to the airport with id a, and the place of the olympiad is situated next to the airport with id b. It is possible that Vladik's house and the place of the olympiad are located near the same airport.

To get to the olympiad, Vladik can fly between any pair of airports any number of times, but he has to start his route at the airport a and finish it at the airport b.

Each airport belongs to one of two companies. The cost of flight from the airport i to the airport j is zero if both airports belong to the same company, and |i - j| if they belong to different companies.

Print the minimum cost Vladik has to pay to get to the olympiad.

Input

The first line contains three integers n, a, and b (1 ≤ n ≤ 105, 1 ≤ a, b ≤ n) — the number of airports, the id of the airport from which Vladik starts his route and the id of the airport which he has to reach.

The second line contains a string with length n, which consists only of characters 0 and 1. If the i-th character in this string is 0, then i-th airport belongs to first company, otherwise it belongs to the second.

Output

Print single integer — the minimum cost Vladik has to pay to get to the olympiad.

仔细阅读后发现其实只有两种可能，机场一样就直接0，机场不一样就是1

#include <cstdio>
#include <cctype>
#include <stdlib.h>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <map>

using namespace std;
typedef long long LL;

char air[100005] = {0};
int n,a,b;
int main()
{
  // freopen("test.in","r",stdin);
  cin >> n >> a >> b;
  for (int i=1;i<=n;i++){
    cin >> air[i];
  }
  if (air[a] == air[b]){
    cout << 0; 
  }
  else
    cout << 1;

  return  0;
}