Submission #13078515

Source Code Expand

#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> 
//using namespace boost::multiprecision; 
using namespace std;
#define ll long long int
#define ld long long double
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define nl '\n'
#define mp make_pair
#define debug1(x) cout <<#x<<" "<<x<<'\n';
#define debug2(x,y) cout <<#x<<" "<<x <<" "<<#y<<" "<<y <<'\n';
#define debug3(x,y,z) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<" "<<#z<<" "<<z<<'\n';
#define fi first
#define se second
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define inf 1e18
const int mod = (int)1e9+7;
pair<ll,ll>s4[4]={{-1,0},{1,0},{0,-1},{0,1}};
pair<ll,ll>s8[8]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,1},{1,0},{1,-1}};

void solve() {
    ll n;
    ll k;
    cin >> n>> k;
    ll a[n];
    for(ll i=1;i<=n;i++) {
        cin >> a[i];
    }
    ll visit[n+1];
    memset(visit,0,sizeof(visit));
    
    ll i = a[1];
    vector<ll>v;
    while(true) {
        visit[i]++;
        if(visit[i]>2)
            break;
        v.push_back(i);
        ll x=a[i];
        i=x;
    }
    
    ll x = 0;ll y=0;
    ll idx=-1;
    for(ll i=0;i<(ll)v.size();i++) {
        if(visit[v[i]]==1 ) {
            x++;
            idx=i;
        }
        if(visit[v[i]] >= 2){
            y++;
        }
        
    }
   // cout << x << y;
   y/=2;
    cout << v[idx+(k-x+y)%y];
    
    
}

signed main() {
    boost;
    solve();
}

Submission Info

Submission Time
Task D - Teleporter
User code_dynamo
Language C++ (GCC 9.2.1)
Score 0
Code Size 1637 Byte
Status WA
Exec Time 37 ms
Memory 10528 KiB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 33
WA × 24
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 3 ms 3620 KiB
sample_02.txt AC 2 ms 3588 KiB
sub1_01.txt AC 3 ms 4036 KiB
sub1_02.txt AC 18 ms 5732 KiB
sub1_03.txt AC 5 ms 3920 KiB
sub1_04.txt AC 21 ms 6812 KiB
sub1_05.txt AC 23 ms 6716 KiB
sub1_06.txt WA 17 ms 5632 KiB
sub1_07.txt WA 15 ms 5508 KiB
sub1_08.txt WA 21 ms 6728 KiB
sub1_09.txt AC 21 ms 7072 KiB
sub1_10.txt AC 19 ms 6364 KiB
sub1_11.txt AC 14 ms 5072 KiB
sub1_12.txt AC 27 ms 6880 KiB
sub1_13.txt AC 23 ms 6840 KiB
sub1_14.txt AC 31 ms 8348 KiB
sub1_15.txt AC 17 ms 5728 KiB
sub1_16.txt AC 21 ms 6744 KiB
sub1_17.txt WA 18 ms 5688 KiB
sub1_18.txt WA 25 ms 6744 KiB
sub1_19.txt WA 8 ms 4368 KiB
sub1_20.txt WA 29 ms 8396 KiB
sub1_21.txt WA 19 ms 6172 KiB
sub1_22.txt AC 20 ms 6516 KiB
sub1_23.txt AC 16 ms 5568 KiB
sub1_24.txt AC 29 ms 9864 KiB
sub1_25.txt AC 27 ms 7720 KiB
sub1_26.txt AC 24 ms 6136 KiB
sub1_27.txt AC 22 ms 5940 KiB
sub1_28.txt WA 21 ms 7380 KiB
sub1_29.txt WA 14 ms 4656 KiB
sub1_30.txt WA 18 ms 5896 KiB
sub1_31.txt WA 4 ms 3924 KiB
sub1_32.txt AC 20 ms 5632 KiB
sub1_33.txt AC 11 ms 4492 KiB
sub1_34.txt AC 19 ms 5936 KiB
sub1_35.txt AC 4 ms 3812 KiB
sub1_36.txt AC 25 ms 7140 KiB
sub1_37.txt AC 25 ms 6740 KiB
sub1_38.txt WA 33 ms 8248 KiB
sub1_39.txt WA 21 ms 6676 KiB
sub1_40.txt WA 8 ms 4208 KiB
sub1_41.txt WA 37 ms 10448 KiB
sub1_42.txt AC 30 ms 8348 KiB
sub1_43.txt AC 32 ms 8456 KiB
sub1_44.txt AC 30 ms 8372 KiB
sub1_45.txt AC 34 ms 10368 KiB
sub1_46.txt AC 24 ms 6820 KiB
sub1_47.txt AC 24 ms 7272 KiB
sub1_48.txt WA 33 ms 10528 KiB
sub1_49.txt WA 27 ms 7220 KiB
sub1_50.txt WA 26 ms 6640 KiB
sub1_51.txt WA 21 ms 6504 KiB
sub1_52.txt WA 16 ms 5360 KiB
sub1_53.txt WA 9 ms 4652 KiB
sub1_54.txt WA 29 ms 8348 KiB
sub1_55.txt WA 25 ms 7372 KiB