# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87038 | rakuten | Weighting stones (IZhO11_stones) | C++14 | 2 ms | 256 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;
int x , a , n , x1 , x2;
set < int > v ;
set < int > :: iterator vi ;
set < int > q ;
set < int > :: iterator qi ;
int main()
{
scanf ("%d" , &n) ;
for (int i = 0 ;i < n ;i ++ )
{
x1 = 0 ;
x2 = 0 ;
scanf ("%d%d" , &x , &a) ;
if (i == 0)
{
if (a == 1)
cout << '>' << endl ;
else
cout << '<' << endl ;
if (a == 1)
v.insert (x) ;
else
q.insert (x) ;
}
else
{
if (a == 1)
v.insert (x) ;
else
q.insert (x) ;
if (v.size() == 0)
cout << '<' << endl ;
else
if (q.size() == 0 )
cout << '>' << endl ;
else
{
qi = -- q.end();
for (vi = --v.end(); vi != v.begin() ; vi -- )
{
if ( (*vi) > (*qi))
x1 ++ ;
else
x2 ++ ;
if (qi == q.begin() || (x1 > 0 && x2 > 0) )
break;
qi -- ;
}
if (x1 > x2 && x2 == 0 && x1 == q.size())
cout << '>' << endl ;
else
if (x1 < x2 && x1 == 0 && x2 == v.size())
cout << '<' << endl;
else
cout << '?' << endl ;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |