Submission #13084981


Source Code Expand

#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define forn(i,n)for(ll i=0;i<(n);i++)
#define forn_rev(i,n)for(ll i=(n)-1;i>=0;i--)
#define for1n(i,n) for(ll i=1;i<=(n);i++)
#define ARRAY_SIZE(a) sizeof(a)/sizeof(*a)
#define MOD 1000000007
#define MAXN 1000005

using namespace std;

vector<ll> adj[MAXN],parent(MAXN,-1),d(MAXN,0);
bool visited[MAXN];
ll dfs(){
    stack<ll> st;
    visited[0]=1;
    st.push(0);
    d[0]=1;
    while(!st.empty()){
        ll u=st.top();
        st.pop();
        forn(v,adj[u].size()){
            if(!visited[adj[u][v]]){
                visited[adj[u][v]]=1;
                st.push(adj[u][v]);
                d[adj[u][v]]=d[u]+1;
            }
            else {
                return adj[u][v];
            }

        }


    }
    return 0;

}


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    memset(visited,0,sizeof visited);
    ll T=1;
    //cin>>T;
    while(T--)
    {
        ll N,K;
        cin>>N>>K;
        forn(i,N){
            ll u;
            cin>>u;
            adj[i].push_back(u-1);
        }
        ll start=dfs();
        ll cycle=1,cur=start;
        while(1){
            cur=adj[cur][0];
            if(cur==start && cycle>0){
                break;
            }
            else{
                cycle++;
            }
        }
        K-=d[start]-d[0];
        //cout<<cycle<<start<<endl;
        K%=cycle;
        cur=start;
        forn(i,K){
            cur=adj[cur][0];
        }
        cout<<cur+1;



    }



    return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User outerspace
Language C++ (GCC 9.2.1)
Score 0
Code Size 1688 Byte
Status WA
Exec Time 112 ms
Memory 49652 KiB

Compile Error

./Main.cpp: In function ‘long long int dfs()’:
./Main.cpp:5:30: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    5 | #define forn(i,n)for(ll i=0;i<(n);i++)
      |                              ^
./Main.cpp:24:9: note: in expansion of macro ‘forn’
   24 |         forn(v,adj[u].size()){
      |         ^~~~

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 49
WA × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt, sub1_25.txt, sub1_26.txt, sub1_27.txt, sub1_28.txt, sub1_29.txt, sub1_30.txt, sub1_31.txt, sub1_32.txt, sub1_33.txt, sub1_34.txt, sub1_35.txt, sub1_36.txt, sub1_37.txt, sub1_38.txt, sub1_39.txt, sub1_40.txt, sub1_41.txt, sub1_42.txt, sub1_43.txt, sub1_44.txt, sub1_45.txt, sub1_46.txt, sub1_47.txt, sub1_48.txt, sub1_49.txt, sub1_50.txt, sub1_51.txt, sub1_52.txt, sub1_53.txt, sub1_54.txt, sub1_55.txt
Case Name Status Exec Time Memory
sample_01.txt AC 30 ms 43072 KiB
sample_02.txt AC 36 ms 43088 KiB
sub1_01.txt AC 33 ms 43876 KiB
sub1_02.txt AC 43 ms 47196 KiB
sub1_03.txt AC 32 ms 43748 KiB
sub1_04.txt AC 52 ms 49256 KiB
sub1_05.txt AC 53 ms 49268 KiB
sub1_06.txt AC 50 ms 47408 KiB
sub1_07.txt AC 44 ms 47216 KiB
sub1_08.txt AC 55 ms 49652 KiB
sub1_09.txt AC 62 ms 46844 KiB
sub1_10.txt AC 49 ms 48856 KiB
sub1_11.txt AC 42 ms 45784 KiB
sub1_12.txt AC 55 ms 49340 KiB
sub1_13.txt AC 57 ms 49320 KiB
sub1_14.txt AC 84 ms 49328 KiB
sub1_15.txt AC 48 ms 47404 KiB
sub1_16.txt AC 59 ms 49340 KiB
sub1_17.txt AC 49 ms 47408 KiB
sub1_18.txt AC 52 ms 49216 KiB
sub1_19.txt AC 40 ms 44240 KiB
sub1_20.txt AC 81 ms 49332 KiB
sub1_21.txt WA 57 ms 47144 KiB
sub1_22.txt AC 56 ms 47668 KiB
sub1_23.txt AC 48 ms 45904 KiB
sub1_24.txt AC 91 ms 48280 KiB
sub1_25.txt AC 80 ms 47992 KiB
sub1_26.txt AC 57 ms 46760 KiB
sub1_27.txt AC 55 ms 46580 KiB
sub1_28.txt AC 60 ms 47476 KiB
sub1_29.txt AC 37 ms 44892 KiB
sub1_30.txt AC 51 ms 46432 KiB
sub1_31.txt WA 33 ms 43456 KiB
sub1_32.txt AC 44 ms 47200 KiB
sub1_33.txt AC 37 ms 44652 KiB
sub1_34.txt AC 58 ms 46628 KiB
sub1_35.txt AC 31 ms 43348 KiB
sub1_36.txt AC 64 ms 49064 KiB
sub1_37.txt AC 57 ms 48948 KiB
sub1_38.txt AC 93 ms 48888 KiB
sub1_39.txt AC 58 ms 48808 KiB
sub1_40.txt AC 34 ms 44140 KiB
sub1_41.txt WA 112 ms 49152 KiB
sub1_42.txt AC 88 ms 49216 KiB
sub1_43.txt AC 79 ms 49288 KiB
sub1_44.txt AC 89 ms 49216 KiB
sub1_45.txt AC 103 ms 49216 KiB
sub1_46.txt AC 53 ms 49156 KiB
sub1_47.txt AC 66 ms 49136 KiB
sub1_48.txt AC 110 ms 49184 KiB
sub1_49.txt AC 66 ms 49648 KiB
sub1_50.txt AC 56 ms 49292 KiB
sub1_51.txt WA 56 ms 48760 KiB
sub1_52.txt WA 41 ms 46364 KiB
sub1_53.txt WA 39 ms 44852 KiB
sub1_54.txt WA 77 ms 49652 KiB
sub1_55.txt WA 68 ms 49252 KiB