oj.uz

답안 #17800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17800 2016-01-12T11:26:10 Z Elibay 돌 무게 재기 (IZhO11_stones) C++14
36 / 100
 1000 ms 11096 KB 
#include <bits/stdc++.h>
#define Fname ""
  
using namespace std;
  
const int MaxN = 3e5 + 17, INF = 1e9 + 17, Mod = 1e9 + 7;
  
multiset < int > S, s;
int n, x, y;
double Sx, Sy, Mx, My, kol1, kol2;
inline void Solve1 ()
{
    int k1 = 0, k2 = 0;
    auto i = s.begin (); 
    auto j = S.begin ();
    for (int q = 1; q <= n; ++ q)
    {
        int X = *i;
        int Y = *j;
        if (Y > X)
            k1 ++;
        if (X > Y)
            k2 ++;
        ++ i;
        ++ j;
    }
    if (k2 == 0)
        puts ("<");
    else if (k1 == 0)
        puts (">");
    else    
        puts ("?");
}
int main ()
{
    #ifdef Elibay
        freopen (".in", "r", stdin);
    #endif
    cin >> n;
    for (int i = 1; i <= n; ++ i)
        S.insert (0), s.insert (0);
    for (int z = 1; z <= n; ++ z)
    {
        cin >> x >> y;
        if (y == 2)
        {
            Mx += x * 1.0 + 0.999, Sx += x * 1.0, kol2 ++;
            auto w = S.begin ();
            S.erase (w);
            S.insert (x);
        }
        else if (y == 1)
        {   
            My += x * 1.0 + 0.999, Sy += x * 1.0, kol1 ++;
            auto w = s.begin ();
            s.erase (s.begin ());
            s.insert (x);
        }
        if (z <= int (3e3))
        {
            if ((Sx > My && kol2 >= kol1) || (Sy > Mx && kol1 >= kol2))
                Solve1 ();
            else
                puts ("?");
        }
        else
        {
            if ((Sx > My && kol2 >= kol1))
                puts ("<");
            else if ((Sy > Mx && kol1 >= kol2))
                puts (">");
            else
                puts ("?");   
        }
    }
    return 0;
}

Subtask #1
36.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1724 KB Output is correct - 73 tokens
2 Correct 1 ms 1724 KB Output is correct - 89 tokens
3 Correct 2 ms 1724 KB Output is correct - 221 tokens
4 Correct 0 ms 1724 KB Output is correct - 21 tokens
5 Correct 5 ms 1724 KB Output is correct - 369 tokens
6 Correct 7 ms 1724 KB Output is correct - 492 tokens
7 Correct 11 ms 1724 KB Output is correct - 945 tokens
8 Correct 24 ms 1724 KB Output is correct - 1237 tokens
9 Correct 18 ms 1724 KB Output is correct - 1105 tokens
10 Incorrect 379 ms 2516 KB Output isn't correct - 3001st words differ - expected: '?', found: '<'
11 Execution timed out 1000 ms 6872 KB Program timed out
12 Execution timed out 1000 ms 10172 KB Program timed out
13 Execution timed out 1000 ms 11096 KB Program timed out
14 Execution timed out 1000 ms 11096 KB Program timed out
15 Execution timed out 1000 ms 11096 KB Program timed out
16 Execution timed out 1000 ms 11096 KB Program timed out
17 Execution timed out 1000 ms 11096 KB Program timed out
18 Execution timed out 1000 ms 11096 KB Program timed out
19 Execution timed out 1000 ms 11096 KB Program timed out
20 Execution timed out 1000 ms 11096 KB Program timed out
21 Execution timed out 1000 ms 11096 KB Program timed out
22 Execution timed out 1000 ms 11096 KB Program timed out
23 Execution timed out 1000 ms 11096 KB Program timed out
24 Execution timed out 1000 ms 11096 KB Program timed out
25 Execution timed out 1000 ms 11096 KB Program timed out