oj.uz

Submission #52289

# Submission time Handle Problem Language Result Execution time Memory
52289 2018-06-25T08:05:39 Z 김세빈(#1347) Space Pirate (JOI14_space_pirate) C++11
10 / 100
 162 ms 143116 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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

int run(int 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]];
}

int main()
{
	scanf("%d%lld",&n,&k);
	
	if(n > 3000){
		return 0;
	}
	
	int i,j,t,x1;
	
	for(i=1;i<=n;i++){
		scanf("%d",P+i);
	}
	
	int fff = 0;
	
	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;
			fff ++;
		}
		R[i] = t-K[i][j];
		F[i] = K[i][j];
	}
	
	int cnt = 0;
	
	ans[1] ++;
	for(i=2;i<=n;i++){
		if(K[i][1]){
			ll r = k % (K[i][1] + 1);
			if(r == 0) ans[1] ++;
			else if(r == 1) ans[i] ++;
			else ans[run(i, r-1)] ++;
		}
		else ans[run(i, k-1)] ++;
	}
	
	if(fff > 2000000) return 1/0;
	
	for(i=2;i<=n;i++) if(K[1][i]){
		x1 = K[1][i];
		for(j=1;j<=n;j++){
			if(i == j) ans[i] ++;
			else{
				if(K[j][i]){
					r = (k - x1) % (K[j][i] + 1);
					if(r == 0) ans[i] ++;
					else if(r == 1) ans[j] ++;
					else ans[run(j, r-1)] ++;
				}
				else ans[run(j, k-1-x1)] ++;
			}
		}
		cnt ++;
	}
	
	
	ans[run(1,k)] += n * (n - cnt - 1);
	
	for(i=1;i<=n;i++) printf("%d\n",ans[i]);
	
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1236 KB Output is correct
2 Correct 3 ms 1376 KB Output is correct
3 Correct 3 ms 1376 KB Output is correct
4 Correct 4 ms 1472 KB Output is correct
5 Correct 4 ms 1472 KB Output is correct
6 Correct 3 ms 1472 KB Output is correct
7 Correct 4 ms 1472 KB Output is correct
8 Correct 3 ms 1472 KB Output is correct
9 Correct 4 ms 1492 KB Output is correct
10 Correct 3 ms 1492 KB Output is correct
11 Correct 3 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 3 ms 1492 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1236 KB Output is correct
2 Correct 3 ms 1376 KB Output is correct
3 Correct 3 ms 1376 KB Output is correct
4 Correct 4 ms 1472 KB Output is correct
5 Correct 4 ms 1472 KB Output is correct
6 Correct 3 ms 1472 KB Output is correct
7 Correct 4 ms 1472 KB Output is correct
8 Correct 3 ms 1472 KB Output is correct
9 Correct 4 ms 1492 KB Output is correct
10 Correct 3 ms 1492 KB Output is correct
11 Correct 3 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 3 ms 1492 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 98 ms 49016 KB Output is correct
16 Correct 51 ms 49016 KB Output is correct
17 Correct 121 ms 49380 KB Output is correct
18 Runtime error 162 ms 143116 KB Execution killed with signal 4 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 143116 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 1236 KB Output is correct
2 Correct 3 ms 1376 KB Output is correct
3 Correct 3 ms 1376 KB Output is correct
4 Correct 4 ms 1472 KB Output is correct
5 Correct 4 ms 1472 KB Output is correct
6 Correct 3 ms 1472 KB Output is correct
7 Correct 4 ms 1472 KB Output is correct
8 Correct 3 ms 1472 KB Output is correct
9 Correct 4 ms 1492 KB Output is correct
10 Correct 3 ms 1492 KB Output is correct
11 Correct 3 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 3 ms 1492 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 98 ms 49016 KB Output is correct
16 Correct 51 ms 49016 KB Output is correct
17 Correct 121 ms 49380 KB Output is correct
18 Runtime error 162 ms 143116 KB Execution killed with signal 4 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -