Submission #723167

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
723167	2023-04-13T09:56:52 Z	nguyentunglam	Koala Game (APIO17_koala)	C++17	Compilation error	0 ms	0 KB

koala

#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int b[N], r[N], mark[N], ans[N], c[N];
int n, w;
int minValue(int n, int w) {
    for(int i = 0; i < n; i++) b[i] = 0;
    b[0] = 1;
    playRound(b, r);
    for(int i = 0; i < n; i++) if (!r[i]) return i;
    return 0;
}

int maxValue(int n, int w) {
    for(int i = 0; i < n; i++) mark[i] = 1;
    while (1) {
        int cnt = 0;
        for(int i = 0; i < n; i++) cnt += mark[i];
        if (cnt == 1) break;
        int val = w / cnt;
        for(int i = 0; i < n; i++) {
            if (mark[i]) b[i] = val;
            else b[i] = 0;
        }
        playRound(b, r);
        for(int i = 0; i < n; i++) mark[i] &= (r[i] > 0);
    }
    for(int i = 0; i < n; i++) if (mark[i]) return i;
    return 0;
}

int greaterValue(int n, int w) {
    int L = 1, R = min(w / 2, 9);
    while (L <= R) {
        int mid = L + R >> 1;
        for(int i = 2; i < n; i++) b[i] = 0;
        b[0] = b[1] = mid;
        playRound(b, r);
        int tmp = 0;
        for(int i = 0; i < 2; i++) if (r[i] > b[i]) tmp++;

        if (tmp == 2) L = mid + 1;
        else {
            if (tmp == 1) {
                if (r[0] > b[0]) return 0;
                return 1;
            }
            R = mid - 1;
        }
    }
    return 0;
}

void solve(vector<int> lst, int L, int R) {
    if (lst.size() == 1) {
        ans[lst[0]] = L;
        return;
    }
    int l = 1, r = min(9, w / lst.size());
    while (l <= r) {
        int mid = l + r >> 1;
        for(int i = 0; i < n; i++) b[i] = 0;
        for(int &j : lst) b[j] = mid;
        playRound(b, c);
//        cout << L << " " << R << endl;
        int tmp = 0;
        for(int &j : lst) tmp += (c[j] > b[j]);

        if (tmp == lst.size()) l = mid + 1;
        else {
            if (tmp > 0) {
                vector<int> v1, v2;
                for(int &j : lst) {
                    if (c[j] > b[j]) v1.push_back(j);
                    else v2.push_back(j);
                }
                solve(v2, L, L + v2.size() - 1);
                solve(v1, L + v2.size(), R);
                return;
            }
            else r = mid - 1;
        }
    }
}

void allValues(int _n, int W, int *P) {
    n = _n;
    w = W;
    if (W == 2 * n) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        vector<int> init;
        for(int i = 0; i < n; i++) init.push_back(i);
        solve(init, 1, n);
        for(int i = 0; i < n; i++) P[i] = ans[i];
    }
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:36:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |         int mid = L + R >> 1;
      |                   ~~^~~
koala.cpp: In function 'void solve(std::vector<int>, int, int)':
koala.cpp:60:41: error: no matching function for call to 'min(int, std::vector<int>::size_type)'
   60 |     int l = 1, r = min(9, w / lst.size());
      |                                         ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from koala.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
koala.cpp:60:41: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::vector<int>::size_type' {aka 'long unsigned int'})
   60 |     int l = 1, r = min(9, w / lst.size());
      |                                         ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from koala.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
koala.cpp:60:41: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::vector<int>::size_type' {aka 'long unsigned int'})
   60 |     int l = 1, r = min(9, w / lst.size());
      |                                         ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from koala.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
koala.cpp:60:41: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   60 |     int l = 1, r = min(9, w / lst.size());
      |                                         ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from koala.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
koala.cpp:60:41: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   60 |     int l = 1, r = min(9, w / lst.size());
      |                                         ^
koala.cpp:62:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |         int mid = l + r >> 1;
      |                   ~~^~~
koala.cpp:70:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         if (tmp == lst.size()) l = mid + 1;
      |             ~~~~^~~~~~~~~~~~~