제출 #1142806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142806		PagodePaiva	Comparing Plants (IOI20_plants)	C++20	0 / 100	30 ms	3140 KiB

plants

#include<bits/stdc++.h>
#include "plants.h"
#define fr first
#define sc second

using namespace std;

const int N = 200010;

int k;
int val[N];

bool comp(pair <int, int> a,pair <int, int> b){
	if(a.fr > b.fr) return true;
	if(a.fr < b.fr) return false;
	if(a.sc < b.sc){
		if(a.sc <= b.sc and b.sc <= a.sc+k) return false;
		else return true;
	}
	else{
		if(b.sc <= a.sc and a.sc <= b.sc+k) return true;
		return false;
	}
}

void init(int K, std::vector<int> r) {
	int k = K;
	for(auto &p : r){
		p = k-p;
	}
	vector <pair <int, int>> res;
	for(int i = 0;i < r.size();i++){
		res.push_back({r[i], i});
	}
	sort(res.begin(), res.end(), comp);
	for(int i = 0;i < res.size();i++){
		val[res[i].second] = res.size()-i; 
	}
	
	return;
}

int compare_plants(int x, int y) {
	if(val[x] < val[y]) return -1;
	else 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