Submission #932334

#	Time	Username	Problem	Language	Result	Execution time	Memory
932334		Baizho	Examination (JOI19_examination)	C++14	100 / 100	1563 ms	165124 KiB

examination

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, q, ans[N], x[N], y[N], cy[N], a[N], b[N], cb[N], c[N], lim;
vector<int> qu[N];

ordered_set t[N * 8];

void update(int v, int tl, int tr, int p, int x) {
	t[v].insert(x);
	if(tl == tr) return;
	int tm = (tl + tr) / 2;
	if(p <= tm) update(v + v, tl, tm, p, x);
	else update(v + v + 1, tm + 1, tr, p, x);
}

int get(int v, int tl, int tr, int l, int r, int x) {
	if(tl > r || l > tr) return 0;
	if(l <= tl && tr <= r) return int(t[v].size()) - int(t[v].order_of_key(x));
	int tm = (tl + tr) / 2;
	return get(v + v, tl, tm, l, r, x) + get(v + v + 1, tm + 1, tr, l, r, x);
}

void Baizho() {
	cin>>n>>q;
	vector<int> comp;
	vector<pair<int, int> > range;
	for(int i = 1; i <= n; i ++) {
		cin>>x[i]>>y[i];
		range.pb({x[i], y[i]});
		comp.pb(y[i]);
	}
	sort(all(range));
	for(int i = 1; i <= n; i ++) {
		x[i] = range[i - 1].ff, y[i] = range[i - 1].ss;
	}
	for(int i = 1; i <= q; i ++) {
		cin>>a[i]>>b[i]>>c[i];
		comp.pb(b[i]);
		if(x[n] < a[i]) continue;
		// find position j such that x_j >= a
		int l = 1, r = n;
		while(l <= r) {
			int mid = (l + r) / 2;
			if(a[i] <= x[mid]) r = mid - 1;
			else l = mid + 1;
		} r += 1;
		qu[r].pb(i);
	}
	sort(all(comp));
	comp.erase(unique(all(comp)), comp.end());
	lim = comp.size();
	for(int i = 1; i <= max(n, q); i ++) {
		if(i <= n) cy[i] = upper_bound(all(comp), y[i]) - comp.begin();
		if(i <= q) cb[i] = upper_bound(all(comp), b[i]) - comp.begin();
	}
	for(int i = n; i >= 1; i --) {
		// add this
		update(1, 1, lim, cy[i], x[i] + y[i]);
		for(auto p : qu[i]) {
			// how many positions from cb...lim that have values >= c[i]
//			cout<<i<<" "<<p<<endl;
			ans[p] = get(1, 1, lim, cb[p], lim, c[p]);
		}
	}
	for(int i = 1; i <= q; i ++) cout<<ans[i]<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

examination.cpp: In function 'void Freopen(std::string)':
examination.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 57 / 57