# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
295491 | patrikpavic2 | Space Pirate (JOI14_space_pirate) | C++17 | 82 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
using namespace std;
typedef long long ll;
const int N = 105;
const int LOG = 62;
int dp[N][LOG], P[N], n, cnt[N];
ll k;
int solve(){
for(int i = 1;i <= n;i++)
dp[i][0] = P[i];
for(int j = 1;j < LOG;j++)
for(int i = 1;i <= n;i++)
dp[i][j] = dp[dp[i][j - 1]][j - 1];
int ret = 1;
for(int j = 0;j < LOG;j++)
if((1LL << j) & k)
ret = dp[ret][j];
return ret;
}
int main(){
scanf("%d%lld", &n, &k);
for(int i = 1;i <= n;i++)
scanf("%d", P + i);
for(int i = 1;i <= n;i++){
int ol = P[i];
for(P[i] = 1;P[i] <= n;P[i]++)
cnt[solve()]++;
P[i] = ol;
}
for(int i = 1;i <= n;i++)
printf("%d\n", cnt[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |