problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02684 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#defin... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#defin... | replace | 59 | 60 | 59 | 60 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll INF = 1000000009;
ll MOD = 1000000007;
ll a[20010];
void solve() {
ll n, k;
cin >> n >> k;
rep(i, n) {
cin >> a[i];
a[i]-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll INF = 1000000009;
ll MOD = 1000000007;
ll a[200100];
void solve() {
ll n, k;
cin >> n >> k;
rep(i, n) {
cin >> a[i];
a[i]... | replace | 9 | 10 | 9 | 10 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
#define DEBUG(x) cout << x << '\n'
int n, a[MAXN], vis[MAXN], pos[MAXN];
ll k;
int dfs(int u) {
if (~vis[a[u]])
return a[u];
vis[a[u]] = vis[u] + 1;
pos[vis[a[u]]] = a[u];
dfs(a[u]);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
#define DEBUG(x) cout << x << '\n'
int n, a[MAXN], vis[MAXN], pos[MAXN];
ll k;
int dfs(int u) {
if (~vis[a[u]])
return a[u];
vis[a[u]] = vis[u] + 1;
pos[vis[a[u]]] = a[u];
return dfs(a[... | replace | 14 | 15 | 14 | 15 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1001001001
using ll = long long;
using dd = long double;
const int D = 60;
const int MAX_N = 20005;
int to[D][MAX_N];
int main() {
int n;
ll k;
cin >> n >> k;
rep(i, n) {
cin >> to[0][i];
to[0][i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1001001001
using ll = long long;
using dd = long double;
const int D = 60;
const int MAX_N = 200005;
int to[D][MAX_N];
int main() {
int n;
ll k;
cin >> n >> k;
rep(i, n) {
cin >> to[0][i];
to[0][i... | replace | 8 | 9 | 8 | 9 | 0 | |
p02684 | C++ | Runtime Error | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 200005
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define rep(i, a, n) for (i = a; i < ... | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 200005
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define rep(i, a, n) for (i = a; i < ... | insert | 98 | 98 | 98 | 103 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> array(N + 1);
array[0] = 0;
vector<int> reach(N + 1);
vector<long> loop(0);
for (int i = 0; i < N; i++)
cin >> array[i + 1];
long place = 1;
long count = 0;
long mark = 0;
long j = 0;
while (re... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> array(N + 1);
array[0] = 0;
vector<int> reach(N + 1);
vector<long> loop(0);
for (int i = 0; i < N; i++)
cin >> array[i + 1];
long place = 1;
long count = 0;
long mark = 0;
long j = 0;
while (re... | insert | 27 | 27 | 27 | 31 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i]--;
}
long now = 0;
vector<int> v(N);
while (K > 0) {
now = a[now];
K--;
// cout<<now+1<<endl;
if (v[now] == 1) {
v[now]+... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i]--;
}
long now = 0;
vector<int> v(N);
while (K > 0) {
now = a[now];
K--;
// cout<<now+1<<endl;
if (v[now] == 1) {
v[now]+... | replace | 39 | 40 | 39 | 41 | 0 | |
p02684 | C++ | Runtime Error | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02684 | C++ | Runtime Error | /*
AtCoderBeginnerContest167
Problem D - Teleporter /
Time Limit: 2 sec / Memory Limit: 1024 MB
Score:
400
points
*/
#include <iostream>
#include <vector>
int main() {
int N;
long K;
std::vector<int> A;
A.push_back(0);
std::cin >> N >> K;
for (int i = 0; i < N; i++) {
int currA;
std::cin >> currA;... | /*
AtCoderBeginnerContest167
Problem D - Teleporter /
Time Limit: 2 sec / Memory Limit: 1024 MB
Score:
400
points
*/
#include <iostream>
#include <vector>
int main() {
int N;
long K;
std::vector<int> A;
A.push_back(0);
std::cin >> N >> K;
for (int i = 0; i < N; i++) {
int currA;
std::cin >> currA;... | replace | 35 | 36 | 35 | 36 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
// #include <stack>
// #include <queue>
// #include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
// #include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
// #include <stack>
// #include <queue>
// #include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
// #include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 178 | 179 | 178 | 179 | 0 | |
p02684 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int N, i, j, x, y, MOD, A[200000] = {0}, check[200000] = {},
move[200000] = {0};
long long K;
x = scanf("%d %lld", &N, &K);
for (i = 0; i < N; i++)
x = scanf("%d", &A[i]), check[i] = -1;
for (i = 0, j = 0;; i = A[i] - 1, j++)
if (check[i] <... | #include <stdio.h>
int main(void) {
int N, i, j, x, y, MOD, A[200000] = {0}, check[200000] = {},
move[200000] = {0};
long long K;
x = scanf("%d %lld", &N, &K);
for (i = 0; i < N; i++)
x = scanf("%d", &A[i]), check[i] = -1;
for (i = 0, j = 0;; i = A[i] - 1, j++)
if (check[i] <... | replace | 12 | 13 | 12 | 13 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | insert | 68 | 68 | 68 | 69 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> k;
vector<ll> A(n);
for (auto &x : A) {
cin >> x;
}
ll cnt = 0, now = 0;
vector<ll> used(n, -1);
used[0] = 0;
for (i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> k;
vector<ll> A(n);
for (auto &x : A) {
cin >> x;
}
ll cnt = 0, now = 0;
vector<ll> used(n, -1);
used[0] = 0;
for (i = 0; i < n; i+... | insert | 24 | 24 | 24 | 28 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, ... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, ... | insert | 32 | 32 | 32 | 36 | 0 | |
p02684 | C++ | Runtime Error | // cand <genesis?>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const ll base = 7;
const ll N = 1e5 + 9;
const ll inf = 1000100009;
typedef pair<ll, ll> LL;
ll n, k, a[N], i, chk[N];
vector<ll> pos;
ll getpos(ll x) {
for (ll i = 0; i < pos.size(); i++)
if (pos[i] == x... | // cand <genesis?>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const ll base = 7;
const ll N = 3e5 + 9;
const ll inf = 1000100009;
typedef pair<ll, ll> LL;
ll n, k, a[N], i, chk[N];
vector<ll> pos;
ll getpos(ll x) {
for (ll i = 0; i < pos.size(); i++)
if (pos[i] == x... | replace | 6 | 7 | 6 | 7 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N, K, x, d1 = -1, d2 = -1;
set<int> s;
s.insert(0);
cin >> N >> K;
vector<int> A(N), t(N, 0);
rep(i, N) cin >> A.at(i);
rep(i, N - 1) {
t.at(i + 1) = A.at(t.at(i)) - ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N, x, d1 = -1, d2 = -1;
ll K;
set<int> s;
s.insert(0);
cin >> N >> K;
vector<int> A(N), t(N, 0);
rep(i, N) cin >> A.at(i);
rep(i, N - 1) {
t.at(i + 1) = A.at(t.at(i... | replace | 6 | 7 | 6 | 8 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main(void) {
int N;
long long K;
int a;
cin >> N >> K;
Graph G(N);
for (int i = 0; i < N; i++) {
cin >> a;
G[i].push_back(a);
}
vector<int> seen;
vector<int> ord(N + 1, -1);
int now = 1;
int l = 0;
i... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main(void) {
int N;
long long K;
int a;
cin >> N >> K;
Graph G(N);
for (int i = 0; i < N; i++) {
cin >> a;
G[i].push_back(a);
}
vector<int> seen;
vector<int> ord(N + 1, -1);
int now = 1;
int l = 0;
i... | replace | 28 | 29 | 28 | 29 | -11 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | replace | 61 | 62 | 61 | 66 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int p;
cin >> p;
vector<int> a(n), t(n, -1);
for (int i = 0; i < n; i++) {
cin >> a[i];
--a[i];
}
int start = 0;
int m_time = 0;
t[start] = m_time++;
int cycle_length = 0;
vector<pair<int, int>> cycle... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int p;
cin >> p;
vector<int> a(n), t(n, -1);
for (int i = 0; i < n; i++) {
cin >> a[i];
--a[i];
}
int start = 0;
int m_time = 0;
t[start] = m_time++;
int cycle_length = 0;
vector<pair<int, int>> cycle... | insert | 32 | 32 | 32 | 36 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const mint a) {
if ((x += a.x)... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const mint a) {
if ((x += a.x)... | replace | 40 | 43 | 40 | 43 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#define ll long long
#define N 10000
#define mod 1000000007
#define LL 100
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll num[n + 1];
for (int i = 1; i <= n; i++)
cin >> num[i];
map<ll, ll> d... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#define ll long long
#define N 10000
#define mod 1000000007
#define LL 100
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll num[n + 1];
for (int i = 1; i <= n; i++)
cin >> num[i];
map<ll, ll> d... | replace | 39 | 45 | 39 | 52 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | replace | 36 | 37 | 36 | 37 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i ... | insert | 89 | 89 | 89 | 93 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
long long K;
cin >> N >> K;
int A[N];
rep(i, N) cin >> A[i];
//
int m[N + 1];
rep(i, N) m[i + 1] = A[i];
pair<int, bool> visit[N + 1];
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
long long K;
cin >> N >> K;
int A[N];
rep(i, N) cin >> A[i];
//
int m[N + 1];
rep(i, N) m[i + 1] = A[i];
pair<int, bool> visit[N + 1];
... | replace | 23 | 25 | 23 | 25 | 0 | |
p02684 | C++ | Runtime Error | // https://atcoder.jp/contests/abc167/tasks/abc167_d
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#includ... | // https://atcoder.jp/contests/abc167/tasks/abc167_d
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#includ... | replace | 308 | 309 | 308 | 309 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long N, K;
vector<long> A, visited;
int main(void) {
cin >> N >> K;
A.resize(N);
visited.resize(N, false);
for (long i = 1; i <= N; i++)
cin >> A[i];
long x = 1;
long s = 0, t = 0;
while (!visited[x]) {
visited[x] = true;
x = A[x];
s++;
}... | #include <bits/stdc++.h>
using namespace std;
long N, K;
vector<long> A, visited;
int main(void) {
cin >> N >> K;
A.resize(N + 1);
visited.resize(N + 1, false);
for (long i = 1; i <= N; i++)
cin >> A[i];
long x = 1;
long s = 0, t = 0;
while (!visited[x]) {
visited[x] = true;
x = A[x];
... | replace | 9 | 11 | 9 | 11 | TLE | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02684 | C++ | Runtime Error | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | replace | 59 | 61 | 59 | 65 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
long n, k;
cin >> n >> k;
vector<long> l(n);
vec... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
long n, k;
cin >> n >> k;
vector<long> l(n);
vec... | replace | 24 | 26 | 24 | 26 | 0 | |
p02684 | C++ | Runtime Error | // #include<bits/stdc++.h>
// using namespace std;
// const int N = 10000, MAXI = 10000;
// int main() {
// freopen("output.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
// srand(time(nullptr));
// int tc = 10;
// cout << tc << "\n";
// while (tc--)
// {
// int n = rand(... | // #include<bits/stdc++.h>
// using namespace std;
// const int N = 10000, MAXI = 10000;
// int main() {
// freopen("output.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
// srand(time(nullptr));
// int tc = 10;
// cout << tc << "\n";
// while (tc--)
// {
// int n = rand(... | replace | 35 | 36 | 35 | 36 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t, i, j, temp1, temp2, x, y, z, sum = 0, o, n, m, k, d;
cin >> n >> k;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> pat... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t, i, j, temp1, temp2, x, y, z, sum = 0, o, n, m, k, d;
cin >> n >> k;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> pat... | replace | 31 | 33 | 31 | 37 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define dd double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vll vector<long long>
#define vdd vector<double>
#define vpii vector<pair<int, int>>
#define vpll v... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define dd double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vll vector<long long>
#define vdd vector<double>
#define vpii vector<pair<int, int>>
#define vpll v... | replace | 71 | 72 | 71 | 72 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02684 | C++ | Runtime Error | #include <assert.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long int n, k;
cin >> n >> k;
vector<int> a(n + 1, -1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int now = 1;
// naive
if (k <= 20000... | #include <assert.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long long int n, k;
cin >> n >> k;
vector<int> a(n + 1, -1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int now = 1;
// naive
if (k <= 20000... | replace | 28 | 29 | 28 | 29 | 0 | |
p02684 | C++ | Runtime Error | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define SORT(v, n) std::sort(v, v + n);
#define VSORT(v) std::sort(v.begin(), v.end());
... | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define SORT(v, n) std::sort(v, v + n);
#define VSORT(v) std::sort(v.begin(), v.end());
... | insert | 30 | 30 | 30 | 31 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int N;
ll K;
cin >> N >> K;
vector<int> A(N + 1);
for (int i = 0; i < N; i++)
cin >> A[i + 1];
vector<ll> arrive(N + 1, -1);
int cur = 1;
ll t = 0;
while (K > 0) {
if (arrive[cur] != -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int N;
ll K;
cin >> N >> K;
vector<int> A(N + 1);
for (int i = 0; i < N; i++)
cin >> A[i + 1];
vector<ll> arrive(N + 1, -1);
int cur = 1;
ll t = 0;
while (K > 0) {
if (arrive[cur] != -... | replace | 18 | 20 | 18 | 20 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define tie() \
ios_base ::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define tie() \
ios_base ::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int lon... | replace | 10 | 11 | 10 | 11 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<int> town(N);
for (int i = 0; i < N; i++) {
cin >> town.at(i);
town.at(i) = town.at(i) - 1;
}
int now = 0;
vector<int> count(N, 0);
long long roop_town, rest;
bool flag =... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<int> town(N);
for (int i = 0; i < N; i++) {
cin >> town.at(i);
town.at(i) = town.at(i) - 1;
}
int now = 0;
vector<int> count(N, 0);
long long roop_town, rest;
bool flag =... | replace | 22 | 23 | 22 | 23 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, t;
long long int k;
int A[100001];
map<int, bool> visited;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
vector<int> vec;
int now = 1;
while (1) {
if (visited[now]... | #include <bits/stdc++.h>
using namespace std;
int n, t;
long long int k;
int A[200001];
map<int, bool> visited;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
vector<int> vec;
int now = 1;
while (1) {
if (visited[now]... | replace | 7 | 8 | 7 | 8 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repit(it, li) for (auto it = li.begin(); it != li.end(); it++)
#define ll long long int
int main() {
int n;
ll k;
cin >> n >> k;
int a[200000];
rep(i, n) cin >> a[i], a[i]--;
map<int, int> reached;
int c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repit(it, li) for (auto it = li.begin(); it != li.end(); it++)
#define ll long long int
int main() {
int n;
ll k;
cin >> n >> k;
int a[200000];
rep(i, n) cin >> a[i], a[i]--;
map<int, int> reached;
int c... | replace | 17 | 18 | 17 | 18 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define pb push_back
#define si second
#define int long long int
using namespace std;
int a[100005], s, vis[100005];
vector<int> v, u;
void dfs(int v) {
if (vis[v]) {
s = v;
return;
}
vis[v] = 1;
dfs(a[v]);
}
void dfs1(int v) {
if (... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define pb push_back
#define si second
#define int long long int
using namespace std;
int a[200005], s, vis[200005];
vector<int> v, u;
void dfs(int v) {
if (vis[v]) {
s = v;
return;
}
vis[v] = 1;
dfs(a[v]);
}
void dfs1(int v) {
if (... | replace | 7 | 8 | 7 | 8 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INCANT \
cin.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INCANT \
cin.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define a... | replace | 46 | 48 | 46 | 48 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o << 1)
#define rs (o << 1 | 1)
#define pb push_back
const double PI = acos(-1.0);
const int M = 2e5 + 7;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y){ee[++cn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o << 1)
#define rs (o << 1 | 1)
#define pb push_back
const double PI = acos(-1.0);
const int M = 2e5 + 7;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y){ee[++cn... | insert | 47 | 47 | 47 | 48 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
A.at(i)--;
}
vector<int> B;
int index = 0;
int count = 0;
set<int> gone;
gone.insert(0);
long long right = 0, left = 0;
while (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
A.at(i)--;
}
vector<int> B;
int index = 0;
int count = 0;
set<int> gone;
gone.insert(0);
long long right = 0, left = 0;
while (... | replace | 53 | 54 | 53 | 57 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> as(n);
rep(i, n) { cin >> as[i]; }
vector<int> s;
vector<int> ord(n + 1, -1);
int c = 1, l = 0;
int v = 1;
while (ord[v] !=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> as(n);
rep(i, n) { cin >> as[i]; }
vector<int> s;
vector<int> ord(n + 1, -1);
int c = 1, l = 0;
int v = 1;
while (ord[v] ==... | replace | 17 | 18 | 17 | 18 | -11 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | replace | 436 | 475 | 436 | 461 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v)... | replace | 40 | 41 | 40 | 41 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | replace | 59 | 61 | 59 | 62 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma warning(disable : 4996)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
u... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma warning(disable : 4996)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
u... | replace | 32 | 33 | 32 | 33 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main() {
int n;
lint k;
scanf("%d%lld", &n, &k);
vector<int> to(n);
rep(u, n) scanf("%d", &to[u]), to[u]--;
static int dbl[60][100000];
rep(u, n) dbl[0][u] = to[u];
rep(t, 59) re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main() {
int n;
lint k;
scanf("%d%lld", &n, &k);
vector<int> to(n);
rep(u, n) scanf("%d", &to[u]), to[u]--;
static int dbl[60][200000];
rep(u, n) dbl[0][u] = to[u];
rep(t, 59) re... | replace | 14 | 15 | 14 | 15 | 0 | |
p02684 | C++ | Runtime Error | #include <array>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
long int k;
std::array<int, 200000> next_town;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int next;
cin >> next;
next_town[i] = next - 1;
}
int current_index = 0;
std::ma... | #include <array>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
long int k;
std::array<int, 200000> next_town;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int next;
cin >> next;
next_town[i] = next - 1;
}
int current_index = 0;
std::ma... | replace | 29 | 31 | 29 | 31 | 0 | |
p02684 | C++ | Runtime Error | /*
Date:2020.5.10
Name:Aliemo
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define MAXN 1010
#define inf 1e18
using namespace std;
inline int read(int &T) {
int s = 0, f = 0;
char ch ... | /*
Date:2020.5.10
Name:Aliemo
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define MAXN 200010
#define inf 1e18
using namespace std;
inline int read(int &T) {
int s = 0, f = 0;
char c... | replace | 14 | 15 | 14 | 15 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> p... | insert | 110 | 110 | 110 | 114 | 0 | |
p02684 | C++ | Runtime Error | /*
AUTHOR: Aman Raj
LANG: C++
*/
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.... | /*
AUTHOR: Aman Raj
LANG: C++
*/
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.... | replace | 75 | 76 | 75 | 79 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long k;
int x;
scanf("%d %lld", &n, &k);
vector<int> next(n);
for (int i = 0; i < n; ++i) {
scanf("%... | #include <algorithm>
#include <functional>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long k;
int x;
scanf("%d %lld", &n, &k);
vector<int> next(n);
for (int i = 0; i < n; ++i) {
scanf("%... | insert | 43 | 43 | 43 | 44 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD_NUMBER 1000000007
// ベクトル要素の列挙
template <class T> void vector_print(vector<T> vec) {
for (unsigned int i = 0; i < vec.size(); i++) {
cout << vec.at(i);
if (i < vec.size() - 1) {
cout << " ";
} else if (i == vec.size(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD_NUMBER 1000000007
// ベクトル要素の列挙
template <class T> void vector_print(vector<T> vec) {
for (unsigned int i = 0; i < vec.size(); i++) {
cout << vec.at(i);
if (i < vec.size() - 1) {
cout << " ";
} else if (i == vec.size(... | replace | 59 | 60 | 59 | 60 | 0 | |
p02684 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int N = 2e5 + 1;
long long k;
int n, a[N];
bool avail[N];
vector<int> V;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
V.push_back(0);
int start = 1;
bool run = false;
while (avail[a[start]] == false) {
start =... | #include <iostream>
#include <vector>
using namespace std;
const int N = 2e5 + 1;
long long k;
int n, a[N];
bool avail[N];
vector<int> V;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
V.push_back(0);
int start = 1;
bool run = false;
while (avail[a[start]] == false) {
start =... | replace | 24 | 25 | 24 | 25 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9 + 7)
#define nax (ll)(1e5)
#define INFL LLONG_MAX
#define INF INT_MAX
#define disp(a, n, arr) \
for (i... | #include <bits/stdc++.h>
#include <string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9 + 7)
#define nax (ll)(1e5)
#define INFL LLONG_MAX
#define INF INT_MAX
#define disp(a, n, arr) \
for (i... | insert | 63 | 63 | 63 | 67 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | replace | 34 | 35 | 34 | 36 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define all(v) v.begin(), v.end()
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define all(v) v.begin(), v.end()
#de... | replace | 125 | 128 | 125 | 136 | 0 | Time elapsed : 0.000126
|
p02684 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define re... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define re... | replace | 94 | 95 | 94 | 97 | TLE | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long int
#define ull unsigned long long int
#define I_read() freopen("input.tex", "r", stdin);
#define O_write() freopen("output.txt", "w", stdout);
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// I_read();
// O_write();
ll a... | #include <bits/stdc++.h>
using namespace std;
#define ll long int
#define ull unsigned long long int
#define I_read() freopen("input.tex", "r", stdin);
#define O_write() freopen("output.txt", "w", stdout);
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// I_read();
// O_write();
ll a... | replace | 20 | 21 | 20 | 21 | TLE | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
static const int MAX = 200005;
int N;
ll K;
int A[MAX], B[MAX], C[MAX];... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
static const int MAX = 200005;
int N;
ll K;
int A[MAX], B[MAX], C[MAX];... | replace | 43 | 44 | 43 | 44 | 0 | |
p02684 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int a[200005];
vector<int> path;
long long ind[200005] = {};
bool check_cycle(int cur_index) {
if (ind[cur_index])
return true;
return false;
}
int main() {
long long n, k;
cin >> n >> k;
for (int i = 1; i <=... | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int a[200005];
vector<int> path;
long long ind[200005] = {};
bool check_cycle(int cur_index) {
if (ind[cur_index])
return true;
return false;
}
int main() {
long long n, k;
cin >> n >> k;
for (int i = 1; i <=... | replace | 30 | 32 | 30 | 32 | 0 | |
p02684 | C++ | Runtime Error | #include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int next[70][200008];
int main() {
int N;
ll K;
scanf("%d%lld", &N, &K);
rep(i, N) {
scanf("%d", &next[0][i]);
next[0][i]--;
}
rep(j, 70) {
rep(i, N) { next[j + 1][i] = next[j][next[j][i]]; }
}
int cur ... | #include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int next[70][200008];
int main() {
int N;
ll K;
scanf("%d%lld", &N, &K);
rep(i, N) {
scanf("%d", &next[0][i]);
next[0][i]--;
}
rep(j, 69) {
rep(i, N) { next[j + 1][i] = next[j][next[j][i]]; }
}
int cur ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long LL;
int T[200001];
bool vis[200001];
int ans, mulai, selesai;
vector<int> d;
LL K;
void dfs(int nod) {
vis[nod] = 1;
d.pb(nod);
if (K == 0) {
ans = nod;
return;
}
if (!vis[T[nod]])
K--, dfs(T[nod]);
else {
... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long LL;
int T[200001];
bool vis[200001];
int ans, mulai, selesai;
vector<int> d;
LL K;
void dfs(int nod) {
vis[nod] = 1;
d.pb(nod);
if (K == 0) {
ans = nod;
return;
}
if (!vis[T[nod]])
K--, dfs(T[nod]);
else {
... | replace | 39 | 40 | 39 | 40 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> Vec;
typedef vector<pair<ll, ll>>... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> Vec;
typedef vector<pair<ll, ll>>... | replace | 48 | 50 | 48 | 52 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | replace | 94 | 95 | 94 | 100 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int n;
long long k, cnt, cnt_loop;
cin >> n >> k;
int a[n], label[n];
int pre, tmp;
vector<bool> visit(n, false);
vector<int> ans;
rep(i, n) {
cin >> a[i];
a[i]--;
}
queue<int>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int n;
long long k, cnt, cnt_loop;
cin >> n >> k;
int a[n], label[n];
int pre, tmp;
vector<bool> visit(n, false);
vector<int> ans;
rep(i, n) {
cin >> a[i];
a[i]--;
}
queue<int>... | insert | 31 | 31 | 31 | 35 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pa... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pa... | replace | 21 | 22 | 21 | 22 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | insert | 54 | 54 | 54 | 58 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define in(n) cin >> (n)
#define out(ans) cout << (ans) << endl;
#define keta(n) cout << fixed << setprecision((n));
using ll = int64_t;
using v = vector<int>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> tolist(N);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define in(n) cin >> (n)
#define out(ans) cout << (ans) << endl;
#define keta(n) cout << fixed << setprecision((n));
using ll = int64_t;
using v = vector<int>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> tolist(N);... | insert | 32 | 32 | 32 | 33 | TLE | |
p02684 | C++ | Runtime Error | // JAI SHREE RAM
#pragma GCC optimize("O3")
typedef long long int ll;
typedef unsigned long long int ull;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FOR(i, n) for (int i = 0; i... | // JAI SHREE RAM
#pragma GCC optimize("O3")
typedef long long int ll;
typedef unsigned long long int ull;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FOR(i, n) for (int i = 0; i... | replace | 48 | 49 | 48 | 49 | -11 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, pos = 0;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, pos = 0;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin ... | replace | 28 | 29 | 28 | 30 | 0 | |
p02684 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | replace | 46 | 48 | 46 | 48 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | replace | 28 | 29 | 28 | 29 | 0 | |
p02684 | C++ | Time Limit Exceeded | // i_m_arin
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef priority_queue<ll> pqll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef map<ll, ll> mpll;
typedef set<l... | // i_m_arin
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef priority_queue<ll> pqll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef map<ll, ll> mpll;
typedef set<l... | replace | 105 | 106 | 105 | 106 | TLE | |
p02684 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <casse... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <casse... | replace | 81 | 83 | 81 | 83 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 1);
for (int i = 1; i <= N; i++)
cin >> A[i];
vector<int> tp(N + 1);
tp[0] = 1;
vector<int> visited(N + 1, -1);
visited[1] = 0;
ll cycle = 0;
ll first = 0;
for (ll i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 1);
for (int i = 1; i <= N; i++)
cin >> A[i];
vector<int> tp(N + 1);
tp[0] = 1;
vector<int> visited(N + 1, -1);
visited[1] = 0;
ll cycle = 0;
ll first = 0;
for (ll i = ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02684 | C++ | Runtime Error | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | replace | 28 | 30 | 28 | 30 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll K;
vector<bool> visited;
vector<int> dic;
vector<int> A;
int dfs(int cur) {
K--;
if (visited[cur])
return cur;
if (K == 0)
return cur;
visited[cur] = true;
dic.push_back(cur);
dfs(A[cur]);
}
int main() {
cin >> N >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll K;
vector<bool> visited;
vector<int> dic;
vector<int> A;
int dfs(int cur) {
K--;
if (visited[cur])
return cur;
if (K == 0)
return cur;
visited[cur] = true;
dic.push_back(cur);
return dfs(A[cur]);
}
int main() {
cin >... | replace | 19 | 20 | 19 | 20 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int nm = 1e5;
int n, a, b[nm], s[nm], t, c, r;
string k;
int main() {
cin >> n >> k;
a = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
b[i]--;
}
if (k.size() <= 6) {
int kInt = stoi(k);
for (int i = 0; i < kInt; i++)
a = b[a];
cou... | #include <bits/stdc++.h>
using namespace std;
const int nm = 3e5;
int n, a, b[nm], s[nm], t, c, r;
string k;
int main() {
cin >> n >> k;
a = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
b[i]--;
}
if (k.size() <= 6) {
int kInt = stoi(k);
for (int i = 0; i < kInt; i++)
a = b[a];
cou... | replace | 3 | 4 | 3 | 4 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 241 | 242 | 241 | 242 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
ll n, k;
cin >> n >> k;
vector<int> v(n + 5), vis(n + 5, -1);
for (int i = 1; i <= n; i++)
cin >> v[i];
int i, ans = 1, cl = 0;
vis[1] = 0;
for (i = 1; i <= k; i++) {
ans = v[ans];
if (vis[ans] != -1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
ll n, k;
cin >> n >> k;
vector<int> v(n + 5), vis(n + 5, -1);
for (int i = 1; i <= n; i++)
cin >> v[i];
int i, ans = 1, cl = 0;
vis[1] = 0;
for (i = 1; i <= k; i++) {
ans = v[ans];
if (vis[ans] != -1) {
... | replace | 24 | 27 | 24 | 29 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int D = 110;
const int N = 2000000;
int to[D][N];
int main() {
int n;
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> to[0][i];
}
rep(i, D) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int D = 110;
const int N = 2000000;
int to[D][N];
int main() {
int n;
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> to[0][i];
}
rep(i, D - 1) {
for (int j = 1;... | replace | 15 | 16 | 15 | 16 | -11 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int to[110000];
bool reached[110000];
int cnt[110000];
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int to[220000];
bool reached[220000];
int cnt[220000];
int... | replace | 11 | 14 | 11 | 14 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const int N = 1e5 + 5;
ll n, k, a[N];
bool visited[N];... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const int N = 2e5 + 5;
ll n, k, a[N];
bool visited[N];... | replace | 12 | 13 | 12 | 13 | 0 | |
p02684 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
int n = 0;
long long k = 0;
cin >> n >> k;
vector<int> p(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
vector<int> used(n + 2, -1);
used[0] = 0;
in... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
int n = 0;
long long k = 0;
cin >> n >> k;
vector<int> p(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
vector<int> used(n + 2, -1);
used[0] = 0;
in... | replace | 29 | 30 | 29 | 31 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long dp[60][200005];
int main() {
long long n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> dp[0][i];
dp[0][i]--;
}
for (int i = 0; i < 60; i++) {
for (int j = 0; j < n; j++) {
dp[i + 1][j] = dp[i][dp[i][j]];
}
}
long long ... | #include <bits/stdc++.h>
using namespace std;
long long dp[60][200005];
int main() {
long long n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> dp[0][i];
dp[0][i]--;
}
for (int i = 0; i < 59; i++) {
for (int j = 0; j < n; j++) {
dp[i + 1][j] = dp[i][dp[i][j]];
}
}
long long ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02684 | Python | Runtime Error | n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
START = 1
# 訪れたタイミング
town_with_i = {START: 0}
# 現在地
current = START
# 既に訪れたことある街(巡回の判定に使う)
known_towns = set([START])
i = 0
for _ in range(k):
i += 1
# 現在地
current = a_list[current - 1]
# 既に来たことがあるということは巡回している
if curre... | n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
START = 1
# 訪れたタイミング
town_with_i = {START: 0}
# 現在地
current = START
# 既に訪れたことある街(巡回の判定に使う)
known_towns = set([START])
i = 0
for _ in range(k):
i += 1
# 現在地
current = a_list[current - 1]
# 既に来たことがあるということは巡回している
if curre... | replace | 34 | 35 | 34 | 35 | 0 | |
p02684 | Python | Runtime Error | n, k = map(int, input().split())
a = list(map(int, input().split()))
rec = [0]
i = 0
flag = [0 for _ in range(n + 1)]
while True:
if flag[rec[i]] == 0:
flag[rec[i]] = 1
rec.append(a[rec[i]] - 1)
else:
start = rec.index(a[rec[i]] - 1)
loop = rec[start:]
pre = rec[:start]
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
rec = [0]
i = 0
flag = [0 for _ in range(n + 1)]
while True:
if flag[rec[i]] == 0:
flag[rec[i]] = 1
rec.append(a[rec[i]] - 1)
else:
start = rec.index(a[rec[i]] - 1)
loop = rec[start:]
pre = rec[:start]
... | replace | 16 | 18 | 16 | 18 | 0 | |
p02684 | Python | Time Limit Exceeded | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
dp = np.zeros((k.bit_length() + 1, n + 1), dtype=int)... | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
dp = np.zeros((k.bit_length() + 1, n + 1), dtype=int)... | replace | 21 | 23 | 21 | 23 | TLE | |
p02684 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, k = map(int, input().split())
A = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for idx, a in enumerate(A):
tree[idx].append(a - 1)
start = []
depth = [0 for _ in range(n)]... | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, k = map(int, input().split())
A = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for idx, a in enumerate(A):
tree[idx].append(a - 1)
start = []
depth = [0 for _ in range(n)]... | delete | 21 | 24 | 21 | 21 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000009
#define ll long long
using namespace std;
long long int n, num, a[20005], vis[20005];
int main() {
scanf("%lld%lld", &n, &num);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]), vis[i] = 0;
long long int pos1 = 1, pos2;
while (vis[pos1] != 1) {
vis[pos1] ... | #include <bits/stdc++.h>
#define mod 1000000009
#define ll long long
using namespace std;
long long int n, num, a[200005], vis[200005];
int main() {
scanf("%lld%lld", &n, &num);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]), vis[i] = 0;
long long int pos1 = 1, pos2;
while (vis[pos1] != 1) {
vis[pos1... | replace | 4 | 5 | 4 | 5 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n;
ll k;
cin >> n >> k;
v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n;
ll k;
cin >> n >> k;
v... | replace | 22 | 23 | 22 | 23 | -11 | |
p02684 | C++ | Runtime Error | /********************************
*** ******** ********** *********
*** * ****** ********* * ********
*** ** ***** ******** *** *******
*** *** **** ******* ***** ******
*** **** *** ****** ******* *****
*** ***** ** ***** +++++++++ ****
*** ****** * **** *********** ***
*** ******* *** ************* **
*** ******** *... | /********************************
*** ******** ********** *********
*** * ****** ********* * ********
*** ** ***** ******** *** *******
*** *** **** ******* ***** ******
*** **** *** ****** ******* *****
*** ***** ** ***** +++++++++ ****
*** ****** * **** *********** ***
*** ******* *** ************* **
*** ******** *... | insert | 55 | 55 | 55 | 59 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 1, tmp, aa;
vector<int> check(n, 0);
check[0] = 1;
for (long long i = 1; i <= k; i++) {
cnt = a[cnt - 1];
if (check[cnt - 1] == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 1, tmp = k, aa = 0;
vector<int> check(n, 0);
check[0] = 1;
for (long long i = 1; i <= k; i++) {
cnt = a[cnt - 1];
if (check[cnt - 1... | replace | 10 | 11 | 10 | 11 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define my_max(a, b) ((a) > (b) ? (a) : (b))
#define my_min(a, b) ((a) < (b) ? (a) : (b))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rep(i, s, t) for (int i = (int)(s); i <= (int)(t); i++)
#define rev(i, t, s) for (int i = (int)(t); i >= (int)(s); i-... | #include <bits/stdc++.h>
#define my_max(a, b) ((a) > (b) ? (a) : (b))
#define my_min(a, b) ((a) < (b) ? (a) : (b))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rep(i, s, t) for (int i = (int)(s); i <= (int)(t); i++)
#define rev(i, t, s) for (int i = (int)(t); i >= (int)(s); i-... | replace | 80 | 81 | 80 | 81 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int b[n + 1];
vector<int> c;
int d = 0;
for (int i = 0; i < n + 3; i++) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int b[n + 1] = {};
vector<int> c;
int d = 0;
for (int i = 0; i < n + 3; i... | replace | 19 | 20 | 19 | 20 | 0 | |
p02684 | C++ | Time Limit Exceeded | /*
* ~ AtCoder Botay ~
* code by kazalika
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i]--;
}
if (a[0] ==... | /*
* ~ AtCoder Botay ~
* code by kazalika
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i]--;
}
if (a[0] ==... | replace | 27 | 28 | 27 | 28 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
const int maxn = 1e5 + 10;
ll arr[maxn], vis[maxn];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
int acout = 0, cur = 1;
vector<int> v;
... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
const int maxn = 2e5 + 10;
ll arr[maxn], vis[maxn];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
int acout = 0, cur = 1;
vector<int> v;
... | replace | 3 | 4 | 3 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.