제출 #1224577

#제출 시각아이디문제언어결과실행 시간메모리
1224577PVM_pvm식물 비교 (IOI20_plants)C++20
14 / 100
99 ms3220 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...