Submission #225799

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
225799	2020-04-21T17:17:48 Z	osaaateiasavtnl	Kralj (COCI16_kralj)	C++14	56 / 140	949 ms	72796 KB

kralj

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
 
const int N = 5e5 + 7;
int a[N], p1[N], p2[N];
set <int> add[N];

bool comp(int i, int j) {
    return p1[i] > p1[j];
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }   
    for (int i = 1; i <= n; ++i)
        cin >> p1[i];
    for (int i = 1; i <= n; ++i) {
        cin >> p2[i];
        add[a[i]].insert(p2[i]);
    }
    vector <int> per;
    for (int i = 1; i <= n; ++i)
        per.app(i);
    sort(all(per), comp);
    int ans = 0;         

    set <int> can;
    for (int i = 1; i <= n; ++i)
        if (add[i].size())
            can.insert(i);

    for (int i : per) {
        int j;

        {
        auto t = can.upper_bound(i);
        if (t == can.begin()) {
            j = *can.rbegin();
        }   
        else {
            j = *prev(t);
        }
        }   

        auto t = add[j].upper_bound(p1[i]);
        if (t != add[j].end()) {
            ++ans;
            add[j].erase(t);
        }   
        else {
            add[j].erase(add[j].begin());
        }

        if (add[j].empty())
            can.erase(j);
    }   
    cout << ans << endl;
}

Subtask #1

56.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	544 ms	57268 KB	Output is correct
2	Correct	498 ms	56556 KB	Output is correct
3	Correct	664 ms	63340 KB	Output is correct
4	Correct	676 ms	64232 KB	Output is correct
5	Incorrect	817 ms	60896 KB	Output isn't correct
6	Incorrect	781 ms	62392 KB	Output isn't correct
7	Incorrect	880 ms	70304 KB	Output isn't correct
8	Incorrect	798 ms	67268 KB	Output isn't correct
9	Incorrect	949 ms	72796 KB	Output isn't correct
10	Incorrect	889 ms	66024 KB	Output isn't correct