oj.uz

답안 #372801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372801 2021-03-01T19:02:24 Z iliccmarko 중앙값 배열 (balkan11_medians) C++14
5 / 100
 141 ms 4452 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define input(n, v) {for(int i = 0;i<n;i++) cin>>v[i];}
#define output(n, v) {for(int i = 0;i<n;i++) cout<<v[i]<<" "; cout<<endl;}
#define single_case solve();
#define line cout<<"------------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); }
const int N = 2e5 + 50;
int seg[4*N];
int n;
int b[N];
vector<int> a;

void update(int node, int l, int r, int pos)
{
    if(l==r){
        seg[node] = 1;
        return;
    }
    int mid = (l+r)/2;
    if(pos>mid) update(node*2+2, mid+1, r, pos);
    else update(node*2+1, l, mid, pos);
}

int get_sum(int node, int l, int r, int i, int j)
{
    if(i>r||j<r) return 0;
    if(i>=l&&j<=r) return seg[node];
    int mid = (i+j)/2;
    return get_sum(node*2+1, l, r, i, mid) + get_sum(node*2+2, l, r, mid+1, j);
}



int main()
{
    ios
    cin>>n;
    for(int i = 0;i<n;i++) cin>>b[i];
    update(0, 0, 2*n, b[0]);
    a.pb(b[0]);
    int l = 1;
    if(b[0]==1) l++;
    int r = 2*n-1;
    if(b[0]==2*n-1) r--;
    for(int i = 1;i<n;i++)
    {
        int x = b[i];
        int cl = get_sum(0, 0, x-1, 0, 2*n);
        int cr = get_sum(0, x+1, 2*n, 0, 2*n);
        if(cl==cr)
        {
            while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
            a.pb(l);
            a.pb(r);
            update(0, 0, 2*n, l);
            update(0, 0, 2*n, r);
            l++;
            r--;
            while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
        }
        else if(cl>cr)
        {
            if(!get_sum(0, x, x, 0, 2*n))
            {
                while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
                a.pb(x);
                a.pb(r);
                update(0, 0, 2*n, x);
                update(0, 0, 2*n, r);
                r--;
                while(get_sum(0, r, r, 0, 2*n)) r--;
            }
            else
            {
                while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
                a.pb(r);
                update(0, 0, 2*n, r);
                r--;
                while(get_sum(0, r, r, 0, 2*n)) r--;
                update(0, 0, 2*n, r);
                a.pb(r);
                r--;
                while(get_sum(0, r, r, 0, 2*n)) r--;
            }
        }
        else
        {
            if(!get_sum(0, x, x, 0, 2*n))
            {
                while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
                a.pb(x);
                a.pb(l);
                update(0, 0, 2*n, x);
                update(0, 0, 2*n, l);
                l++;
                while(get_sum(0, l, l, 0, 2*n)) l++;
            }
            else
            {
                while(get_sum(0, l, l, 0, 2*n)) l++;
            while(get_sum(0, r, r, 0, 2*n)) r--;
                a.pb(l);
                update(0, 0, 2*n, l);
                l++;
                while(get_sum(0, l, l, 0, 2*n)) l++;
                update(0, 0, 2*n, l);
                a.pb(l);
                l++;
                while(get_sum(0, l, l, 0, 2*n)) l++;
            }
        }
    }

    for(int x : a)
        cout<<x<<" ";




    return 0;
}

Subtask #1
5.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 0 ms 364 KB Output isn't correct
8 Incorrect 1 ms 364 KB Output isn't correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Incorrect 2 ms 364 KB Output isn't correct
13 Incorrect 2 ms 364 KB Output isn't correct

Subtask #2
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Output isn't correct
2 Incorrect 5 ms 492 KB Output isn't correct
3 Incorrect 10 ms 748 KB Output isn't correct
4 Incorrect 21 ms 1004 KB Output isn't correct
5 Incorrect 42 ms 1648 KB Output isn't correct
6 Incorrect 86 ms 2792 KB Output isn't correct
7 Incorrect 141 ms 4452 KB Output isn't correct