| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 125751 | 2019-07-06T10:05:50 Z | AngusRitossa | 우주 해적 (JOI14_space_pirate) | C++14 | 1883 ms | 91384 KB |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
int n, a[3010], ans[3010];
int canreach[3010][3010], at[3010][3010];
int from[3010][3030], fromsz[3010];
void dfs(int i, int j, int dis = 1)
{
while (!canreach[i][j])
{
canreach[i][j] = dis++;
from[i][fromsz[i]++] = j;
j = a[j];
}
}
ll k;
int main()
{
scanf("%d%lld", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) dfs(i, i);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (canreach[1][i])
{
if (i == j) ans[i]++;
else if (canreach[j][i])
{
ll dis = k-canreach[1][i]+1;
dis %= canreach[j][i];
int endpoint = i;
if (dis > 0) endpoint = from[j][dis-1];
ans[endpoint]++;
}
else at[j][canreach[1][i]]++;
}
else at[1][0]++;
}
}
for (int i = 1; i <= n; i++)
{
int cyclestart = a[from[i][fromsz[i]-1]];
int loc = -1;
for (int j = 0; j < fromsz[i]; j++)
{
if (from[i][j] == cyclestart) { loc = j; break; }
}
assert(loc != -1);
int sz = fromsz[i]-loc;
ll dis2 = k-loc;
int dis = dis2%sz;
for (int j = 0; j <= n; j++)
{
if (!at[i][j]) continue;
int d = dis-(ll)j;
d += n*sz;
d %= sz;
ans[from[i][d+loc]] += at[i][j];
}
}
for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 1656 KB | Output is correct |
| 2 | Correct | 3 ms | 1144 KB | Output is correct |
| 3 | Correct | 3 ms | 1528 KB | Output is correct |
| 4 | Correct | 3 ms | 1656 KB | Output is correct |
| 5 | Correct | 3 ms | 1528 KB | Output is correct |
| 6 | Correct | 3 ms | 1660 KB | Output is correct |
| 7 | Correct | 3 ms | 1656 KB | Output is correct |
| 8 | Correct | 3 ms | 1656 KB | Output is correct |
| 9 | Correct | 3 ms | 1656 KB | Output is correct |
| 10 | Correct | 3 ms | 1656 KB | Output is correct |
| 11 | Correct | 3 ms | 1528 KB | Output is correct |
| 12 | Correct | 3 ms | 1272 KB | Output is correct |
| 13 | Correct | 3 ms | 1656 KB | Output is correct |
| 14 | Correct | 3 ms | 1656 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 1656 KB | Output is correct |
| 2 | Correct | 3 ms | 1144 KB | Output is correct |
| 3 | Correct | 3 ms | 1528 KB | Output is correct |
| 4 | Correct | 3 ms | 1656 KB | Output is correct |
| 5 | Correct | 3 ms | 1528 KB | Output is correct |
| 6 | Correct | 3 ms | 1660 KB | Output is correct |
| 7 | Correct | 3 ms | 1656 KB | Output is correct |
| 8 | Correct | 3 ms | 1656 KB | Output is correct |
| 9 | Correct | 3 ms | 1656 KB | Output is correct |
| 10 | Correct | 3 ms | 1656 KB | Output is correct |
| 11 | Correct | 3 ms | 1528 KB | Output is correct |
| 12 | Correct | 3 ms | 1272 KB | Output is correct |
| 13 | Correct | 3 ms | 1656 KB | Output is correct |
| 14 | Correct | 3 ms | 1656 KB | Output is correct |
| 15 | Correct | 133 ms | 60792 KB | Output is correct |
| 16 | Correct | 103 ms | 55216 KB | Output is correct |
| 17 | Correct | 153 ms | 61108 KB | Output is correct |
| 18 | Correct | 1598 ms | 85624 KB | Output is correct |
| 19 | Correct | 757 ms | 85284 KB | Output is correct |
| 20 | Correct | 888 ms | 79352 KB | Output is correct |
| 21 | Correct | 1246 ms | 91384 KB | Output is correct |
| 22 | Correct | 511 ms | 81016 KB | Output is correct |
| 23 | Correct | 1187 ms | 90488 KB | Output is correct |
| 24 | Correct | 539 ms | 81272 KB | Output is correct |
| 25 | Correct | 102 ms | 54776 KB | Output is correct |
| 26 | Correct | 1883 ms | 71416 KB | Output is correct |
| 27 | Correct | 496 ms | 74616 KB | Output is correct |
| 28 | Correct | 777 ms | 75000 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 3 ms | 256 KB | Time limit exceeded (wall clock) |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 1656 KB | Output is correct |
| 2 | Correct | 3 ms | 1144 KB | Output is correct |
| 3 | Correct | 3 ms | 1528 KB | Output is correct |
| 4 | Correct | 3 ms | 1656 KB | Output is correct |
| 5 | Correct | 3 ms | 1528 KB | Output is correct |
| 6 | Correct | 3 ms | 1660 KB | Output is correct |
| 7 | Correct | 3 ms | 1656 KB | Output is correct |
| 8 | Correct | 3 ms | 1656 KB | Output is correct |
| 9 | Correct | 3 ms | 1656 KB | Output is correct |
| 10 | Correct | 3 ms | 1656 KB | Output is correct |
| 11 | Correct | 3 ms | 1528 KB | Output is correct |
| 12 | Correct | 3 ms | 1272 KB | Output is correct |
| 13 | Correct | 3 ms | 1656 KB | Output is correct |
| 14 | Correct | 3 ms | 1656 KB | Output is correct |
| 15 | Correct | 133 ms | 60792 KB | Output is correct |
| 16 | Correct | 103 ms | 55216 KB | Output is correct |
| 17 | Correct | 153 ms | 61108 KB | Output is correct |
| 18 | Correct | 1598 ms | 85624 KB | Output is correct |
| 19 | Correct | 757 ms | 85284 KB | Output is correct |
| 20 | Correct | 888 ms | 79352 KB | Output is correct |
| 21 | Correct | 1246 ms | 91384 KB | Output is correct |
| 22 | Correct | 511 ms | 81016 KB | Output is correct |
| 23 | Correct | 1187 ms | 90488 KB | Output is correct |
| 24 | Correct | 539 ms | 81272 KB | Output is correct |
| 25 | Correct | 102 ms | 54776 KB | Output is correct |
| 26 | Correct | 1883 ms | 71416 KB | Output is correct |
| 27 | Correct | 496 ms | 74616 KB | Output is correct |
| 28 | Correct | 777 ms | 75000 KB | Output is correct |
| 29 | Execution timed out | 3 ms | 256 KB | Time limit exceeded (wall clock) |
| 30 | Halted | 0 ms | 0 KB | - |