Submission #13059179

---

Source Code Expand

//BUGSBUNNY
//IIT ROORKEE
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define ld long double
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define vl vector<long long>
#define vpii vector<pii>
#define vpipii vector<pipii>
#define vb vector<bool>
#define pb push_back
#define pob pop_back
#define mp make_pair
#define pii pair<int,int>
#define pipii pair<int,pii>
#define piipi pair<pii,int>
#define pld pair<long double,long double>
#define mod 1000000007
// #define mod 163577857 
// #define mod 998244353
#define rep(i,n) for (int i = 0; i < n; i++)
#define repp(i,a,b) for(int i = a ; i<b ; i++)
#define reppr(i,a,b) for(int i = a-1 ; i>=b ; i--)
#define repr(i,n) for (int i = n - 1; i >= 0; i--)
#define ff first
#define ss second
#define pc putchar_unlocked
#define gc getchar_unlocked
#define inf 9223372036854775807
#define infn -9223372036854775807
#define pi 3.14159265358979323846
#define eps 0.0000000001
#define sp << " " <<
#define setprec(x) cout << fixed << setprecision(x);
#define REVERSE(a) reverse(all(a));
#define SORT(a) sort(all(a));
#define all(n) n.begin(),n.end()
 
//GCD and LCM
    int gcd (int a, int b) { return b ? gcd (b, a % b) : a; }
    int lcm (int a, int b) { return a / gcd(a, b) * b; }
 
//Modular Exponentiation
    int powmod(int x,int y) 
    { 
        if (y == 0) return 1; 
        int p = powmod(x, y/2) % mod; 
        p = (p * p) % mod;   
        return (y%2 == 0)? p : (x * p) % mod; 
    }
 
//Modular Inverse
    int inverse(int a) 
    { 
       return powmod(a,mod-2); 
    }


void solve();
signed main()
{
    //-------------------------------------------------------------------------------   
        ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        clock_t clk = clock();
    //-------------------------------------------------------------------------------   
    //-------------------------------------------------------------------------------
        int t = 1;
        // cin >> t;       
        rep(i,t)
        {
            // cout << "Case #" << i+1 << ": ";
            solve();
        }
    //-------------------------------------------------------------------------------
        clk = clock() - clk;
        cerr << fixed << setprecision(12) << "Time: " << ((double)clk)/CLOCKS_PER_SEC;
    //-------------------------------------------------------------------------------
}

  void solve()
  {
      int n , k;
      cin >> n >> k;
      int a[n];
      rep(i,n)
          cin >> a[i];
      vi npc , pc;
      set<int> s;
      s.insert(1);
      int curr = a[0];
      int t = 10;
      while(true)
      {
          if(s.find(curr)!=s.end())
              break;
          s.insert(curr);
          curr = a[curr-1];
      }
      int temp = a[0];
      bool ho = 0;
      if(curr==1)
          ho = 1;
      while(true)
      {
          if(ho==1 && temp==curr)
              break;
          if(temp==curr)
              ho = 1;
          if(ho==0)
              npc.pb(temp);
          else
              pc.pb(temp);
          temp = a[temp-1];
      }

  if(curr==1)
          pc.pb(1);
    if(npc.size() >= k)
      cout << npc[k-1];
    else
    {
      k-=npc.size();
      k--;
      k%=(pc.size());
      cout << pc[k];
    }
  }

// 6 2 5 3  

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:124:19: warning: comparison of integer expressions of different signedness: ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} and ‘long long int’ [-Wsign-compare]
  124 |     if(npc.size() >= k)
      |        ~~~~~~~~~~~^~~~
./Main.cpp:97:11: warning: unused variable ‘t’ [-Wunused-variable]
   97 |       int t = 10;
      |           ^

Judge Result