oj.uz

Submission #86991

# Submission time Handle Problem Language Result Execution time Memory
86991 2018-11-29T05:20:35 Z abil Weighting stones (IZhO11_stones) C++14
0 / 100
 3 ms 256 KB 
/**
   Solution by Abil
**/
#include <bits/stdc++.h>

using namespace std;

const int N = 300000 + 12;
int x[N],y[N];
map<int,int > mpx,mpy;
int main()
{
    int n,ans1 = 0,ans2 = 0;
    cin >> n;
    int ves,dir;
    while(n--){
      cin >> ves >> dir;
      if(dir == 1){
        ans1 += ves;
      }
      else{
        ans2 += ves;
      }
      if(ans1 == ans2){
        cout << "?" << endl;
      }
      else
      if(ans1 > ans2){
        cout << ">" << endl;
      }
      else{
        cout << "<" << endl;
      }
    }
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -