oj.uz

Submission #52268

# Submission time Handle Problem Language Result Execution time Memory
52268 2018-06-25T07:24:33 Z 김세빈(#1347) Space Pirate (JOI14_space_pirate) C++11
10 / 100
 2000 ms 143088 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll K[3030][3030], B[3030][3030];
ll R[3030], F[3030], P[3030];
ll ans[3030];
ll n,k;

ll run(ll p,ll d)
{
	if(d <= F[p]) return B[p][d];
	if(d == 0) return p;
	return B[p][(d - F[p]) % R[p] + F[p]];
}

ll f(ll a,ll b)
{
	if(a == b) return a;
	if(a == 1){
		if(K[b][1]){
			ll r = k % (K[b][1] + 1);
			if(r == 0) return a;
			else if(r == 1) return b;
			else return run(b, r-1);
		}
		else return run(b, k-1);
	}
	
	if(K[b][a]){
		ll r = (k - K[1][a]) % (K[b][a] + 1);
		if(r == 0) return a;
		else if(r == 1) return b;
		else return run(b, r-1);
	}
	else return run(b, k-1-K[1][a]);
}	

int main()
{
	scanf("%lld%lld",&n,&k);
	
	if(n > 3000) return 0;
	
	ll i,j,t;
	
	for(i=1;i<=n;i++){
		scanf("%lld",P+i);
	}
	
	for(i=1;i<=n;i++){
		for(j=i,t=0;;j=P[j],t++){
			if(K[i][j]) break;
			K[i][j] = t;
			B[i][t] = j;
			if(t > n) return 1 / 0;
		}
		R[i] = t-K[i][j];
		F[i] = K[i][j];
	}
	
	ll cnt = 0;
	
	for(i=1;i<=n;i++) if(i == 1 || K[1][i]){
		for(j=1;j<=n;j++){
			ans[f(i,j)] ++;
		}
		cnt ++;
	}
	
	ans[run(1,k)] += n * (n - cnt);
	
	for(i=1;i<=n;i++) printf("%lld\n",ans[i]);
	
	return 0;
}

Compilation message

space_pirate.cpp: In function 'int main()':
space_pirate.cpp:58:23: warning: division by zero [-Wdiv-by-zero]
    if(t > n) return 1 / 0;
                     ~~^~~
space_pirate.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld",&n,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~
space_pirate.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",P+i);
   ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1312 KB Output is correct
4 Correct 3 ms 1460 KB Output is correct
5 Correct 3 ms 1516 KB Output is correct
6 Correct 3 ms 1516 KB Output is correct
7 Correct 3 ms 1520 KB Output is correct
8 Correct 3 ms 1520 KB Output is correct
9 Correct 3 ms 1520 KB Output is correct
10 Correct 4 ms 1520 KB Output is correct
11 Correct 3 ms 1520 KB Output is correct
12 Correct 4 ms 1520 KB Output is correct
13 Correct 3 ms 1520 KB Output is correct
14 Correct 3 ms 1520 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1312 KB Output is correct
4 Correct 3 ms 1460 KB Output is correct
5 Correct 3 ms 1516 KB Output is correct
6 Correct 3 ms 1516 KB Output is correct
7 Correct 3 ms 1520 KB Output is correct
8 Correct 3 ms 1520 KB Output is correct
9 Correct 3 ms 1520 KB Output is correct
10 Correct 4 ms 1520 KB Output is correct
11 Correct 3 ms 1520 KB Output is correct
12 Correct 4 ms 1520 KB Output is correct
13 Correct 3 ms 1520 KB Output is correct
14 Correct 3 ms 1520 KB Output is correct
15 Correct 132 ms 84376 KB Output is correct
16 Correct 74 ms 84376 KB Output is correct
17 Correct 175 ms 86040 KB Output is correct
18 Execution timed out 2072 ms 143088 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 143088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1312 KB Output is correct
4 Correct 3 ms 1460 KB Output is correct
5 Correct 3 ms 1516 KB Output is correct
6 Correct 3 ms 1516 KB Output is correct
7 Correct 3 ms 1520 KB Output is correct
8 Correct 3 ms 1520 KB Output is correct
9 Correct 3 ms 1520 KB Output is correct
10 Correct 4 ms 1520 KB Output is correct
11 Correct 3 ms 1520 KB Output is correct
12 Correct 4 ms 1520 KB Output is correct
13 Correct 3 ms 1520 KB Output is correct
14 Correct 3 ms 1520 KB Output is correct
15 Correct 132 ms 84376 KB Output is correct
16 Correct 74 ms 84376 KB Output is correct
17 Correct 175 ms 86040 KB Output is correct
18 Execution timed out 2072 ms 143088 KB Time limit exceeded
19 Halted 0 ms 0 KB -