oj.uz

Submission #480780

# Submission time Handle Problem Language Result Execution time Memory
480780 2021-10-18T03:42:22 Z duchung medians (balkan11_medians) C++17
100 / 100
 48 ms 2564 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;

int n;
int bit[N];
bool used[N];

void update(int idx , int val)
{
    for (idx ; idx <= 2 * n - 1 ; idx += idx & -idx) bit[idx] += 1;
}

int get(int idx)
{
    int ret = 0;
    for (idx ; idx >= 1 ; idx -= idx & -idx) ret += bit[idx];
    return ret;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    int pt1 = 1 , pt2 = 2 * n - 1;
    for (int sz = 1 ; sz <= 2 * n - 1 ; sz += 2)
    {
        int tmp;
        cin >> tmp;

        if (!used[tmp])
        {
            used[tmp] = true;
            update(tmp , 1);
            cout << tmp << " ";
        }

        while(get(tmp - 1) < sz / 2)
        {
            while(used[pt1]) ++pt1;
            used[pt1] = true;
            update(pt1 , 1);
            cout << pt1 << " ";
        }

        while(get(2 * n - 1) - get(tmp) < sz / 2)
        {
            while(used[pt2]) --pt2;
            used[pt2] = true;
            update(pt2 , 1);
            cout << pt2 << " ";
        }


    }

}

Compilation message

medians.cpp: In function 'void update(int, int)':
medians.cpp:12:10: warning: statement has no effect [-Wunused-value]
   12 |     for (idx ; idx <= 2 * n - 1 ; idx += idx & -idx) bit[idx] += 1;
      |          ^~~
medians.cpp: In function 'int get(int)':
medians.cpp:18:10: warning: statement has no effect [-Wunused-value]
   18 |     for (idx ; idx >= 1 ; idx -= idx & -idx) ret += bit[idx];
      |          ^~~

Subtask #1
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 7 ms 588 KB Output is correct
5 Correct 13 ms 924 KB Output is correct
6 Correct 29 ms 1712 KB Output is correct
7 Correct 48 ms 2564 KB Output is correct