oj.uz

답안 #295491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295491 2020-09-09T17:26:04 Z patrikpavic2 우주 해적 (JOI14_space_pirate) C++17
10 / 100
 82 ms 512 KB 
#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

space_pirate.cpp: In function 'int main()':
space_pirate.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |  scanf("%d%lld", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
space_pirate.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |   scanf("%d", P + i);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 256 KB Output is correct
2 Correct 76 ms 376 KB Output is correct
3 Correct 74 ms 376 KB Output is correct
4 Correct 75 ms 376 KB Output is correct
5 Correct 75 ms 256 KB Output is correct
6 Correct 77 ms 376 KB Output is correct
7 Correct 79 ms 376 KB Output is correct
8 Correct 76 ms 376 KB Output is correct
9 Correct 80 ms 256 KB Output is correct
10 Correct 74 ms 376 KB Output is correct
11 Correct 75 ms 376 KB Output is correct
12 Correct 75 ms 376 KB Output is correct
13 Correct 81 ms 376 KB Output is correct
14 Correct 76 ms 256 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 256 KB Output is correct
2 Correct 76 ms 376 KB Output is correct
3 Correct 74 ms 376 KB Output is correct
4 Correct 75 ms 376 KB Output is correct
5 Correct 75 ms 256 KB Output is correct
6 Correct 77 ms 376 KB Output is correct
7 Correct 79 ms 376 KB Output is correct
8 Correct 76 ms 376 KB Output is correct
9 Correct 80 ms 256 KB Output is correct
10 Correct 74 ms 376 KB Output is correct
11 Correct 75 ms 376 KB Output is correct
12 Correct 75 ms 376 KB Output is correct
13 Correct 81 ms 376 KB Output is correct
14 Correct 76 ms 256 KB Output is correct
15 Runtime error 2 ms 512 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2 ms 384 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 256 KB Output is correct
2 Correct 76 ms 376 KB Output is correct
3 Correct 74 ms 376 KB Output is correct
4 Correct 75 ms 376 KB Output is correct
5 Correct 75 ms 256 KB Output is correct
6 Correct 77 ms 376 KB Output is correct
7 Correct 79 ms 376 KB Output is correct
8 Correct 76 ms 376 KB Output is correct
9 Correct 80 ms 256 KB Output is correct
10 Correct 74 ms 376 KB Output is correct
11 Correct 75 ms 376 KB Output is correct
12 Correct 75 ms 376 KB Output is correct
13 Correct 81 ms 376 KB Output is correct
14 Correct 76 ms 256 KB Output is correct
15 Runtime error 2 ms 512 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -