답안 #106375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
106375	2019-04-18T04:44:32 Z	aviroop123	Kralj (COCI16_kralj)	C++14	140 / 140	988 ms	45328 KB

kralj

#include "bits/stdc++.h"
// #include "ext/pb_ds/assoc_container.hpp"
// #include "ext/pb_ds/tree_policy.hpp"
// using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define IO ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pii pair<int,int>
#define sz(x) (int)x.size()
const int mod = 1e9 + 7;
const int mod1 = 998244353;
typedef long double f80;

#ifndef LOCAL
#pragma GCC optimize ("O2")
#define endl '\n'
#endif

// template<typename T>
// using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r){
    uniform_int_distribution<int> uid(l, r);
    return uid(rng);
}

ll pwr(ll a,ll b, ll mod){
	a %= mod;
    int ans = 1;
    while(b){
        if(b & 1) ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 5e5 + 5;
int a[N], b[N], v[N];
int values[N];
vector<int> lol[N];
void solve(){
	int n;
	cin >> n;
	fr(i, 0, n - 1){
		cin >> a[i];
		a[i]--;
	}
	fr(i, 0, n - 1){
		cin >> b[i];
		values[i]--;
	}
	fr(i, 0, n - 1){
		cin >> v[i];
		values[a[i]]++;
		lol[a[i]].pb(v[i]);
	}
	int mini = values[0], idx = 0;
	fr(i, 1, n - 1){
		values[i] += values[i - 1];
		if(values[i] < mini){
			mini = values[i], idx = i;
		}
	}
	multiset<int> s;
	idx++;
	int ans = 0;
	fr(i, idx, idx + n - 1){
		int pp = i % n;
		for(int x : lol[pp]){
			s.insert(x);
		}
		assert(!s.empty());
		auto it = s.upper_bound(b[pp]);
		if(*it < b[pp]){
			s.erase(s.begin());
		}
		else{
			s.erase(it);
			ans++;
		}
	}
	cout << ans;
}
signed main(){
    IO;
    #ifdef LOCAL
        freopen("inp.txt","r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
    int t = 1;
    // cin >> t;
    fr(tt, 1, t){
    	// cout << "Case #" << tt << ": ";
        solve();
    }
    return 0;
}

Subtask #1

140.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	988 ms	38884 KB	Output is correct
2	Correct	603 ms	38248 KB	Output is correct
3	Correct	743 ms	44780 KB	Output is correct
4	Correct	835 ms	45328 KB	Output is correct
5	Correct	427 ms	22520 KB	Output is correct
6	Correct	397 ms	23032 KB	Output is correct
7	Correct	494 ms	25848 KB	Output is correct
8	Correct	467 ms	25240 KB	Output is correct
9	Correct	627 ms	26488 KB	Output is correct
10	Correct	552 ms	23928 KB	Output is correct