# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87061 | rakuten | Weighting stones (IZhO11_stones) | C++14 | 2 ms | 280 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
set < int > v1 ;
set < int > :: iterator it1 ;
set < int > v2 ;
set < int > :: iterator it2 ;
int x1 , x2 ;
main()
{
int a , b;
int n;
cin >> n;
cin >> a >> b ;
if(b == 1)
{
cout << "<" << endl;
v1.insert (a) ;
}
else
{
cout << ">" << endl;
v2.insert (a) ;
}
for(int i = 2; i <= n; i++)
{
x1 = 0 ;
x2 = 0 ;
cin >> a >> b;
if (b == 1)
v1.insert (a) ;
else
v2.insert (a) ;
if (v1.size() == 0)
{
cout << '<' << endl ;
}
else
if (v2.size() == 0)
{
cout << '>' << endl ;
}
else
{
it1 = -- v1.end() ;
it2 = -- v2.end() ;
for ( ; ; )
{
if ( *it1 > *it2 )
x1 ++ ;
else
x2 ++ ;
if (it1 == v1.begin () || it2 == v2 .begin ())
break ;
it1 -- ;
it2 -- ;
}
if ( x1 == 0 && x2 == v1.size() )
cout << '<' << endl ;
else
if ( x2 == 0 && x1 == v2.size() )
cout << '>' << endl ;
else
cout << '?' << endl ;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |