# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17764 | Elibay | Weighting stones (IZhO11_stones) | C++98 | 368 ms | 4064 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>
#define Fname ""
using namespace std;
const int MaxN = 3e5 + 17, INF = 1e9 + 17, Mod = 1e9 + 7;
double Sx, Sy, Mx, My, Sum, M2x, M2y, a[MaxN];
int n, kol1, kol2, x, y;
int main ()
{
#ifdef Elibay
freopen (".in", "r", stdin);
#endif
cin >> n;
for (int i = 1; i <= n; ++ i)
Sum += 0.1, a[i] = Sum;
for (int i = 1; i <= n; ++ i)
{
cin >> x >> y;
if (y == 2)
Mx += x * 1.0 + 0.999, Sx += x * 1.0, kol2 ++, M2x += a[x * 1];
else
My += x * 1.0 + 0.999, Sy += x * 1.0, kol1 ++, M2y += a[x * 1];
if (Sx > My && kol2 >= kol1 && M2x > M2y)
puts ("<");
else if (Sy > Mx && kol1 >= kol2 && M2y > M2x)
puts (">");
else
puts ("?");
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |