Submission #747613

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
747613	2023-05-24 11:53:04	Dan4Life	Space Pirate (JOI14_space_pirate)	C++17	0 / 100	22 ms	35992 KiB

space_pirate

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)3e3+10;
const int mxLg = 60;
const int INF = 0x3f3f3f3f;
int n, k, p[mxN], ans[mxN];
int dis[mxN][mxN], jmp[mxLg][mxN];
int getPath(int x, int k){
  for(int i = 0; i<mxLg; i++)
    if((k>>i)&1) x = jmp[i][x];
  return x;
}
int32_t main() {
  cin >> n >> k;
  for(int i = 1; i <= n; i++) cin >> p[i], jmp[0][p[i]]=i;
  for(int i = 1; i < mxLg; i++)
    for(int j = 1; j <= n; j++)
      jmp[i][j] = jmp[i-1][jmp[i-1][j]];
  memset(dis,63,sizeof(dis));
  for(int i = 1; i <= n; i++)
    for(int j = 0; j <= n; j++)
      if(dis[i][getPath(i,j)]==INF) 
        dis[i][getPath(i,j)]=j;
  for(int a = 1; a <= n; a++){
    for(int b = 1; b <= n; b++){
      if(dis[1][a]>=k) ans[getPath(1,k)]++;
      else{
        int xd = k-dis[1][a]-1, cyc;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 37
• Subtask 3: 0 / 33
• Subtask 4: 0 / 20