oj.uz

Submission #295576

# Submission time Handle Problem Language Result Execution time Memory
295576 2020-09-09T18:48:18 Z patrikpavic2 Space Pirate (JOI14_space_pirate) C++17
47 / 100
 1216 ms 75256 KB 
#include <cstdio>
#include <cstring>
#include <vector>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;

const int N = 3e3 + 50;
const int M = 1e5 + 500;
const int LOG = 62;

int dis[N][N], udem[N], kor[N][N];
int bio[N], cnt[N], P[N], klsk, cik[N];
vector < int > red;

int n;
ll k, fin[M];

void precompute(int x){
	memset(bio, 0, sizeof(bio));
	int cur = x, cdis = 0;
	while(!bio[cur]){
		kor[x][cdis] = cur;
		bio[cur] = 1;
		dis[x][cur] = cdis++;
		cur = P[cur]; 
	}
	udem[x] = cur;
	if(cur == x)
		cik[x] = cdis;
}

int siz = 0;


int get(int a, int b){
	if(a == b)
		return a;
	int nw = (a - b + siz) % siz + 1;
	int koji = (k - a) % nw;
	if(koji == 0)
		return a;
	return (b + koji - 1) % siz;
}

int main(){
	memset(dis, -1, sizeof(dis));
	scanf("%d%lld", &n, &k);
	for(int i = 1;i <= n;i++)
		scanf("%d", P + i);
	if(n > 3000){
		int cur = 1;
		while(!bio[cur]){
			red.PB(cur);
			bio[cur] = 1;
			cur = P[cur];
			siz++;
		}
		fin[red[k % siz]] += (ll)(n - siz) * n;
		for(int dif = - siz - 1;dif <= siz - 1;dif++){
			int a = -dif, b = 0;
			if(dif >= 0)
				a = 0, b = dif;
			for(;a < siz && b < siz;){
				int cur = get(a, b), kor = 0;
				for(int k = 17;k >= 0;k--){
					if(a + kor + (1 << k) >= siz || b + kor + (1 << k) >= siz)
						continue;
					if(get(a + kor + (1 << k), b + kor + (1 << k)) == cur)
						kor += (1 << k);
				}
				fin[red[cur]] += kor + 1;
				a += kor + 1; b += kor + 1;
			}
		}
		for(int i = 1;i <= n;i++){
			if(!bio[i])
				printf("%d\n", siz);
			else
				printf("%lld\n", fin[i]);
		}
		return 0;
	}
	for(int i = 1;i <= n;i++)
		precompute(i);
	int koji_kl = (k - dis[1][udem[1]]) % cik[udem[1]];
	klsk = kor[udem[1]][koji_kl]; 
	for(int a = 1;a <= n;a++){
		for(int b = 1;b <= n;b++){
			int ans = 0;
			if(dis[1][a] == -1){
				ans = klsk;
			}
			else if(dis[b][a] != -1){
				int koji = (k - dis[1][a]) % (dis[b][a] + 1);
				if(koji == 0)
					ans = a;
				else
					ans = kor[b][koji - 1];
			}
			else{
				int koji = (k - dis[1][a] - 1 - dis[b][udem[b]]) % cik[udem[b]];
				ans = kor[udem[b]][koji]; 
			}
			cnt[ans]++;
		}
	}
	for(int i = 1;i <= n;i++)
		printf("%d\n", cnt[i]);	
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 37240 KB Output is correct
2 Correct 22 ms 37120 KB Output is correct
3 Correct 22 ms 37120 KB Output is correct
4 Correct 22 ms 37248 KB Output is correct
5 Correct 23 ms 37120 KB Output is correct
6 Correct 22 ms 37120 KB Output is correct
7 Correct 23 ms 37248 KB Output is correct
8 Correct 22 ms 37120 KB Output is correct
9 Correct 22 ms 37120 KB Output is correct
10 Correct 22 ms 37120 KB Output is correct
11 Correct 22 ms 37120 KB Output is correct
12 Correct 22 ms 37248 KB Output is correct
13 Correct 22 ms 37120 KB Output is correct
14 Correct 23 ms 37116 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 37240 KB Output is correct
2 Correct 22 ms 37120 KB Output is correct
3 Correct 22 ms 37120 KB Output is correct
4 Correct 22 ms 37248 KB Output is correct
5 Correct 23 ms 37120 KB Output is correct
6 Correct 22 ms 37120 KB Output is correct
7 Correct 23 ms 37248 KB Output is correct
8 Correct 22 ms 37120 KB Output is correct
9 Correct 22 ms 37120 KB Output is correct
10 Correct 22 ms 37120 KB Output is correct
11 Correct 22 ms 37120 KB Output is correct
12 Correct 22 ms 37248 KB Output is correct
13 Correct 22 ms 37120 KB Output is correct
14 Correct 23 ms 37116 KB Output is correct
15 Correct 71 ms 49656 KB Output is correct
16 Correct 55 ms 48888 KB Output is correct
17 Correct 77 ms 49912 KB Output is correct
18 Correct 1216 ms 72696 KB Output is correct
19 Correct 667 ms 65660 KB Output is correct
20 Correct 590 ms 68088 KB Output is correct
21 Correct 979 ms 64888 KB Output is correct
22 Correct 398 ms 59256 KB Output is correct
23 Correct 855 ms 64196 KB Output is correct
24 Correct 339 ms 57724 KB Output is correct
25 Correct 57 ms 49400 KB Output is correct
26 Correct 1160 ms 72696 KB Output is correct
27 Correct 360 ms 55416 KB Output is correct
28 Correct 475 ms 60280 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Runtime error 92 ms 75256 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 37240 KB Output is correct
2 Correct 22 ms 37120 KB Output is correct
3 Correct 22 ms 37120 KB Output is correct
4 Correct 22 ms 37248 KB Output is correct
5 Correct 23 ms 37120 KB Output is correct
6 Correct 22 ms 37120 KB Output is correct
7 Correct 23 ms 37248 KB Output is correct
8 Correct 22 ms 37120 KB Output is correct
9 Correct 22 ms 37120 KB Output is correct
10 Correct 22 ms 37120 KB Output is correct
11 Correct 22 ms 37120 KB Output is correct
12 Correct 22 ms 37248 KB Output is correct
13 Correct 22 ms 37120 KB Output is correct
14 Correct 23 ms 37116 KB Output is correct
15 Correct 71 ms 49656 KB Output is correct
16 Correct 55 ms 48888 KB Output is correct
17 Correct 77 ms 49912 KB Output is correct
18 Correct 1216 ms 72696 KB Output is correct
19 Correct 667 ms 65660 KB Output is correct
20 Correct 590 ms 68088 KB Output is correct
21 Correct 979 ms 64888 KB Output is correct
22 Correct 398 ms 59256 KB Output is correct
23 Correct 855 ms 64196 KB Output is correct
24 Correct 339 ms 57724 KB Output is correct
25 Correct 57 ms 49400 KB Output is correct
26 Correct 1160 ms 72696 KB Output is correct
27 Correct 360 ms 55416 KB Output is correct
28 Correct 475 ms 60280 KB Output is correct
29 Runtime error 92 ms 75256 KB Execution killed with signal 8
30 Halted 0 ms 0 KB -