oj.uz

Submission #850538

# Submission time Handle Problem Language Result Execution time Memory
850538 2023-09-16T21:08:24 Z TB_ Kralj (COCI16_kralj) C++17
0 / 140
 2000 ms 63056 KB 
#include <bits/stdc++.h>
using namespace std;

#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n;
    cin >> n;
    vl p(n), v(n), to(n);
    fo(i, n)cin >> to[i];
    fo(i, n)cin >> p[i];
    fo(i, n)cin >> v[i];

    vector<set<ll>> at(n);
    fo(i, n){
        at[--to[i]].insert(v[i]);
    }
    vl current(n, -1);
    fo(_, 2){
        fo(i, n){
            if(!at[i].size()) continue;
            if(current[i] != -1) at[i].insert(current[i]);
            auto it = upper_bound(all(at[i]), p[i]);
            if(it == at[i].end()) it = at[i].begin();
            current[i] = *it;
            at[i].erase(it);
            if(at[i].size() > at[(i+1)%n].size()) swap(at[i], at[(i+1)%n]);
            for(auto v : at[i]) at[(i+1)%n].insert(v);
            at[i].clear();
        }
    }
    int ans = 0;
    fo(i, n) ans += current[i]>p[i];
    cout << ans;


    exit(0);
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 50572 KB Time limit exceeded
2 Execution timed out 2045 ms 49260 KB Time limit exceeded
3 Execution timed out 2057 ms 61552 KB Time limit exceeded
4 Execution timed out 2053 ms 62932 KB Time limit exceeded
5 Execution timed out 2037 ms 57172 KB Time limit exceeded
6 Execution timed out 2013 ms 56964 KB Time limit exceeded
7 Execution timed out 2044 ms 59400 KB Time limit exceeded
8 Execution timed out 2041 ms 53328 KB Time limit exceeded
9 Execution timed out 2037 ms 63056 KB Time limit exceeded
10 Execution timed out 2029 ms 63056 KB Time limit exceeded