Submission #1224577

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224577		PVM_pvm	Comparing Plants (IOI20_plants)	C++20	14 / 100	99 ms	3220 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
#define MAXN 5007
int prm[MAXN];

void init(int k, vector<int> r) {
    int n=r.size();
    for (int st=0;st<n;st++)
    {
        vector<int> pot;
        for (int q=0;q<n;q++)
        {
            if (r[q]==k-1) pot.push_back(q);
        }
        int spec=-1;
        for (int q=0;q<pot.size();q++)
        {
            int cur=pot[q];
            int pr;
            if (q==0) pr=pot[pot.size()-1];
            else pr=pot[q-1];
            bool dali=false;
            if (pr<cur)
            {
                pr+=n;
            }
            if ((pr-cur)<k) dali=true;
            if (dali)
            {
                spec=cur;
                break;
            }
        }
        prm[spec]=st;
        r[spec]=0;
        for (int q=(spec-1);(spec-q)<k;q--)
        {
            if (q>=0) r[q]++;
            else r[n+q]++;
        }
    }
    //for (int q=0;q<n;q++) cout<<prm[q]<<" ";
	return;
}

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

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