Submission #1472971
Source Code Expand
// clang-format off #include <bits/stdc++.h> #define int long long #define main signed main() #define loop(i, a, n) for (int i = (a); i < (n); i++) #define rep(i, n) loop(i, 0, n) #define forever for (;;) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define prec(n) fixed << setprecision(n) template<typename A> using V = std::vector<A>; template<typename A> using F = std::function<A>; template<typename A, typename B> using P = std::pair<A, B>; using pii = P<int, int>; using vi = V<int>; using vd = V<double>; using vs = V<std::string>; using vpii = V<pii>; using vvi = V<vi>; using vvpii = V<vpii>; constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000; constexpr int MOD = 1000000007; constexpr double PI = acos(-1); template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; } template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &x : v) is >> x; return is; } using namespace std; // clang-format on int modstr(const std::string &s, const int &m) { int a = 0; for (auto &c : s) a = (c - '0' + a * 10) % m; return a; } main { int n, a; string _k; cin >> n >> a >> _k; --a; vi b(n); cin >> b; for (auto &x : b) x--; int t, c; { vi tmp(n); int i = 1, p = a; while (!tmp[p]) { tmp[p] = i++; p = b[p]; } t = tmp[p] - 1; c = i - t - 1; } int k; { string _t = to_string(t); if (_k.size() > _t.size() || (_k.size() == _t.size() && _k > _t)) { k = modstr(_k, c); } else { k = stoi(_k); } } if (k > t) { k %= c; while (k <= t) k += c; } int p = a; while (k--) p = b[p]; cout << p + 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - へんてこ辞書 |
User | AyaMorisawa |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1932 Byte |
Status | WA |
Exec Time | 31 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 | 25 ms | 1664 KB |
subtask0_1.txt | AC | 21 ms | 1408 KB |
subtask0_2.txt | WA | 24 ms | 1536 KB |
subtask0_3.txt | WA | 18 ms | 1152 KB |
subtask0_4.txt | WA | 26 ms | 1664 KB |
subtask0_5.txt | WA | 21 ms | 1280 KB |
subtask0_6.txt | WA | 18 ms | 1152 KB |
subtask0_7.txt | WA | 23 ms | 1536 KB |
subtask0_8.txt | WA | 18 ms | 1152 KB |
subtask0_9.txt | AC | 25 ms | 1536 KB |
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 22 ms | 1408 KB |
subtask1_1.txt | WA | 25 ms | 1664 KB |
subtask1_10.txt | WA | 31 ms | 1920 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_2.txt | WA | 20 ms | 1280 KB |
subtask1_3.txt | WA | 18 ms | 1152 KB |
subtask1_4.txt | WA | 20 ms | 1280 KB |
subtask1_5.txt | WA | 27 ms | 1664 KB |
subtask1_6.txt | WA | 20 ms | 1280 KB |
subtask1_7.txt | AC | 19 ms | 1280 KB |
subtask1_8.txt | WA | 30 ms | 1792 KB |
subtask1_9.txt | AC | 30 ms | 1920 KB |
subtask1_sample_02.txt | AC | 1 ms | 256 KB |