Submission #1731357
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define uni(x) x.erase(unique(all(x)),x.end())
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) > (b) ? (b) : (a))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
#define INF INT_MAX/3
#define MAX_N 1000
#define M_INF 1000000000
int n,m,v,i;
void solve(){
const int SIZE = 100001;
int N,a,b[SIZE];
string k;
cin>>N>>a>>k;
repl(i,1,N+1) cin>>b[i];
int s = a,cnt = 0,c[SIZE],d[SIZE];
bool visited[SIZE];
repl(i,1,N+1) visited[i] = false;
while(!visited[s]){
visited[s] = true;
d[s] = cnt;
c[cnt] = s;
s = b[s];
cnt++;
}
int p = d[s],q=cnt-p;
int l;
//ループの中に入る前にkが終了した場合
if(k.size() < 8 && (l = atoi(k.c_str()))<p){
cout<<c[l]<<endl;
} else {
int mod = 0;
rep(i,k.size()) mod = (mod*10 + (k[i] - '0')) % q;
//mod計算して整形したmodに対してp(%q)を引いて、あまり計算だから、0にならないように
//工夫されている
mod = (q + mod - p%q)%q;
cout<<c[mod+p]<<endl;
}
}
int main(){
solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
D - へんてこ辞書 |
User |
koki1018 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1763 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
1280 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
50 / 50 |
50 / 50 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_03.txt |
Subtask1 |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_03.txt |
All |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask1_sample_02.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_0.txt |
AC |
25 ms |
1024 KB |
subtask0_1.txt |
AC |
21 ms |
896 KB |
subtask0_2.txt |
AC |
24 ms |
1024 KB |
subtask0_3.txt |
AC |
18 ms |
768 KB |
subtask0_4.txt |
AC |
26 ms |
1024 KB |
subtask0_5.txt |
AC |
21 ms |
896 KB |
subtask0_6.txt |
AC |
18 ms |
768 KB |
subtask0_7.txt |
AC |
23 ms |
896 KB |
subtask0_8.txt |
AC |
18 ms |
768 KB |
subtask0_9.txt |
AC |
27 ms |
1024 KB |
subtask0_sample_01.txt |
AC |
1 ms |
256 KB |
subtask0_sample_03.txt |
AC |
1 ms |
256 KB |
subtask1_0.txt |
AC |
21 ms |
1024 KB |
subtask1_1.txt |
AC |
25 ms |
1152 KB |
subtask1_10.txt |
AC |
31 ms |
1280 KB |
subtask1_11.txt |
AC |
1 ms |
256 KB |
subtask1_2.txt |
AC |
20 ms |
896 KB |
subtask1_3.txt |
AC |
17 ms |
896 KB |
subtask1_4.txt |
AC |
20 ms |
896 KB |
subtask1_5.txt |
AC |
26 ms |
1152 KB |
subtask1_6.txt |
AC |
20 ms |
896 KB |
subtask1_7.txt |
AC |
19 ms |
896 KB |
subtask1_8.txt |
AC |
30 ms |
1152 KB |
subtask1_9.txt |
AC |
30 ms |
1280 KB |
subtask1_sample_02.txt |
AC |
1 ms |
256 KB |