Submission #2137624


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <math.h>
#include <array>
#include <list>
#include <set>
#define MOD 1000000007
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef tuple<ll,int,int> p;
typedef vector<int> vi;
set <int> st;
vector<int> videos(105);
double now=0;
queue<int> num;
int n;
ll s,t;
vi v(100005);
vi w(100005);
int ret;
int dfs(ll now,int count)
{
  ret=-1;
  if(2*now==t || 2*now+1 == t) return ret=count+1;
  else if(now==t) return ret=count;
  else
    {
      if(2*now+1<t)
	{
	  dfs(2*now,count+1);
	  dfs(2*now+1,count+1);
	}
    }
  return ret;
}

int main(int argc,char const* argv[])
{
  cin >> n >> s>> t;
  dfs(s,0);
  cout << ret << endl;
  return 0;
}

Submission Info

Submission Time
Task B - Camphor Tree
User Tendaysago
Language C++14 (GCC 5.4.1)
Score 100
Code Size 869 Byte
Status AC
Exec Time 76 ms
Memory 1024 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 13
Set Name Test Cases
All 00_sample, 01_sample, 02_sample, max_01, max_02, max_03, max_04, max_05, max_06, max_07, max_08, max_09, min_00
Case Name Status Exec Time Memory
00_sample AC 2 ms 1024 KB
01_sample AC 1 ms 1024 KB
02_sample AC 2 ms 1024 KB
max_01 AC 76 ms 1024 KB
max_02 AC 2 ms 1024 KB
max_03 AC 2 ms 1024 KB
max_04 AC 2 ms 1024 KB
max_05 AC 2 ms 1024 KB
max_06 AC 2 ms 1024 KB
max_07 AC 2 ms 1024 KB
max_08 AC 2 ms 1024 KB
max_09 AC 2 ms 1024 KB
min_00 AC 2 ms 1024 KB