제출 #616090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
616090		yanndev	식물 비교 (IOI20_plants)	C++17	0 / 100	3 ms	5008 KiB

plants

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

int K;
int nxtChain = 0;
int comp[200042];
int lstPos[200042];
int fstPos[200042];
bool isInc[200042];
vector<int> chainId[200042];
// edge from A to B if v[A] > v[B]

void init(int k, vector<int> r) {
	int n = (int)r.size();

	bool inc = r[0] < r[1];
	isInc[0] = inc;

	for (int i = 0; i < n; i++) {
		//cout << "cur is " << i << '\n';
		int nxt = (i + 1) % n;
		bool cur = (r[i] < r[nxt]);

		if (cur != inc) {
			nxtChain++;
			//cout << "adding chain " << nxtChain << '\n';
			comp[nxtChain] = nxtChain;
			isInc[nxtChain] =  cur;
			fstPos[nxtChain] = i;
		}

		if (nxt == 0 && (int)chainId[0].size() == 1 && isInc[chainId[0][0]] == cur) {
			comp[nxtChain] = chainId[0][0];
			break;
		}

		inc = cur;
		chainId[i].push_back(nxtChain);
		chainId[nxt].push_back(nxtChain);
		lstPos[nxtChain] = nxt;
	}
	return;
}

int compare_plants(int x, int y) {
	for (auto& a: chainId[x]) {
		for (auto& b: chainId[y]) {
			if (comp[a] == comp[b]) {
				/*printf("pos are %d %d\n", x, y);
				printf("comp x %d %d\n", a, comp[a]);
				printf("comp y %d %d\n", b, comp[b]);*/
				if (comp[b] != b) {
					if (fstPos[b] == x && (int)chainId[x].size() > 1)
						return 0;
					if (isInc[comp[b]])
						return 1;
					return -1;
				}

				if (isInc[a])
					return -1;
				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