Submission #1215798

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215798		steveonalex	Comparing Plants (IOI20_plants)	C++20	11 / 100	29 ms	3144 KiB

plants

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "plants.h"


const int N = 303;
const int INF = 1e9 + 69;
int n, k;
vector<int> graph[N];
bitset<N> dp[N];

void dfs(int u){
    dp[u][u] = 1;
    for(int v: graph[u]){
        if (!dp[v][v]) dfs(v);
        dp[u] |= dp[v];
    }
}

void init(int _k, vector<int> r){   
    n = r.size(), k = _k;

    for(int it = 0; it < n; ++it){
        vector<int> dis(n);
        dis[0] = 1;
        for(int i = 1; i < 2 * n; ++i){
            int j1 = (i - 1) % n, j2 = i % n;
            if (r[j1] == 0) dis[j2] = 1;
            else dis[j2] = dis[j1] + 1;
        }

        int pos = -1;
        for(int i = 0; i < n; ++i) if (r[i] == 0 && dis[i] >= k) pos = i;
        if (pos == -1) assert(false);
        for(int i = 1; i < k; ++i)
            r[(pos + n - i) % n]--;

        r[pos] = INF;

        for(int i = 1; i < k; ++i){
            int j = (pos + i) % n;
            if (r[j] <= n) graph[pos].push_back(j);
            else graph[j].push_back(pos); 
        }
    }

    for(int i = 0; i < n; ++i) if (!dp[i][i]){
        dfs(i);
    }
}

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

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