oj.uz

답안 #932330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932330 2024-02-23T08:14:40 Z Baizho Examination (JOI19_examination) C++17
43 / 100
 1512 ms 123252 KB 
#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 * 4];

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

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.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 35676 KB Output is correct
2 Correct 24 ms 35932 KB Output is correct
3 Correct 18 ms 35676 KB Output is correct
4 Correct 19 ms 35868 KB Output is correct
5 Correct 19 ms 35676 KB Output is correct
6 Correct 19 ms 35672 KB Output is correct
7 Correct 31 ms 37724 KB Output is correct
8 Correct 31 ms 37868 KB Output is correct
9 Correct 30 ms 37724 KB Output is correct
10 Correct 23 ms 36444 KB Output is correct
11 Correct 34 ms 37724 KB Output is correct
12 Correct 27 ms 36444 KB Output is correct
13 Correct 33 ms 37716 KB Output is correct
14 Correct 31 ms 37844 KB Output is correct
15 Correct 30 ms 37716 KB Output is correct
16 Correct 28 ms 37724 KB Output is correct
17 Correct 21 ms 36184 KB Output is correct
18 Correct 27 ms 36184 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1271 ms 123024 KB Output is correct
2 Correct 1245 ms 122980 KB Output is correct
3 Correct 1260 ms 123056 KB Output is correct
4 Correct 241 ms 62028 KB Output is correct
5 Correct 930 ms 122436 KB Output is correct
6 Correct 209 ms 61468 KB Output is correct
7 Correct 1296 ms 122280 KB Output is correct
8 Correct 1168 ms 120828 KB Output is correct
9 Correct 1172 ms 119924 KB Output is correct
10 Correct 820 ms 121668 KB Output is correct
11 Correct 131 ms 50144 KB Output is correct
12 Correct 222 ms 53140 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1271 ms 123024 KB Output is correct
2 Correct 1245 ms 122980 KB Output is correct
3 Correct 1260 ms 123056 KB Output is correct
4 Correct 241 ms 62028 KB Output is correct
5 Correct 930 ms 122436 KB Output is correct
6 Correct 209 ms 61468 KB Output is correct
7 Correct 1296 ms 122280 KB Output is correct
8 Correct 1168 ms 120828 KB Output is correct
9 Correct 1172 ms 119924 KB Output is correct
10 Correct 820 ms 121668 KB Output is correct
11 Correct 131 ms 50144 KB Output is correct
12 Correct 222 ms 53140 KB Output is correct
13 Correct 1372 ms 123012 KB Output is correct
14 Correct 1279 ms 122936 KB Output is correct
15 Correct 1288 ms 123252 KB Output is correct
16 Correct 295 ms 62276 KB Output is correct
17 Correct 1008 ms 122288 KB Output is correct
18 Correct 208 ms 61308 KB Output is correct
19 Correct 1412 ms 123204 KB Output is correct
20 Correct 1362 ms 123040 KB Output is correct
21 Correct 1512 ms 121800 KB Output is correct
22 Correct 790 ms 121392 KB Output is correct
23 Correct 126 ms 50112 KB Output is correct
24 Correct 224 ms 53256 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 35676 KB Output is correct
2 Correct 24 ms 35932 KB Output is correct
3 Correct 18 ms 35676 KB Output is correct
4 Correct 19 ms 35868 KB Output is correct
5 Correct 19 ms 35676 KB Output is correct
6 Correct 19 ms 35672 KB Output is correct
7 Correct 31 ms 37724 KB Output is correct
8 Correct 31 ms 37868 KB Output is correct
9 Correct 30 ms 37724 KB Output is correct
10 Correct 23 ms 36444 KB Output is correct
11 Correct 34 ms 37724 KB Output is correct
12 Correct 27 ms 36444 KB Output is correct
13 Correct 33 ms 37716 KB Output is correct
14 Correct 31 ms 37844 KB Output is correct
15 Correct 30 ms 37716 KB Output is correct
16 Correct 28 ms 37724 KB Output is correct
17 Correct 21 ms 36184 KB Output is correct
18 Correct 27 ms 36184 KB Output is correct
19 Correct 1271 ms 123024 KB Output is correct
20 Correct 1245 ms 122980 KB Output is correct
21 Correct 1260 ms 123056 KB Output is correct
22 Correct 241 ms 62028 KB Output is correct
23 Correct 930 ms 122436 KB Output is correct
24 Correct 209 ms 61468 KB Output is correct
25 Correct 1296 ms 122280 KB Output is correct
26 Correct 1168 ms 120828 KB Output is correct
27 Correct 1172 ms 119924 KB Output is correct
28 Correct 820 ms 121668 KB Output is correct
29 Correct 131 ms 50144 KB Output is correct
30 Correct 222 ms 53140 KB Output is correct
31 Correct 1372 ms 123012 KB Output is correct
32 Correct 1279 ms 122936 KB Output is correct
33 Correct 1288 ms 123252 KB Output is correct
34 Correct 295 ms 62276 KB Output is correct
35 Correct 1008 ms 122288 KB Output is correct
36 Correct 208 ms 61308 KB Output is correct
37 Correct 1412 ms 123204 KB Output is correct
38 Correct 1362 ms 123040 KB Output is correct
39 Correct 1512 ms 121800 KB Output is correct
40 Correct 790 ms 121392 KB Output is correct
41 Correct 126 ms 50112 KB Output is correct
42 Correct 224 ms 53256 KB Output is correct
43 Runtime error 146 ms 80880 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -