oj.uz

답안 #958219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958219 2024-04-05T07:38:04 Z yeediot 돌 무게 재기 (IZhO11_stones) C++17
100 / 100
 37 ms 3920 KB 
#include<bits/stdc++.h>
using namespace std;
const int mxn=1e5+5;
struct node{
    int mx,mn;
};
node operator +(node a,node b){
    return {a.mx>b.mx?a.mx:b.mx,a.mn<b.mn?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 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(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    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";
    }
}

Compilation message

stones.cpp: In member function 'void segtree::modify(int, int, int, int, int, int)':
stones.cpp:33:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |         int mm=l+r>>1;
      |                ~^~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 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 4 ms 2652 KB Output is correct
11 Correct 18 ms 3164 KB Output is correct
12 Correct 29 ms 3672 KB Output is correct
13 Correct 27 ms 3740 KB Output is correct
14 Correct 26 ms 3676 KB Output is correct
15 Correct 29 ms 3668 KB Output is correct
16 Correct 27 ms 3816 KB Output is correct
17 Correct 26 ms 3664 KB Output is correct
18 Correct 27 ms 3676 KB Output is correct
19 Correct 27 ms 3776 KB Output is correct
20 Correct 27 ms 3676 KB Output is correct
21 Correct 29 ms 3912 KB Output is correct
22 Correct 28 ms 3672 KB Output is correct
23 Correct 27 ms 3676 KB Output is correct
24 Correct 27 ms 3664 KB Output is correct
25 Correct 37 ms 3920 KB Output is correct