oj.uz

답안 #225795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225795 2020-04-21T16:41:46 Z osaaateiasavtnl Kralj (COCI16_kralj) C++14
0 / 140
 2000 ms 63464 KB 
#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;         
    for (int i : per) {
        int j = i;
        while (add[j].empty()) {
            --j;
            if (j == 0)
                j = n;
        }   
        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());
        }   
    }   
    cout << ans << endl;
}

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2086 ms 56424 KB Time limit exceeded
2 Execution timed out 2092 ms 55788 KB Time limit exceeded
3 Execution timed out 2091 ms 62472 KB Time limit exceeded
4 Execution timed out 2092 ms 63340 KB Time limit exceeded
5 Execution timed out 2097 ms 60136 KB Time limit exceeded
6 Incorrect 1583 ms 60008 KB Output isn't correct
7 Incorrect 1576 ms 61288 KB Output isn't correct
8 Incorrect 952 ms 57960 KB Output isn't correct
9 Incorrect 1342 ms 63340 KB Output isn't correct
10 Execution timed out 2096 ms 63464 KB Time limit exceeded