#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
void solve(int test_case){
int i, j;
cin >> n;
int mxl=0, mxr=0;
int cl=0, cr=0;
set<int> s1, s2;
for(i=0;i<n;i++){
int r, s;
cin >> r >> s;
if(s == 1){
mxl = max(mxl, r);
cl++;
s1.insert(r);
}else {
mxr = max(mxr, r);
cr++;
s2.insert(r);
}
if(cl == 0){
cout << "<\n";
}else if(cr == 0){
cout << ">\n";
}
else if(mxl > mxr){
int val = (*s1.rbegin())-(*s1.begin())+1;
if(val == s1.size() || cl > cr)cout << ">\n";
else cout << "?\n";
}else {
int val = (*s2.rbegin())-(*s2.begin())+1;
if(val == s2.size() || cr > cl)cout << "<\n";
else cout << "?\n";
}
}
return;
}
signed main(){
FASTIO;
#define MULTITEST 0
#if MULTITEST
int ___T;
cin >> ___T;
for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
solve(T_CASE);
#else
solve(1);
#endif
return 0;
}
Compilation message
stones.cpp: In function 'void solve(long long int)':
stones.cpp:41:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | if(val == s1.size() || cl > cr)cout << ">\n";
| ~~~~^~~~~~~~~~~~
stones.cpp:45:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | if(val == s2.size() || cr > cl)cout << "<\n";
| ~~~~^~~~~~~~~~~~
stones.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
17 | int i, j;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
