Submission #357664

#	Time	Username	Problem	Language	Result	Execution time	Memory
357664		doowey	Comparing Plants (IOI20_plants)	C++14	14 / 100	4070 ms	9708 KiB

plants

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define fi first
#define se scond
#define mp make_pair

const int N = (int)2e5 + 100;
int A[N];
int vl[N];

void init(int k, vector<int> r) {
    int n = r.size();
    for(int i = 0 ; i < n; i ++ ){
        if(r[i] == 0){
            for(int j = 1; j < k ; j ++ ){
                vl[(i + j) % n] ++ ;
            }
        }
    }
    int pv;
    for(int id = n - 1; id >= 0; id -- ){
        for(int q = 0; q < n; q ++ ){
            if(vl[q] == 0 && r[q] == 0){
                A[q] = id;
                for(int j = 0; j < k ; j ++ ){
                    pv = (q - j + n) % n;
                    r[pv] -- ;
                    if(r[pv] == 0){
                        for(int z = 1; z < k ; z ++ ){
                            vl[(pv + z) % n] ++ ;
                        }
                    }
                    vl[(q + j) % n] -- ;
                }
                break;
            }
        }
    }
}

int compare_plants(int x, int y) {
    if(A[x] < A[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