Submission #15585317


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,l,r) for(int (i)=(l);(i)<(r);(i)++)
#define ll long long
using namespace std;
void deb(){
    cout<<"a";
    exit(0);
}
int main(){
    ll n,k;
    cin>>n>>k;
    vector<int> a(n),vi(n,-1);
    rep(i,0,n){
        cin>>a[i];
        a[i]--;
    }
    
    int cur=0;ll cnt=0;
    while(1){
        if(vi[cur]!=-1||k==cnt)break;
        vi[cur]=cnt;
        cur=a[cur];
        cnt++;
    }
    if(k>cnt){
        k-=vi[cur];
        cnt-=vi[cur];
        k%=cnt;
        rep(i,0,k)cur=a[cur];
    }
    cout<<cur+1<<endl;
}

Submission Info

Submission Time
Task D - Teleporter
User komugi
Language C++ (GCC 9.2.1)
Score 400
Code Size 593 Byte
Status AC
Exec Time 59 ms
Memory 4832 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:2:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
    2 | #define rep(i,l,r) for(int (i)=(l);(i)<(r);(i)++)
      |                            ^
./Main.cpp:13:5: note: in expansion of macro ‘rep’
   13 |     rep(i,0,n){
      |     ^~~
./Main.cpp:2:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
    2 | #define rep(i,l,r) for(int (i)=(l);(i)<(r);(i)++)
      |                            ^
./Main.cpp:29:9: note: in expansion of macro ‘rep’
   29 |         rep(i,0,k)cur=a[cur];
      |         ^~~

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 57
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 8 ms 3548 KiB
sample_02.txt AC 2 ms 3364 KiB
sub1_01.txt AC 13 ms 3688 KiB
sub1_02.txt AC 39 ms 4244 KiB
sub1_03.txt AC 11 ms 3740 KiB
sub1_04.txt AC 56 ms 4744 KiB
sub1_05.txt AC 57 ms 4680 KiB
sub1_06.txt AC 45 ms 4060 KiB
sub1_07.txt AC 41 ms 4048 KiB
sub1_08.txt AC 53 ms 4624 KiB
sub1_09.txt AC 32 ms 4132 KiB
sub1_10.txt AC 47 ms 4464 KiB
sub1_11.txt AC 27 ms 3592 KiB
sub1_12.txt AC 57 ms 4620 KiB
sub1_13.txt AC 58 ms 4624 KiB
sub1_14.txt AC 56 ms 4768 KiB
sub1_15.txt AC 32 ms 4200 KiB
sub1_16.txt AC 55 ms 4620 KiB
sub1_17.txt AC 41 ms 4092 KiB
sub1_18.txt AC 59 ms 4772 KiB
sub1_19.txt AC 17 ms 3516 KiB
sub1_20.txt AC 58 ms 4644 KiB
sub1_21.txt AC 43 ms 4096 KiB
sub1_22.txt AC 46 ms 4204 KiB
sub1_23.txt AC 30 ms 3832 KiB
sub1_24.txt AC 43 ms 4468 KiB
sub1_25.txt AC 49 ms 4572 KiB
sub1_26.txt AC 40 ms 4072 KiB
sub1_27.txt AC 38 ms 3812 KiB
sub1_28.txt AC 44 ms 4196 KiB
sub1_29.txt AC 18 ms 3484 KiB
sub1_30.txt AC 32 ms 3932 KiB
sub1_31.txt AC 7 ms 3640 KiB
sub1_32.txt AC 41 ms 4248 KiB
sub1_33.txt AC 19 ms 3604 KiB
sub1_34.txt AC 40 ms 3808 KiB
sub1_35.txt AC 6 ms 3468 KiB
sub1_36.txt AC 52 ms 4620 KiB
sub1_37.txt AC 55 ms 4624 KiB
sub1_38.txt AC 55 ms 4832 KiB
sub1_39.txt AC 51 ms 4416 KiB
sub1_40.txt AC 15 ms 3376 KiB
sub1_41.txt AC 52 ms 4684 KiB
sub1_42.txt AC 56 ms 4728 KiB
sub1_43.txt AC 57 ms 4832 KiB
sub1_44.txt AC 54 ms 4584 KiB
sub1_45.txt AC 52 ms 4772 KiB
sub1_46.txt AC 57 ms 4588 KiB
sub1_47.txt AC 53 ms 4732 KiB
sub1_48.txt AC 59 ms 4828 KiB
sub1_49.txt AC 59 ms 4588 KiB
sub1_50.txt AC 57 ms 4728 KiB
sub1_51.txt AC 53 ms 4468 KiB
sub1_52.txt AC 36 ms 3868 KiB
sub1_53.txt AC 16 ms 3408 KiB
sub1_54.txt AC 51 ms 4604 KiB
sub1_55.txt AC 58 ms 4644 KiB