Submission #1164971

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164971		steveonalex	Koala Game (APIO17_koala)	C++20	4 / 100	2 ms	412 KiB

koala

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

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(ull 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());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

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 "koala.h"


int minValue(int n, int w) {
    int a[n], b[n];
    memset(a, 0, sizeof a); memset(b, 0, sizeof b);
    a[0] = 1;

    playRound(a, b);
    if (b[0] < a[0]){
        return 0;
    }
    else{
        for(int i = 1; i < n; ++i) if (b[i] <= a[i]) return i;
    }
    assert(false);
    return 0;
}

int maxValue(int n, int w) {
    vector<int> S;
    for(int i = 0; i < n; ++i) S.push_back(i);

    for(int it = 0; it < 4; ++it){
        int a[n], b[n]; memset(a, 0, sizeof a); memset(b, 0, sizeof b);

        int dih;
        if (it == 0) dih = 1;
        else if (it == 1) dih = 2;
        else if (it == 2) dih = 4;
        else if (it == 3) dih = 11;

        if (dih * S.size() > n) assert(false);
        for(int i: S) a[i] = dih;

        playRound(a, b);

        S.clear();
        for(int i = 0; i < n; ++i) if (b[i] > a[i]) S.push_back(i);
    }
    return S[0];
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53