Submission #246425

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
246425	2020-07-09T09:08:34 Z	leaked	Kralj (COCI16_kralj)	C++14	140 / 140	712 ms	51052 KB

kralj

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=17;
const int M=999999937;

signed main(){
    fast_io;
    int n;
    cin>>n;
    multiset<int>st;
    vector<int>a(n),b(n);
    vector<vector<int>>g(n,vector<int>());
    int x;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        cin>>b[i];
    }
    for(int i=0;i<n;i++){
        cin>>x;
        g[a[i]-1].p_b(x);
    }
    pii mn={1e9,1e9};
    int pi=0;
    for(int i=0;i<n;i++){
        pi+=sz(g[i]);
        pi--;
        mn=min(mn,{pi,i});
    }
    int k=mn.s+1;k%=n;
    int ans=0;
    while(k!=mn.s){
        for(auto &z : g[k]) st.insert(z);
        auto it=st.upper_bound(b[k]);
        if(it==st.end()) st.erase(st.begin());
        else ans++,st.erase(it);
        k++;k%=n;
    }
    if(*st.begin()>b[k])ans++;
    cout<<ans;
    return 0;
}
///stuff you should look for :
/*
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* read the conditions carefully
	* WRITE STUFF DOWN
*/

Subtask #1

140.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	712 ms	41984 KB	Output is correct
2	Correct	433 ms	40556 KB	Output is correct
3	Correct	616 ms	50284 KB	Output is correct
4	Correct	578 ms	51052 KB	Output is correct
5	Correct	428 ms	29688 KB	Output is correct
6	Correct	398 ms	29304 KB	Output is correct
7	Correct	442 ms	33656 KB	Output is correct
8	Correct	380 ms	31264 KB	Output is correct
9	Correct	468 ms	35708 KB	Output is correct
10	Correct	403 ms	31864 KB	Output is correct