Submission #1474461
Source Code Expand
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
class Union_find{
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a){
n = a;
for(int i = 0;i < n;i++){
par.push_back(i);
rank.push_back(0);
}
}
int find(int x){
if(par[x] == x){
return x;
}else{
return par[x] = find(par[x]);
}
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
class LazySegTree{
private:
int n;
vector<ll> node, lazy;
vector<bool> lazyFlag;
public:
LazySegTree(vector<ll> v){
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, 0);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1, false);
REP(i, sz) node[i+n-1] = v[i];
for(int i = n-2;i >= 0;i--) node[i] = node[2*i+1]+node[2*i+2];
}
void eval(int k, int l, int r){
if(lazyFlag[k]){
node[k] += lazy[k] * (r-l);
if(r-l > 1){
lazy[2*k+1] += lazy[k];
lazy[2*k+2] += lazy[k];
lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
}
lazy[k] = 0;
lazyFlag[k] = false;
}
}
void add(int a, int b, ll x, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] += x;
lazyFlag[k] = true;
eval(k, l, r);
}else{
add(a, b, x, k*2+1, l, (l+r)/2);
add(a, b, x, k*2+2, (l+r)/2, r);
node[k] = node[k*2+1] + node[k*2+2];
}
}
ll query(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return 0;
if(a <= l && r <= b) return node[k];
return query(a, b, k*2+1, l, (l+r)/2) + query(a, b, k*2+2, (l+r)/2, r);
}
};
class Bucket{
private:
int n, bs, bn;
vector<ll> data;
vector<ll> bucket, lazy;
vector<bool> lazyFlag;
public:
Bucket(vector<ll> v, int sz){
data = v;
n = v.size();
bs = sz;
bn = (n + bs - 1) / bs;
data.resize(bn*bs, INF_LL);
bucket.assign(bn, INF_LL);
lazy.assign(bn, 0);
lazyFlag.assign(bn, 0);
REP(i, bn){
ll minx = INF_LL;
REP(j, bs){
chmin(minx, data[i*bs+j]);
}
bucket[i] = minx;
}
}
void eval(int k){
if(lazyFlag[k]){
lazyFlag[k] = false;
FOR(i, bs*k, bs*(k+1)){
data[i] = lazy[k];
}
lazy[k] = 0;
}
}
void update(int s, int t, int x){
REP(k, bn){
int l = k*bs, r = (k+1)*bs;
if(r <= s || t <= l) continue;
if(s <= l && r <= t){
lazyFlag[k] = true;
bucket[k] = x;
lazy[k] = x;
}else{
eval(k);
FOR(i, max(s, l), min(t, r)){
data[i] = x;
}
bucket[k] = INF_LL;
FOR(i, l, r){
chmin(bucket[k], data[i]);
}
}
}
}
ll query(int s, int t){
ll res = INF_LL;
REP(k, bn){
int l = k*bs, r = (k+1)*bs;
if(r <= s || t <= l) continue;
if(s <= l && r <= t){
chmin(res, bucket[k]);
}else{
eval(k);
FOR(i, max(s, l), min(t, r)){
chmin(res, data[i]);
}
}
}
return res;
}
};
const ll mod = 1e9+7;
int main(void){
int N, a;
string k;
int b[114514];
int dis[114514] = {};
cin >> N >> a;
cin >> k;
REP(i, N){
cin >> b[i]; b[i]--;
dis[i] = -1;
}
if(k.size() < 7){
ll c = 0;
REP(i, k.size()){
c = c*10+(k[i]-'0');
}
int in = a-1;
REP(i, c){
in = b[in];
}
cout << in+1 << endl;
return 0;
}
int C, T;
int in = a-1;
dis[in] = 0;
while(dis[b[in]] == -1){
dis[b[in]] = dis[in]+1;
in = b[in];
}
C = dis[b[in]]; T = dis[in]-dis[b[in]]+1;
ll c = 0;
REP(i, k.size()){
c = (c*10+(k[i]-'0'))%T;
}
c = (c-C%T+T)%T;
in = b[in];
REP(i, c){
in = b[in];
}
cout << in+1 << endl;
}
Submission Info
Submission Time |
|
Task |
D - へんてこ辞書 |
User |
maze1230 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4521 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 |
1024 KB |
subtask0_2.txt |
AC |
23 ms |
1024 KB |
subtask0_3.txt |
AC |
18 ms |
896 KB |
subtask0_4.txt |
AC |
26 ms |
1024 KB |
subtask0_5.txt |
AC |
20 ms |
1024 KB |
subtask0_6.txt |
AC |
18 ms |
896 KB |
subtask0_7.txt |
AC |
23 ms |
1024 KB |
subtask0_8.txt |
AC |
18 ms |
896 KB |
subtask0_9.txt |
AC |
25 ms |
1024 KB |
subtask0_sample_01.txt |
AC |
1 ms |
640 KB |
subtask0_sample_03.txt |
AC |
1 ms |
640 KB |
subtask1_0.txt |
AC |
22 ms |
1152 KB |
subtask1_1.txt |
AC |
25 ms |
1152 KB |
subtask1_10.txt |
AC |
31 ms |
1280 KB |
subtask1_11.txt |
AC |
1 ms |
640 KB |
subtask1_2.txt |
AC |
20 ms |
1024 KB |
subtask1_3.txt |
AC |
18 ms |
1024 KB |
subtask1_4.txt |
AC |
20 ms |
1024 KB |
subtask1_5.txt |
AC |
27 ms |
1152 KB |
subtask1_6.txt |
AC |
20 ms |
1152 KB |
subtask1_7.txt |
AC |
19 ms |
1152 KB |
subtask1_8.txt |
AC |
30 ms |
1152 KB |
subtask1_9.txt |
AC |
30 ms |
1280 KB |
subtask1_sample_02.txt |
AC |
1 ms |
640 KB |