Submission #1130988
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
// etc
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
// 大きい整数のmod
int bigMod(std::string nStr, int mod) {
int n = nStr.size();
if (n <= 18) {
ll res = std::stoll(nStr);
return res % mod;
}
ll res = 0;
int p;
for (p = 0; p <= n - 9; p += 9) {
ll t = std::stoll(nStr.substr(p, 9));
res += t; res %= mod;
if (n - p >= 9) {
res *= 1000000000 % mod; res %= mod;
}
else {
for (int i = 0; i < n - p; ++i) {
res *= 10 % mod; res %= mod;
}
}
}
ll t = std::stoll(nStr.substr(p));
res += t; res %= mod;
return res;
} // mod : Floor(|nStr|/9) times
signed main() {
INIT;
VAR(int, n, a);
VAR(std::string, k);
VEC(int, b, n);
--a;
REP(i, n) --b[i];
if (k.size() <= 7) {
int kk = std::stoll(k);
int p = a;
REP(i, kk) p = b[p];
OUT(p + 1)BR;
return 0;
}
std::vector<int> depth(n, INFINT);
depth[a] = 0;
int p = a;
while (true) {
if (depth[p] > depth[b[p]]) break;
depth[b[p]] = depth[p] + 1;
p = b[p];
}
int s = depth[b[p]];
int r = depth[p] - s + 1;
int kk = bigMod(k, r);
//SHOWVECTOR(depth);
//SHOW(r);
//SHOW(kk);
kk = (kk - s + r) % r + s;
p = a;
REP(i, kk) p = b[p];
OUT(p + 1)BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - へんてこ辞書 |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
5939 Byte |
Status |
WA |
Exec Time |
10 ms |
Memory |
1920 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
0 / 50 |
0 / 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 |
WA |
8 ms |
1664 KB |
subtask0_1.txt |
AC |
7 ms |
1408 KB |
subtask0_2.txt |
AC |
8 ms |
1536 KB |
subtask0_3.txt |
AC |
6 ms |
1152 KB |
subtask0_4.txt |
WA |
8 ms |
1664 KB |
subtask0_5.txt |
WA |
7 ms |
1408 KB |
subtask0_6.txt |
AC |
6 ms |
1152 KB |
subtask0_7.txt |
WA |
8 ms |
1536 KB |
subtask0_8.txt |
WA |
6 ms |
1152 KB |
subtask0_9.txt |
AC |
8 ms |
1664 KB |
subtask0_sample_01.txt |
AC |
1 ms |
256 KB |
subtask0_sample_03.txt |
AC |
1 ms |
256 KB |
subtask1_0.txt |
WA |
7 ms |
1408 KB |
subtask1_1.txt |
WA |
8 ms |
1536 KB |
subtask1_10.txt |
WA |
10 ms |
1872 KB |
subtask1_11.txt |
AC |
1 ms |
256 KB |
subtask1_2.txt |
WA |
7 ms |
1280 KB |
subtask1_3.txt |
WA |
6 ms |
1152 KB |
subtask1_4.txt |
WA |
7 ms |
1280 KB |
subtask1_5.txt |
WA |
9 ms |
1664 KB |
subtask1_6.txt |
WA |
7 ms |
1360 KB |
subtask1_7.txt |
WA |
7 ms |
1280 KB |
subtask1_8.txt |
WA |
10 ms |
1920 KB |
subtask1_9.txt |
WA |
10 ms |
1920 KB |
subtask1_sample_02.txt |
AC |
1 ms |
256 KB |