제출 #145484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145484		MKopchev	중앙값 배열 (balkan11_medians)	C++14	70 / 100	1095 ms	10104 KiB

medians

#include<bits/stdc++.h>
using namespace std;
const int nmax=2e5+42;
int n,inp[nmax];
int output[nmax];

set<int> active;

map<int,int> seen;
int get_front(int now)
{
    set<int>::iterator it=lower_bound(active.begin(),active.end(),now);
    it--;
    int num=*it;
    active.erase(it);
    return num;
}
int get_back(int now)
{
    set<int>::iterator it=lower_bound(active.begin(),active.end(),now);
    int num=*it;
    active.erase(it);
    return num;
}
int main()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
        scanf("%i",&inp[i]);

    for(int i=1;i<=2*n-1;i++)
        active.insert(i);

    output[1]=inp[1];

    for(int i=1;i<n;i++)
    {
        seen[inp[i]]++;
        active.erase(inp[i]);
    }

    for(int i=n-1;i>=1;i--)
    {
        if(inp[i]<inp[i+1])
        {
            output[2*i+1]=get_back(inp[i]);
            output[2*i]=get_back(inp[i]);
        }
        else if(inp[i]>inp[i+1])
        {
            output[2*i+1]=get_front(inp[i]);
            output[2*i]=get_front(inp[i]);
        }
        else
        {
            output[2*i+1]=get_back(inp[i]);
            output[2*i]=get_front(inp[i]);
        }
        seen[inp[i]]--;
        if(seen[inp[i]]==0)
            active.insert(inp[i]);
    }
    for(int i=1;i<=2*n-1;i++)
        printf("%i ",output[i]);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

medians.cpp: In function 'int main()':
medians.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
medians.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&inp[i]);
         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 65 / 65
• Subtask 2: 5 / 35