oj.uz

Submission #145484

# Submission time Handle Problem Language Result Execution time Memory
145484 2019-08-20T08:47:02 Z MKopchev medians (balkan11_medians) C++14
70 / 100
 300 ms 10104 KB 
#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;
}

Compilation message

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.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 27 ms 376 KB Output is correct

Subtask #2
5.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 504 KB Output is correct
2 Execution timed out 483 ms 1152 KB Time limit exceeded
3 Execution timed out 1078 ms 1280 KB Time limit exceeded
4 Execution timed out 1077 ms 2040 KB Time limit exceeded
5 Execution timed out 1095 ms 3448 KB Time limit exceeded
6 Execution timed out 1079 ms 6524 KB Time limit exceeded
7 Execution timed out 1083 ms 10104 KB Time limit exceeded