oj.uz

Submission #241994

# Submission time Handle Problem Language Result Execution time Memory
241994 2020-06-26T13:29:00 Z Vimmer Kralj (COCI16_kralj) C++14
0 / 140
 434 ms 28280 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 500501
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

vector <int> g[N];

bool mk[N];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    for (int i = 0; i < n; i++) {int x; cin >> x; x--; g[x].pb(i);}

    int p[n], a[n];

    for (int i = 0; i < n; i++) cin >> p[i];

    for (int i = 0; i < n; i++) cin >> a[i];

    pair <int, int> fnd = {n - 1, n - 1};

    int val = 0;

    for (int i = 0; i < n; i++)
    {
        val += sz(g[i]);

        val--;

        fnd = min(fnd, {val, i});
    }

    multiset <int> se; se.clear();

    int ans = 0;

    for (int i = fnd.S; i < n; i++)
    {
        for (auto it : g[i]) se.insert(a[it]);

        auto it = se.upper_bound(p[i]);

        if (it == se.end()) continue;

        se.erase(se.find(*it));

        ans++;

        mk[i] = 1;
    }

    for (int i = 0; i < fnd.S; i++)
    {
        auto it = se.upper_bound(p[i]);

        if (it == se.end()) continue;

        se.erase(se.find(*it));

        ans++;

        mk[i] = 1;
    }

    for (int i = fnd.S; i < n; i++)
    {
        if (mk[i]) continue;

        auto it = se.upper_bound(p[i]);

        if (it == se.end()) continue;

        se.erase(se.find(*it));

        ans++;

        mk[i] = 1;
    }

    for (int i = 0; i < fnd.S; i++)
    {
        if (mk[i]) continue;

        auto it = se.upper_bound(p[i]);

        if (it == se.end()) continue;

        se.erase(se.find(*it));

        ans++;

        mk[i] = 1;
    }


    cout << ans << endl;
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 16928 KB Output isn't correct
2 Incorrect 148 ms 16872 KB Output isn't correct
3 Incorrect 168 ms 18024 KB Output isn't correct
4 Incorrect 167 ms 18024 KB Output isn't correct
5 Incorrect 222 ms 18932 KB Output isn't correct
6 Incorrect 387 ms 28280 KB Output isn't correct
7 Incorrect 434 ms 22472 KB Output isn't correct
8 Incorrect 304 ms 21880 KB Output isn't correct
9 Incorrect 390 ms 22776 KB Output isn't correct
10 Incorrect 418 ms 20472 KB Output isn't correct