#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
struct node{
int mx,mn;
};
node operator +(node a,node b){
return {max(a.mx,b.mx),min(a.mn,b.mn)};
}
int n;
struct segtree{
node seg[4*mxn];
int tag[4*mxn];
void add(int id,int v){
seg[id].mx+=v;
seg[id].mn+=v;
tag[id]+=v;
}
void push(int id){
if(tag[id]==0)
return;
add(id*2,tag[id]);
add(id*2+1,tag[id]);
tag[id]=0;
}
void build(int l,int r,int id){
seg[id].mx=seg[id].mn=tag[id]=0;
if(l==r){
return;
}
int mm=l+r>>1;
build(l,mm,id*2);
build(mm+1,r,id*2+1);
}
void modify(int l,int r,int id,int ql,int qr,int v){
if(qr<l or r<ql){
return;
}
if(ql<=l and r<=qr){
add(id,v);
return;
}
int mm=l+r>>1;
push(id);
modify(l,mm,id*2,ql,qr,v);
modify(mm+1,r,id*2+1,ql,qr,v);
seg[id]=seg[id*2]+seg[id*2+1];
}
void modify(int l,int r,int v){
modify(1,n,1,l,r,v);
}
}tr;
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
//tr.build(1,n,1);
for(int i=1;i<=n;i++){
int c,s;
cin>>c>>s;
s=(s==1?1:-1);
tr.modify(1,c,s);
if(tr.seg[1].mn>=0)
cout<<">\n";
else if(tr.seg[1].mx<=0)
cout<<"<\n";
else
cout<<"?\n";
}
}
/*
input:
*/
Compilation message
stones.cpp: In member function 'void segtree::build(int, int, int)':
stones.cpp:81:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
81 | int mm=l+r>>1;
| ~^~
stones.cpp: In member function 'void segtree::modify(int, int, int, int, int, int)':
stones.cpp:93:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
93 | int mm=l+r>>1;
| ~^~
stones.cpp: In function 'void setIO(std::string)':
stones.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
2652 KB |
Output is correct |
| 11 |
Correct |
25 ms |
3288 KB |
Output is correct |
| 12 |
Correct |
29 ms |
3676 KB |
Output is correct |
| 13 |
Correct |
28 ms |
3664 KB |
Output is correct |
| 14 |
Correct |
28 ms |
3676 KB |
Output is correct |
| 15 |
Correct |
30 ms |
3676 KB |
Output is correct |
| 16 |
Correct |
29 ms |
3664 KB |
Output is correct |
| 17 |
Correct |
28 ms |
3664 KB |
Output is correct |
| 18 |
Correct |
31 ms |
3676 KB |
Output is correct |
| 19 |
Correct |
30 ms |
3668 KB |
Output is correct |
| 20 |
Correct |
28 ms |
3672 KB |
Output is correct |
| 21 |
Correct |
28 ms |
3756 KB |
Output is correct |
| 22 |
Correct |
29 ms |
3664 KB |
Output is correct |
| 23 |
Correct |
31 ms |
3676 KB |
Output is correct |
| 24 |
Correct |
30 ms |
3912 KB |
Output is correct |
| 25 |
Correct |
30 ms |
3668 KB |
Output is correct |
