oj.uz

Submission #499377

# Submission time Handle Problem Language Result Execution time Memory
499377 2021-12-28T08:33:45 Z colossal_pepe medians (balkan11_medians) C++17
15 / 100
 300 ms 1740 KB 
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

int n, a[100005];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    bool mark[2 * n];
    memset(mark, 0, sizeof(mark));
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (not mark[a[i]]) {
            ans.push_back(a[i]);
            mark[a[i]] = 1;
        }
        int kom = 0, beshi = 0;
        for (int j = 1; j < 2 * n; j++) {
            if (mark[j]) {
                if (j < a[i]) kom++;
                else if (j > a[i]) beshi++;
            }
        }
        for (int j = 1; j < 2 * n; j++) {
            if (kom < i and j < a[i] and not mark[j]) {
                ans.push_back(j);
                mark[j] = 1;
                kom++;
            }
            if (beshi < i and j > a[i] and not mark[j]) {
                ans.push_back(j);
                mark[j] = 1;
                beshi++;
            }
        }
    }
    for (int i : ans) {
        cout << i << ' ';
    }
    cout << endl;
    return 0;
}

Compilation message

In file included from /usr/include/string.h:495,
                 from /usr/include/c++/10/cstring:42,
                 from medians.cpp:3:
In function 'void* memset(void*, int, size_t)',
    inlined from 'int main()' at medians.cpp:16:11:
/usr/include/x86_64-linux-gnu/bits/string_fortified.h:71:33: warning: 'void* __builtin_memset(void*, int, long unsigned int)' specified size between 18446744071562067968 and 18446744073709551615 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=]
   71 |   return __builtin___memset_chk (__dest, __ch, __len, __bos0 (__dest));
      |          ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 316 KB Output isn't correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Incorrect 0 ms 316 KB Output isn't correct
6 Correct 0 ms 320 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Incorrect 1 ms 204 KB Output isn't correct
10 Incorrect 1 ms 204 KB Output isn't correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Incorrect 4 ms 328 KB Output isn't correct
13 Incorrect 8 ms 352 KB Output isn't correct

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 376 KB Output isn't correct
2 Incorrect 132 ms 508 KB Output isn't correct
3 Execution timed out 470 ms 492 KB Time limit exceeded
4 Execution timed out 1089 ms 604 KB Time limit exceeded
5 Execution timed out 1049 ms 772 KB Time limit exceeded
6 Execution timed out 1014 ms 1740 KB Time limit exceeded
7 Execution timed out 1073 ms 1528 KB Time limit exceeded