Submission #623469

#	Time	Username	Problem	Language	Result	Execution time	Memory
623469		Jomnoi	Comparing Plants (IOI20_plants)	C++17	0 / 100	4 ms	5020 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;

const int MAX_N = 2e5 + 5;

int N, K;
vector <int> R;
int indegree[MAX_N];
vector <int> graph[MAX_N];
int pos[MAX_N];

void dfs(int u, int p) {
	pos[u] = p;
	for(auto v : graph[u]) {
		dfs(v, p + 1);
	}
}

void init(int k, vector <int> r) {
	K = k, R = r, N = R.size();
	for(int i = 0; i < N; i++) {
		if(R[i] == 0) {
			graph[i + 1].push_back(i);
			indegree[i]++;
		}
		else {
			graph[i].push_back(i + 1);
			indegree[i + 1]++;
		}
	}

	for(int i = 0; i < N; i++) {
		if(indegree[i] == 0) {
			dfs(i, 0);
		}
	}
}

int compare_plants(int x, int y) {
	if(pos[x] > pos[y]) {
		return 1;
	}
	if(pos[x] < pos[y]) {
		return -1;
	}
	return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25