Submission #738131

#	Time	Username	Problem	Language	Result	Execution time	Memory
738131		bobthebuilder	Comparing Plants (IOI20_plants)	C++17	5 / 100	103 ms	46204 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define lowb(x) (x&(-x))
#define ALL(_x) _x.begin(),_x.end()
#define pii pair<int,int>
#define f first
#define s second
#define SORT_UNIQUE(x) sort(ALL(x)),x.erase(unique(ALL(x)),x.end())
#define ll long long
#define MNTO(x,y) x=min(x,y)
#define MXTO(x,y) x=max(x,y)
const int maxn=4e5+5;
vector<int> v[maxn];
int in[maxn];
int l[maxn],r[maxn];
void dfs(int u){
	l[u]=r[u]=u;
	for(int x:v[u]){
		dfs(x);
		MNTO(l[u],l[x]),MXTO(r[u],r[x]);
	}
}
int n;
void init(int k, std::vector<int> r) {
	n=sz(r);
	REP(i,2*n-1){
		if(r[i%n]==1){
			v[i+1].pb(i),in[i]++;
		}
		else v[i].pb(i+1),in[i+1]++;
	}
	REP(i,2*n){
		if(!in[i]){
			dfs(i);
		}	
	}
}

int compare_plants(int x, int y) {
	if((l[x]<=y and y<=r[x]) or (r[x]-n>=y) or (l[x+n]<=y)){
		return 1;
	}
	swap(x,y);
	if((l[x]<=y and y<=r[x]) or (r[x]-n>=y) or (l[x+n]<=y)){
		return -1;
	}
	return 0;
} 

• Subtask 1: 5 / 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