Submission #755619

#	Time	Username	Problem	Language	Result	Execution time	Memory
755619		Theo830	Scales (IOI15_scales)	C++17	Compilation error	0 ms	0 KiB

scales

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "scales.h"
void init(int T) {

}
void orderCoins() {
    int W[] = {1, 2, 3, 4, 5, 6};
    vector<int>ex;
    f(i,0,6){
        ex.pb(i+1);
    }
    set<vector<int> >pos;
    do{
        pos.insert(ex);
    }
    while(next_permutation(all(ex)));
    while(ex.size() > 1){
        ll t = 0,a,b,c,d,ans = 0;
        f(i,0,6){
            f(j,i+1,6){
                f(k,j+1,6){
                    ll res = INF;
                    ll cur = 0;
                    for(auto x:ex){
                        if(x[i] < x[j] && x[i] < x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[j] < x[i] && x[j] < x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[k] < x[i] && x[k] < x[j]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    if(ans < res){
                        ans = res;
                        t = 0;
                        a = i;
                        b = j;
                        c = k;
                    }
                }
            }
        }
        f(i,0,6){
            f(j,i+1,6){
                f(k,j+1,6){
                    ll res = INF;
                    ll cur = 0;
                    for(auto x:ex){
                        if(x[i] < x[j] && x[i] > x[k]){

                        }
                        else if(x[i] > x[j] && x[i] < x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[k] < x[j] && x[k] > x[i]){

                        }
                        else if(x[k] > x[j] && x[k] < x[i]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[j] < x[i] && x[j] > x[k]){

                        }
                        else if(x[j] > x[i] && x[j] < x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    if(ans < res){
                        ans = res;
                        t = 1;
                        a = i;
                        b = j;
                        c = k;
                    }
                }
            }
        }
        f(i,0,6){
            f(j,i+1,6){
                f(k,j+1,6){
                    ll res = INF;
                    ll cur = 0;
                    for(auto x:ex){
                        if(x[i] > x[j] && x[i] > x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[j] > x[i] && x[j] > x[k]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    cur = 0;
                    for(auto x:ex){
                        if(x[k] > x[i] && x[k] > x[j]){

                        }
                        else{
                            cur++;
                        }
                    }
                    res = min(res,cur);
                    if(ans < res){
                        ans = res;
                        t = 2;
                        a = i;
                        b = j;
                        c = k;
                    }
                }
            }
        }
        set<vector<int> >fkale;
        if(t == 0){
            ll pos = getLightest(a,b,c);
            for(auto x:ex){
                if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){

                }
                else{
                    fkale.insert(x);
                }
            }
        }
        else if(t == 1){
            ll pos = getMedian(a,b,c);
            for(auto x:ex){
                ll posoi = (x[pos] > x[a]) + (x[pos] > x[b]) + (x[pos] > x[c]);
                if(posoi != 1){
                    fkale.insert(x);
                }
            }
        }
        else if(t == 2){
            ll pos = getHeaviest(a,b,c);
            for(auto x:ex){
                if(x[pos] >= x[a] && x[pos] >= x[b] && x[pos] >= x[c]){

                }
                else{
                    fkale.insert(x);
                }
            }
        }
        else{

        }
        for(auto x:fkale){
            ex.erase(x);
        }
    }
    f(i,0,6){
        W[i] = ex[i];
    }
    answer(W);
}

Compilation message (stderr)

scales.cpp: In function 'void init(int)':
scales.cpp:26:15: warning: unused parameter 'T' [-Wunused-parameter]
   26 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void orderCoins()':
scales.cpp:48:29: error: invalid types 'int[ll {aka int}]' for array subscript
   48 |                         if(x[i] < x[j] && x[i] < x[k]){
      |                             ^
scales.cpp:48:36: error: invalid types 'int[ll {aka int}]' for array subscript
   48 |                         if(x[i] < x[j] && x[i] < x[k]){
      |                                    ^
scales.cpp:48:44: error: invalid types 'int[ll {aka int}]' for array subscript
   48 |                         if(x[i] < x[j] && x[i] < x[k]){
      |                                            ^
scales.cpp:48:51: error: invalid types 'int[ll {aka int}]' for array subscript
   48 |                         if(x[i] < x[j] && x[i] < x[k]){
      |                                                   ^
scales.cpp:58:29: error: invalid types 'int[ll {aka int}]' for array subscript
   58 |                         if(x[j] < x[i] && x[j] < x[k]){
      |                             ^
scales.cpp:58:36: error: invalid types 'int[ll {aka int}]' for array subscript
   58 |                         if(x[j] < x[i] && x[j] < x[k]){
      |                                    ^
scales.cpp:58:44: error: invalid types 'int[ll {aka int}]' for array subscript
   58 |                         if(x[j] < x[i] && x[j] < x[k]){
      |                                            ^
scales.cpp:58:51: error: invalid types 'int[ll {aka int}]' for array subscript
   58 |                         if(x[j] < x[i] && x[j] < x[k]){
      |                                                   ^
scales.cpp:68:29: error: invalid types 'int[ll {aka int}]' for array subscript
   68 |                         if(x[k] < x[i] && x[k] < x[j]){
      |                             ^
scales.cpp:68:36: error: invalid types 'int[ll {aka int}]' for array subscript
   68 |                         if(x[k] < x[i] && x[k] < x[j]){
      |                                    ^
scales.cpp:68:44: error: invalid types 'int[ll {aka int}]' for array subscript
   68 |                         if(x[k] < x[i] && x[k] < x[j]){
      |                                            ^
scales.cpp:68:51: error: invalid types 'int[ll {aka int}]' for array subscript
   68 |                         if(x[k] < x[i] && x[k] < x[j]){
      |                                                   ^
scales.cpp:92:29: error: invalid types 'int[ll {aka int}]' for array subscript
   92 |                         if(x[i] < x[j] && x[i] > x[k]){
      |                             ^
scales.cpp:92:36: error: invalid types 'int[ll {aka int}]' for array subscript
   92 |                         if(x[i] < x[j] && x[i] > x[k]){
      |                                    ^
scales.cpp:92:44: error: invalid types 'int[ll {aka int}]' for array subscript
   92 |                         if(x[i] < x[j] && x[i] > x[k]){
      |                                            ^
scales.cpp:92:51: error: invalid types 'int[ll {aka int}]' for array subscript
   92 |                         if(x[i] < x[j] && x[i] > x[k]){
      |                                                   ^
scales.cpp:95:34: error: invalid types 'int[ll {aka int}]' for array subscript
   95 |                         else if(x[i] > x[j] && x[i] < x[k]){
      |                                  ^
scales.cpp:95:41: error: invalid types 'int[ll {aka int}]' for array subscript
   95 |                         else if(x[i] > x[j] && x[i] < x[k]){
      |                                         ^
scales.cpp:95:49: error: invalid types 'int[ll {aka int}]' for array subscript
   95 |                         else if(x[i] > x[j] && x[i] < x[k]){
      |                                                 ^
scales.cpp:95:56: error: invalid types 'int[ll {aka int}]' for array subscript
   95 |                         else if(x[i] > x[j] && x[i] < x[k]){
      |                                                        ^
scales.cpp:105:29: error: invalid types 'int[ll {aka int}]' for array subscript
  105 |                         if(x[k] < x[j] && x[k] > x[i]){
      |                             ^
scales.cpp:105:36: error: invalid types 'int[ll {aka int}]' for array subscript
  105 |                         if(x[k] < x[j] && x[k] > x[i]){
      |                                    ^
scales.cpp:105:44: error: invalid types 'int[ll {aka int}]' for array subscript
  105 |                         if(x[k] < x[j] && x[k] > x[i]){
      |                                            ^
scales.cpp:105:51: error: invalid types 'int[ll {aka int}]' for array subscript
  105 |                         if(x[k] < x[j] && x[k] > x[i]){
      |                                                   ^
scales.cpp:108:34: error: invalid types 'int[ll {aka int}]' for array subscript
  108 |                         else if(x[k] > x[j] && x[k] < x[i]){
      |                                  ^
scales.cpp:108:41: error: invalid types 'int[ll {aka int}]' for array subscript
  108 |                         else if(x[k] > x[j] && x[k] < x[i]){
      |                                         ^
scales.cpp:108:49: error: invalid types 'int[ll {aka int}]' for array subscript
  108 |                         else if(x[k] > x[j] && x[k] < x[i]){
      |                                                 ^
scales.cpp:108:56: error: invalid types 'int[ll {aka int}]' for array subscript
  108 |                         else if(x[k] > x[j] && x[k] < x[i]){
      |                                                        ^
scales.cpp:118:29: error: invalid types 'int[ll {aka int}]' for array subscript
  118 |                         if(x[j] < x[i] && x[j] > x[k]){
      |                             ^
scales.cpp:118:36: error: invalid types 'int[ll {aka int}]' for array subscript
  118 |                         if(x[j] < x[i] && x[j] > x[k]){
      |                                    ^
scales.cpp:118:44: error: invalid types 'int[ll {aka int}]' for array subscript
  118 |                         if(x[j] < x[i] && x[j] > x[k]){
      |                                            ^
scales.cpp:118:51: error: invalid types 'int[ll {aka int}]' for array subscript
  118 |                         if(x[j] < x[i] && x[j] > x[k]){
      |                                                   ^
scales.cpp:121:34: error: invalid types 'int[ll {aka int}]' for array subscript
  121 |                         else if(x[j] > x[i] && x[j] < x[k]){
      |                                  ^
scales.cpp:121:41: error: invalid types 'int[ll {aka int}]' for array subscript
  121 |                         else if(x[j] > x[i] && x[j] < x[k]){
      |                                         ^
scales.cpp:121:49: error: invalid types 'int[ll {aka int}]' for array subscript
  121 |                         else if(x[j] > x[i] && x[j] < x[k]){
      |                                                 ^
scales.cpp:121:56: error: invalid types 'int[ll {aka int}]' for array subscript
  121 |                         else if(x[j] > x[i] && x[j] < x[k]){
      |                                                        ^
scales.cpp:145:29: error: invalid types 'int[ll {aka int}]' for array subscript
  145 |                         if(x[i] > x[j] && x[i] > x[k]){
      |                             ^
scales.cpp:145:36: error: invalid types 'int[ll {aka int}]' for array subscript
  145 |                         if(x[i] > x[j] && x[i] > x[k]){
      |                                    ^
scales.cpp:145:44: error: invalid types 'int[ll {aka int}]' for array subscript
  145 |                         if(x[i] > x[j] && x[i] > x[k]){
      |                                            ^
scales.cpp:145:51: error: invalid types 'int[ll {aka int}]' for array subscript
  145 |                         if(x[i] > x[j] && x[i] > x[k]){
      |                                                   ^
scales.cpp:155:29: error: invalid types 'int[ll {aka int}]' for array subscript
  155 |                         if(x[j] > x[i] && x[j] > x[k]){
      |                             ^
scales.cpp:155:36: error: invalid types 'int[ll {aka int}]' for array subscript
  155 |                         if(x[j] > x[i] && x[j] > x[k]){
      |                                    ^
scales.cpp:155:44: error: invalid types 'int[ll {aka int}]' for array subscript
  155 |                         if(x[j] > x[i] && x[j] > x[k]){
      |                                            ^
scales.cpp:155:51: error: invalid types 'int[ll {aka int}]' for array subscript
  155 |                         if(x[j] > x[i] && x[j] > x[k]){
      |                                                   ^
scales.cpp:165:29: error: invalid types 'int[ll {aka int}]' for array subscript
  165 |                         if(x[k] > x[i] && x[k] > x[j]){
      |                             ^
scales.cpp:165:36: error: invalid types 'int[ll {aka int}]' for array subscript
  165 |                         if(x[k] > x[i] && x[k] > x[j]){
      |                                    ^
scales.cpp:165:44: error: invalid types 'int[ll {aka int}]' for array subscript
  165 |                         if(x[k] > x[i] && x[k] > x[j]){
      |                                            ^
scales.cpp:165:51: error: invalid types 'int[ll {aka int}]' for array subscript
  165 |                         if(x[k] > x[i] && x[k] > x[j]){
      |                                                   ^
scales.cpp:185:16: warning: declaration of 'pos' shadows a previous local [-Wshadow]
  185 |             ll pos = getLightest(a,b,c);
      |                ^~~
scales.cpp:35:22: note: shadowed declaration is here
   35 |     set<vector<int> >pos;
      |                      ^~~
scales.cpp:187:21: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                     ^
scales.cpp:187:31: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                               ^
scales.cpp:187:39: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                                       ^
scales.cpp:187:49: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                                                 ^
scales.cpp:187:57: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                                                         ^
scales.cpp:187:67: error: invalid types 'int[ll {aka int}]' for array subscript
  187 |                 if(x[pos] <= x[a] && x[pos] <= x[b] && x[pos] <= x[c]){
      |                                                                   ^
scales.cpp:191:35: error: no matching function for call to 'std::set<std::vector<int> >::insert(int&)'
  191 |                     fkale.insert(x);
      |                                   ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from scales.cpp:1:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:32: note:   no known conversion for argument 1 from 'int' to 'const value_type&' {aka 'const std::vector<int>&'}
  509 |       insert(const value_type& __x)
      |              ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:27: note:   no known conversion for argument 1 from 'int' to 'std::set<std::vector<int> >::value_type&&' {aka 'std::vector<int>&&'}
  518 |       insert(value_type&& __x)
      |              ~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >]'
  566 |  insert(_InputIterator __first, _InputIterator __last)
      |  ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note:   template argument deduction/substitution failed:
scales.cpp:191:35: note:   candidate expects 2 arguments, 1 provided
  191 |                     fkale.insert(x);
      |                                   ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from scales.cpp:1:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:43: note:   no known conversion for argument 1 from 'int' to 'std::initializer_list<std::vector<int> >'
  578 |       insert(initializer_list<value_type> __l)
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::vector<int>, std::vector<int>, std::_Identity<std::vector<int> >, std::less<std::vector<int> >, std::allocator<std::vector<int> > >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:26: note:   no known conversion for argument 1 from 'int' to 'std::set<std::vector<int> >::node_type&&' {aka 'std::_Rb_tre