oj.uz

답안 #242001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242001 2020-06-26T13:33:55 Z Vimmer Kralj (COCI16_kralj) C++14
140 / 140
 661 ms 41448 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;

    fnd.S++;

    if (fnd.S == n) fnd.S = 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()) {se.erase(se.begin()); continue;}

        se.erase(it);

        ans++;
    }

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

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

        if (it == se.end()) {se.erase(se.begin()); continue;}

        se.erase(it);

        ans++;
    }


    cout << ans << endl;
}

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 661 ms 35752 KB Output is correct
2 Correct 425 ms 35136 KB Output is correct
3 Correct 540 ms 40680 KB Output is correct
4 Correct 639 ms 41448 KB Output is correct
5 Correct 396 ms 18936 KB Output is correct
6 Correct 318 ms 19320 KB Output is correct
7 Correct 451 ms 22044 KB Output is correct
8 Correct 386 ms 21964 KB Output is correct
9 Correct 495 ms 22648 KB Output is correct
10 Correct 419 ms 20092 KB Output is correct