Submission #390076

#	Time	Username	Problem	Language	Result	Execution time	Memory
390076		ioi	Comparing Plants (IOI20_plants)	C++14	0 / 100	69 ms	9512 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>

std::vector<int> g[200001];
int ind[200001];
int ap[200001];

void ts(int n){

    std::queue<int> q ;

    for(int i = 0 ; i < n ; i ++)
        if(ind[i] == 0)q.push(i) , ap[i] = 0;


    while(!q.empty()){

        for(auto &it : g[q.front()]){

            ind[it] -- ;
            if(ind[it] == 0)q.push(it) , ap[it] = ap[q.front()] + 1;
        }

        q.pop();


    }

}

void init(int k, std::vector<int> r) {
    // ঠিক সেই ক্ষেত্রে x = 2 ;

    int n = r.size();

    for(int i = 0 ; i < n ; i ++){
        int nxt = (i + 1) % n ;

        if(r[i] == 0)
            g[i].push_back(nxt) , ind[nxt] ++ ;

        else g[nxt].push_back(i) , ind[i] ++;

    }

    ts(n);


	return;
}

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