oj.uz

Submission #722179

# Submission time Handle Problem Language Result Execution time Memory
722179 2023-04-11T13:44:32 Z baojiaopisu Koala Game (APIO17_koala) C++14
91 / 100
 63 ms 340 KB 
#include "koala.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y> 
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

int minValue(int N, int W) {
    int n = N, w = W;
    int b[100], r[100];
    for(int i = 0; i < n; i++) b[i] = 0;
    b[0] = 1;
    int ans = 0;
    playRound(b, r);
    for(int i = 1; i < n; i++) {
        if(r[i] == 0) ans = i;
    }
    return ans;
}

int maxValue(int N, int W) {
    int n = N, w = W;
    int b[100], r[100];
    for(int i = 0; i < n; i++) b[i] = 1;
    playRound(b, r);
    vector<int> nxt;
    for(int i = 0; i < n; i++) if(r[i] == 2) nxt.pb(i);
    for(int i = 0; i < n; i++) b[i] = 0;
    for(auto x : nxt) b[x] = 2;
    playRound(b, r);    
    nxt.clear();
    for(int i = 0; i < n; i++) if(r[i] == 3) nxt.pb(i);
    for(int i = 0; i < n; i++) b[i] = 0;
    for(auto x : nxt) b[x] = 4;
    playRound(b, r);
    nxt.clear();
    for(int i = 0; i < n; i++) if(r[i] == 5) nxt.pb(i);
    for(int i = 0; i < n; i++) b[i] = 0;
    for(auto x : nxt) b[x] = 11;
    playRound(b, r);
    int ans = 0;
    for(int i = 0; i < n; i++) if(r[i] == 12) ans = i;
    return ans;
}

int greaterValue(int N, int W) {
    int lo = 1, hi = 9;
    int n = N, w = W;
    int b[100], r[100];
    while(lo <= hi) {
        int mid = (lo + hi) >> 1;
        for(int i = 0; i < n; i++) b[i] = 0;
        b[0] = b[1] = mid;
        playRound(b, r);
        if(r[0] != r[1]) {
            return (r[0] > r[1] ? 0 : 1);
        }

        if(r[0] > b[0]) {
            lo = mid + 1;
        }  else hi = mid - 1;
    }
    return 0;
}

int n, w;
int coef;
bool compare(int x, int y) {
    int lo = 1, hi = 15;
    int b[100], r[100];
    while(lo <= hi) {
        int mid = (lo + hi) >> 1;
        for(int i = 0; i < n; i++) b[i] = 0;
        b[x] = b[y] = mid;
        if(coef == 2) {
            for(int i = 0; i < n; i++) {
                b[i] = 2 * (b[i] + 1) - 1;
            }
        }
        playRound(b, r);
        if(r[x] != r[y]) {
            return (r[x] > r[y] ? true : false);
        }

        if(r[x] > b[x]) {
            lo = mid + 1;
        }  else hi = mid - 1;
    }
    return true;
}

