Общий форум @ Timus Online Judge

Igel_SK [VNTU] Compilation problem (STL set/map) 19 мар 2010 21:12

Submitting one problem I had a compilation error with making my own set comparator, although the program had succesfully been compiled by G++(GCC) 4.4.3 and Visual Studio 2008 compilers on my computer. By submitting some test programs I've found that the error is somehow related to the lower/upper_bound method of map and set containers. For instance, the code like this gets a compilation:

#include <set>
using namespace std;

struct Less
{
bool operator()(pair <int,int> a, pair <int,int> b)
{ return a.first < b.first; }
};

set <pair <int,int> , Less> s;
set <pair <int,int>, Less>::iterator it;

int main()
{
        s.insert(make_pair(1,1));
    it = s.lower_bound(make_pair(0,1));
    return 0;
}

The error message is following:

5bf1d001-ac4d-4354-a106-244d4befaf4e
S:\checker\compile\\Vc7\include\xtree(988): error: no instance of function "Less::operator()" matches the argument list and object (the object has cv-qualifiers that prevent a match)
            argument types are: (const std::pair<int, int>, const std::_Tree<std::_Tset_traits<std::pair<int, int>, Less, std::allocator<std::pair<int, int>>, false>>::key_type)
            object type is: const Less
              if (this->comp(_Key(_Pnode), _Keyval))

                  ^
          detected during:
            instantiation of "std::_Tree<_Traits>::_Nodeptr std::_Tree<_Traits>::_Lbound(const std::_Tree<_Traits>::key_type &) const [with _Traits=std::_Tset_traits<std::pair<int, int>, Less, std::allocator<std::pair<int, int>>, false>]" at line 801
            instantiation of "std::_Tree<_Traits>::iterator std::_Tree<_Traits>::lower_bound(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<std::pair<int, int>, Less, std::allocator<std::pair<int, int>>, false>]" at line 21 of "5bf1d001-ac4d-4354-a106-244d4befaf4e"

compilation aborted for 5bf1d001-ac4d-4354-a106-244d4befaf4e (code 2)

So I think that it makes some STL features unavailable and wish it to be fixed.

Valentina WA at test #5 (Pascal) // Задача 1153. Суперкомпьютер 19 мар 2010 20:04

Creastery™ Q 1021 Sacretment of the Sum [9] // Задача 1021. Таинство суммы 15 мар 2009 20:39

Thanks for everybody for the help.
Removed code :)

Edited by author 04.08.2011 16:55

Megov Re: Q 1021 Sacretment of the Sum [7] // Задача 1021. Таинство суммы 15 мар 2009 22:22

Use binary search

Creastery™ Re: Q 1021 Sacretment of the Sum [6] // Задача 1021. Таинство суммы 16 мар 2009 04:49

Like how do you do binary search?
Can you list an example?

Megov Re: Q 1021 Sacretment of the Sum [5] // Задача 1021. Таинство суммы 16 мар 2009 21:29

input(a);
input(b);
bool ok = false;
for( int i = 0; i < a.size(); i++ )
if ( binary_search(b, 10000 - a[i]) )
ok = true;

A* Nazarov Nodir Re: Q 1021 Sacretment of the Sum [4] // Задача 1021. Таинство суммы 19 ноя 2009 16:28

What is the type of a and b?

unlucky [Vologda SPU] Re: Q 1021 Sacretment of the Sum [3] // Задача 1021. Таинство суммы 19 ноя 2009 19:48

IMHO simply Hash Table is faster =)

mirzauzairbaig Re: WA Test 4 !! [2] // Задача 1021. Таинство суммы 13 янв 2010 05:50

// WHY IS THIS WRONG !!

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n,x;
    vector <int> N;
    cin>>n;
    for(int a=0; a<n; a++){
        cin>>x;
        N.push_back(x);
    }
    cin>>n;
    for(int a=0; a<n; a++){
        cin>>x;
        N.push_back(x);
    }
    sort(N.begin(), N.end());
    n=N.size();
    bool t(1);
    for(int a=0; a<n; a++){
        if(binary_search(N.begin(), N.end(), 10000-N[a])){
        cout<<"YES";
            t=0;
            break;
        }
        }
    if(t)
        cout<<"NO";
    return 0;}

Ras Misha [t4ce] Re: WA Test 4 !! [1] // Задача 1021. Таинство суммы 13 янв 2010 10:35

why you add second list in N ?
I think (i don't now c++)

[code deleted]

(I recieve this code ang get AC)
Please reply on this messge
I have to delete it after =)

Edited by author 13.01.2010 20:35

mirzauzairbaig Re: WA Test 4 !! // Задача 1021. Таинство суммы 13 янв 2010 20:23

Oh, sorry ! Now I realize my mistake.. I misunderstood the question! Thank You ! :)

AXIS ZULU Re: Q 1021 Sacretment of the Sum // Задача 1021. Таинство суммы 19 мар 2010 18:44

delete this:
if (lista[a]+listb[x]>10000)
{
continue;
}
else if (lista[a]+listb[x]<10000)
{
break;
}
rewrite this:
if(valuea[a]+valueb[x]==10000)
{
cout<<"YES";
break;
}
else break;
you ca adapt this ideea
good luck

November Rain Does this problem requires the route with minimum stops? [3] // Задача 1137. Автобусные маршруты 16 май 2004 21:11

VorobeY1326 WA#26 [2] // Задача 1027. Снова D++ 11 окт 2009 21:38

[UCTeam] Borzunov Alexander [hX] No subject 18 мар 2010 23:19

Iliya Why???? [2] // Задача 1710. Борис, ты не прав! 26 фев 2010 12:59

Cat36 Brute-force - AC 0.015 [1] // Задача 1261. Чаевые 2 ноя 2008 06:54

unlucky^2 [Vologda SPU] Hints & tests // Задача 1278. “… Connecting People” 18 мар 2010 15:31

SKYDOS Информация о операторе ">?=" / Information about ">?=" op 18 мар 2010 15:04

tob Help!How to slove this problem? [2] // Задача 1382. Игра с карточками 18 июл 2006 15:54

Tony Beta Lambda 3 is NOT the magic digit // Задача 1033. Лабиринт 18 мар 2010 10:50

Adler3D x==n, y==m? [1] // Задача 1755. Торт 13 мар 2010 13:05

chenxiang help!! [1] // Задача 1180. Игра с камушками 23 ноя 2006 17:42

QAFQAZkamran WA#1 // Задача 1123. Зарплата 17 мар 2010 23:59

[Ural SU] GetTester DP for O(n^3) [2] // Задача 1181. Разрезание окрашенного многоугольника 6 ноя 2009 14:02

asif O(n^3) gets TLE. Can anyone give me a better hint? [2] // Задача 1181. Разрезание окрашенного многоугольника 23 фев 2002 23:52

manishmmulani those who want hint [1] // Задача 1289. Билет в один конец 4 янв 2008 01:44

Vedernikoff Sergey (HSE: EconomicsForever!) What is your idea of solution? [2] // Задача 1658. Сумма цифр 3 ноя 2008 23:29

zigelee Globlalization issue 17 мар 2010 07:28