oj.uz

답안 #48427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
48427 2018-05-13T09:56:43 Z ernestvw 돌 무게 재기 (IZhO11_stones) C++11
0 / 100
 4 ms 3448 KB 
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
const int maxn = 1<<17;

class SegmentTree {
public:
    int n;
    vi sum,minsuffix,maxsuffix;
    SegmentTree(int _n) : n(_n), sum(2*_n,0),
        minsuffix(2*_n,0), maxsuffix(2*_n,0) {}
    void update(int i,int v) {
        i+=n;
        maxsuffix[i]=minsuffix[i]=sum[i]=v;
        while((i/=2)>0) {
            sum[i]=sum[2*i]+sum[2*i+1];
            minsuffix[i]=min(minsuffix[2*i]+sum[2*i+1],minsuffix[2*i+1]);
            maxsuffix[i]=max(maxsuffix[2*i]+sum[2*i+1],maxsuffix[2*i+1]);
        }
    }
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int N;
    cin>>N;
    SegmentTree segTree(maxn);
    for(int i=1;i<=N;i++) {
        int w;
        int s;
        cin>>w>>s;
        segTree.update(w-1, s==1 ? 1 : -1);
        bool rHeavier = segTree.minsuffix[1]<0;
        bool lHeavier = segTree.maxsuffix[1]>0;
        if(rHeavier && lHeavier) cout<<'?'<<endl;
        else if(rHeavier) cout<<'>'<<endl;
        else if(lHeavier) cout<<'<'<<endl;
    }
    
    return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 3448 KB Output isn't correct
2 Halted 0 ms 0 KB -