# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609571 | Soul234 | Kralj (COCI16_kralj) | C++14 | 517 ms | 53072 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
tcT> bool ckmin(T&a, const T&b) {
return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
return b > a ? a=b,1 : 0; }
const int MOD = 1e9 + 7;
const int MX = 5e5+5;
int N, pos[MX], dStren[MX];
int prf[MX];
vi lst[MX];
void solve() {
memset(prf, -1, sizeof prf);
cin>>N;
F0R(i,N) cin>>pos[i], pos[i]--;
F0R(i,N) cin>>dStren[i];
F0R(i,N) {
int x; cin>>x;
lst[pos[i]].pb(x);
}
F0R(i,N) prf[pos[i]]++;
pi mn = {MOD, MOD};
F0R(i,N) {
if(i) prf[i] += prf[i-1];
ckmin(mn, {prf[i], i});
}
int st = (mn.second + 1)%N;
set<int> s;
int ans = 0;
F0R(_,N) {
each(val, lst[st]) s.insert(val);
auto it = s.upper_bound(dStren[st]);
if(it == s.end()) s.erase(s.begin());
else {
++ans;
s.erase(it);
}
st = (st+1)%N;
}
cout << ans << nl;
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |