Submission #1242616

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242616		Malix	Comparing Plants (IOI20_plants)	C++20	0 / 100	34 ms	4420 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=9000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

vi a,b,vis,arr;
int n;

void dfs(int x,int t,vi &c){
	vis[x]=1;
	if(t==1){	
		if(x+1==n){
			if(arr[x])c[x]=c[0]+1;
			return;
		}
		dfs(x+1,t,c);
		if(arr[x])c[x]=c[x+1]+1;
	}
	else{
		if(x+1==n){
			if(!arr[x])c[x]=c[0]+1;
			return;
		}
		dfs(x+1,t,c);
		if(!arr[x])c[x]=c[x+1]+1;
	}
}

void init(int k, std::vector<int> r) {
	arr=r;
	n=r.size();
	a.resize(n,0);b.resize(n,0);vis.resize(n,0);
	REP(i,0,n)if(!vis[i])dfs(i,1,a);
	vis.clear();vis.resize(n,0);
	REP(i,0,n)if(!vis[i])dfs(i,2,b);
	return;
}

int compare_plants(int x, int y) {
	if(x+a[x]>=y||y+b[y]>=x+n)return -1;
	if(x+b[x]>=y||y+a[y]>=x+n)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