Submission #1330950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1330950		nguyenkhangninh99	Minerals (JOI19_minerals)	C++20	Compilation error	0 ms	0 KiB

minerals

#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;

namespace sub1{
    void solve(int n){
        vector<bool> vis(n + 1);
        for(int i = 1; i <= n; i++){
            if(!vis[i]){
                Query(i); 
                int j = i + 1;
                while(j <= n){
                    if(Query(j) == 1){
                        Answer(i, j);
                        vis[i] = vis[j] = true;
                        Query(j); 
                        break; 
                    }else Query(j++); 
                }
                Query(i); 
            }
        }
    }
}
namespace sub23{
    void solve(int n){
        vector<int> l(n / 2), r(n / 2), ans(n / 2), a, b;
        int cnt = 0;
        for(int i = 1; i <= n; i++){
            if(Query(i) == a.size() + 1) a.push_back(i);
            else{
                r[b.size()] = a.size() - 1;
                b.push_back(i);
            }
        }
        for(int i = 1; i <= n; i++) Query(i);
        while(true){
            bool ok = false;
            vector<vector<int>> query(n / 2);
            for(int i = 0; i < n / 2; i++){
                if(l[i] <= r[i]){
                    query[(l[i] + r[i]) / 2].push_back(i);
                    ok = true;
                }
            }
            if(!ok) break;

            for(int i = 0; i < n / 2; i++){
                Query(a[i]); //thêm a[i]
                for(int j: query[i]){
                    if(Query(b[j]) == i + 1) ans[j] = i, r[j] = i - 1; //nếu thêm b[j] ok
                    else l[j] = i + 1;
                    Query(b[j]); //xóa b[j]
                }
            }
            for(int i = 0; i < n / 2; i++) Query(a[i]); //xóa a[i];
        }
        for(int i = 0; i < n / 2; i++) Answer(b[i], a[ans[i]]);
    }
}
namespace subsub{
    vector<int> vis;
    int cur = 0;

    void banhhe(int x){
        vis[x] = !vis[x];
        cur = Query(x);
    }

    void quaylui(vector<int> a, vector<int> b){
        if(a.size() == 1) Answer(a[0], b[0]);
        else{
            int mid = max(1, a.size() / 2);
            for(int i = 0; i < mid; i++) banhhe(a[i]);
            vector<int> b1, b2;
            for(int i: b){
                if(b1.size() == mid) b2.push_back(i);
                else if(b2.size() == int(a.size()) - mid) b1.push_back(i);
                else{
                    int pre = cur;
                    banhhe(i);
                    if(cur == pre){
                        if(vis[a[0]]) b1.push_back(i);
                        else b2.push_back(i);
                    }
                    else if(vis[a[0]]) b2.push_back(i);
                    else b1.push_back(i);
                }
            }
        }
        quaylui(vector<int>(a.begin(), a.begin() + mid), b1);
        quaylui(vector<int>(a.begin() + mid, a.end()), b2);
    }
    void solve(int n){
        vector<int> a, b;
        vis.init(n + 1);
        for(int i = 1; i <= n; i++){
            banhhe(i);
            if(cur == a.size() + 1) a.push_back(i);
            else b.push_back(i);
        }
        quaylui(a, b);
    }
}
void Solve(int m){
    if(m <= 100) sub1::solve(2 * m);
    else if(m <= 15000) sub23::solve(2 * m);
    else subsub::solve(2 * m);
}

Compilation message (stderr)

minerals.cpp: In function 'void subsub::quaylui(std::vector<int>, std::vector<int>)':
minerals.cpp:73:26: error: no matching function for call to 'max(int, std::vector<int>::size_type)'
   73 |             int mid = max(1, a.size() / 2);
      |                       ~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from minerals.cpp:2:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
minerals.cpp:73:26: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::vector<int>::size_type' {aka 'long unsigned int'})
   73 |             int mid = max(1, a.size() / 2);
      |                       ~~~^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
minerals.cpp:73:26: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::vector<int>::size_type' {aka 'long unsigned int'})
   73 |             int mid = max(1, a.size() / 2);
      |                       ~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
minerals.cpp:73:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   73 |             int mid = max(1, a.size() / 2);
      |                       ~~~^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
minerals.cpp:73:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   73 |             int mid = max(1, a.size() / 2);
      |                       ~~~^~~~~~~~~~~~~~~~~
minerals.cpp:91:52: error: 'mid' was not declared in this scope
   91 |         quaylui(vector<int>(a.begin(), a.begin() + mid), b1);
      |                                                    ^~~
minerals.cpp:91:58: error: 'b1' was not declared in this scope; did you mean 'b'?
   91 |         quaylui(vector<int>(a.begin(), a.begin() + mid), b1);
      |                                                          ^~
      |                                                          b
minerals.cpp:92:56: error: 'b2' was not declared in this scope; did you mean 'b'?
   92 |         quaylui(vector<int>(a.begin() + mid, a.end()), b2);
      |                                                        ^~
      |                                                        b
minerals.cpp: In function 'void subsub::solve(int)':
minerals.cpp:96:13: error: 'class std::vector<int>' has no member named 'init'
   96 |         vis.init(n + 1);
      |             ^~~~