vector<int> solve(vector<int> p) {
    if(p.size() > 3) {
        int b[100], r[100];
        for(int i = 0; i < n; i++) b[i] = 0;
        int t = 2 * (n - p.size()) / p.size() - 1;
        while(t * p.size() > n) t--;
        for(auto x : p) b[x] = t;
        playRound(b, r);
        vector<int> left, right;
        for(auto x : p) if(r[x] > b[x]) right.pb(x); else left.pb(x);
        if(left.size() && right.size()) {
            left = solve(left);
            right = solve(right);
            for(auto x : right) left.pb(x);
            return left;
        }
    }
    shuffle(all(p), rng);
    vector<int> ans;
    ans.pb(p[0]);
    for(int i = 1; i < p.size(); i++) {
        int l = 0, r = ans.size() - 1, pos = -1;
        while(l <= r) {
            int mid = (l + r) >> 1;
            if(compare(p[i], ans[mid])) {
                pos = mid;
                l = mid + 1;
            } else r = mid - 1;
        }
        ans.pb(0);
        for(int i = ans.size() - 1; i > pos + 1; i--) ans[i] = ans[i - 1];
        ans[pos + 1] = p[i];
    }
    return ans;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        n = N, w = W;
        coef = 2;
        vector<int> ans;
        ans.pb(0);
        for(int i = 1; i < n; i++) {
            int l = 0, r = ans.size() - 1, pos = -1;
            while(l <= r) {
                int mid = (l + r) >> 1;
                if(compare(i, ans[mid])) {
                    pos = mid;
                    l = mid + 1;
                } else r = mid - 1;
            }
            ans.pb(0);
            for(int i = ans.size() - 1; i > pos + 1; i--) ans[i] = ans[i - 1];
            ans[pos + 1] = i;
        }

        for(int i = 0; i < n; i++) {
            P[ans[i]] = i + 1;
        }
    } else {
        coef = 1;
        n = N, w = W;

        int b[100], r[100];
        for(int i = 0; i < n; i++) b[i] = 1;
        playRound(b, r);
        vector<int> left, right;
        for(int i = 0; i < n; i++) {
            if(r[i] <= b[i]) left.pb(i);
            else right.pb(i);
        }

        vector<int> l1, l2;
        for(int i = 0; i < n; i++) b[i] = 0;
        for(auto x : left) b[x] = 1;
        playRound(b, r);
        for(auto x : left) if(r[x] > b[x]) l2.pb(x); else l1.pb(x);
        l1 = solve(l1);
        l2 = solve(l2);
        right = solve(right);
        vector<int> ans = l1;
        for(auto x : l2) ans.pb(x);
        for(auto x : right) ans.pb(x);

        for(int i = 0; i < n; i++) {
            P[ans[i]] = i + 1;
        }
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:74:16: warning: unused variable 'w' [-Wunused-variable]
   74 |     int n = N, w = W;
      |                ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:87:16: warning: unused variable 'w' [-Wunused-variable]
   87 |     int n = N, w = W;
      |                ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:113:16: warning: unused variable 'w' [-Wunused-variable]
  113 |     int n = N, w = W;
      |                ^
koala.cpp: In function 'std::vector<int> solve(std::vector<int>)':
koala.cpp:162:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  162 |         while(t * p.size() > n) t--;
      |               ~~~~~~~~~~~~~^~~
koala.cpp:177:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  177 |     for(int i = 1; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 4 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 328 KB Output is correct
2 Correct 20 ms 208 KB Output is correct
3 Correct 18 ms 208 KB Output is correct
4 Correct 12 ms 324 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 328 KB Output is correct
2 Correct 62 ms 340 KB Output is correct
3 Correct 51 ms 336 KB Output is correct
4 Correct 62 ms 336 KB Output is correct
5 Correct 57 ms 324 KB Output is correct
6 Correct 52 ms 340 KB Output is correct
7 Correct 52 ms 336 KB Output is correct
8 Correct 54 ms 332 KB Output is correct
9 Correct 59 ms 332 KB Output is correct
10 Correct 53 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 208 KB Output is correct
2 Correct 37 ms 208 KB Output is correct
3 Correct 42 ms 208 KB Output is correct
4 Correct 42 ms 208 KB Output is correct
5 Correct 44 ms 208 KB Output is correct
6 Correct 40 ms 208 KB Output is correct
7 Correct 36 ms 208 KB Output is correct
8 Correct 38 ms 300 KB Output is correct
9 Correct 46 ms 300 KB Output is correct
10 Correct 38 ms 208 KB Output is correct
11 Correct 36 ms 300 KB Output is correct
12 Correct 30 ms 208 KB Output is correct
13 Correct 45 ms 208 KB Output is correct
14 Correct 32 ms 308 KB Output is correct
15 Correct 37 ms 304 KB Output is correct
16 Correct 50 ms 208 KB Output is correct
17 Correct 38 ms 320 KB Output is correct
18 Correct 46 ms 208 KB Output is correct
19 Correct 50 ms 300 KB Output is correct
20 Correct 51 ms 304 KB Output is correct

Subtask #5
44.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 7 ms 332 KB Output is partially correct
2 Partially correct 7 ms 336 KB Output is partially correct
3 Partially correct 9 ms 336 KB Output is partially correct
4 Partially correct 7 ms 336 KB Output is partially correct
5 Partially correct 7 ms 336 KB Output is partially correct
6 Partially correct 7 ms 336 KB Output is partially correct
7 Partially correct 10 ms 332 KB Output is partially correct
8 Partially correct 6 ms 332 KB Output is partially correct
9 Partially correct 8 ms 332 KB Output is partially correct
10 Partially correct 6 ms 332 KB Output is partially correct
11 Partially correct 9 ms 336 KB Output is partially correct
12 Partially correct 6 ms 336 KB Output is partially correct
13 Partially correct 6 ms 336 KB Output is partially correct
14 Partially correct 7 ms 336 KB Output is partially correct
15 Partially correct 7 ms 336 KB Output is partially correct
16 Partially correct 7 ms 332 KB Output is partially correct
17 Partially correct 7 ms 336 KB Output is partially correct
18 Partially correct 6 ms 336 KB Output is partially correct
19 Partially correct 9 ms 336 KB Output is partially correct
20 Partially correct 6 ms 336 KB Output is partially correct
21 Partially correct 9 ms 340 KB Output is partially correct
22 Partially correct 10 ms 336 KB Output is partially correct
23 Partially correct 9 ms 336 KB Output is partially correct
24 Partially correct 11 ms 336 KB Output is partially correct
25 Partially correct 6 ms 336 KB Output is partially correct
26 Partially correct 10 ms 336 KB Output is partially correct
27 Partially correct 6 ms 336 KB Output is partially correct
28 Partially correct 6 ms 336 KB Output is partially correct
29 Partially correct 10 ms 332 KB Output is partially correct
30 Partially correct 6 ms 336 KB Output is partially correct
31 Partially correct 6 ms 336 KB Output is partially correct
32 Partially correct 8 ms 336 KB Output is partially correct
33 Partially correct 6 ms 336 KB Output is partially correct
34 Partially correct 6 ms 336 KB Output is partially correct
35 Partially correct 6 ms 332 KB Output is partially correct
36 Partially correct 6 ms 340 KB Output is partially correct
37 Partially correct 6 ms 336 KB Output is partially correct
38 Partially correct 6 ms 336 KB Output is partially correct
39 Partially correct 8 ms 336 KB Output is partially correct
40 Partially correct 9 ms 336 KB Output is partially correct