oj.uz

답안 #997963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997963 2024-06-13T07:20:48 Z cnn008 Examination (JOI19_examination) C++17
100 / 100
 367 ms 28788 KB 
#include "bits/stdc++.h"
using namespace std;
 
#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif
 
#define ll long long
 
const int N=1e6+5;
const int mod=1e9+7;
 
struct Point{
	int x,y,z,id,v;
	bool operator < (const Point &o){
		if(x==o.x){
			if(y==o.y) return z>o.z;
			return y>o.y;
		}
		return x<o.x;
	}
};
vector <Point> v,v1;
int n,q,ans[N],ans1[N];
vector <int> compress;
int f(int x){
	return lower_bound(compress.begin(),compress.end(),x)-compress.begin()+1;
}
struct BIT{
	#define gb(x) (x&(-x))
   	int n;
   	vector <int> bit;
   	void init(int _n){
   		bit.resize(_n,0);
   		n=_n;
   	}
   	void update(int pos, int val){
   		int i=pos;
      	for (; i<n; i+=gb(i)) bit[i]+=val;
   	}
   	int get(int pos){
    	int ans=0,i=pos;
      	for (; i; i-=gb(i)) ans+=bit[i];
      	return ans;
   	}
}fw;
void cdq(int l, int r){
	if(l+1==r) return;
	int mid=(l+r)>>1;
	cdq(l,mid);
	cdq(mid,r);
	vector <Point> tmp;
	vector <int> record;
	int a=l,b=mid;
	while(a<mid and b<r){
		if(v[a].y<v[b].y) fw.update(v[a].z,v[a].v),record.push_back(a),tmp.push_back(v[a++]);
		else ans[v[b].id]+=fw.get(v[b].z-1),tmp.push_back(v[b++]); 
	}
	while(a<mid) tmp.push_back(v[a++]);
	while(b<r) ans[v[b].id]+=fw.get(v[b].z-1),tmp.push_back(v[b++]);
	for(auto a:record) fw.update(v[a].z,-v[a].v);
	for(int i=l; i<r; i++) v[i]=tmp[i-l];
	vector <int> ().swap(record);
	vector <Point> ().swap(tmp);
}
void sol(){
	// count pair i j : i_x<j_x, i_x<j_y, i_z<j_z
	fw.init(N);
	cin>>n>>q;
	for(int i=1; i<=n; i++){
		int x,y;
		cin>>x>>y;
		v.push_back({-x,-y,-x-y,0,1});
		compress.push_back(-x);
		compress.push_back(-y);
		compress.push_back(-x-y);
	}
	for(int i=1; i<=q; i++){
		int x,y,z;
		cin>>x>>y>>z;
		v.push_back({-x+1,-y+1,-z+1,i,0});
		compress.push_back(-x+1);
		compress.push_back(-y+1);
		compress.push_back(-z+1);
	}
	sort(compress.begin(),compress.end());
	compress.erase(unique(compress.begin(),compress.end()),compress.end());
	for(auto &[x,y,z,i,v]:v){
		x=f(x);
		y=f(y);
		z=f(z);
	}
	sort(v.begin(),v.end());
	cdq(0,(int)v.size());
	for(int i=1; i<=q; i++) cout<<ans[i]<<"\n";
}
signed main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // freopen(".inp", "r", stdin);
    // freopen(".out", "w", stdout);
    int tt=1;
    //cin>>tt; 
    while(tt--){
    	sol();
    }
    cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    return 0;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

examination.cpp:112:9: warning: "/*" within comment [-Wcomment]
  112 | /**  /\_/\
      |

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 1 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 3 ms 6236 KB Output is correct
7 Correct 9 ms 6744 KB Output is correct
8 Correct 9 ms 6748 KB Output is correct
9 Correct 9 ms 6748 KB Output is correct
10 Correct 9 ms 6748 KB Output is correct
11 Correct 8 ms 6748 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 9 ms 6868 KB Output is correct
14 Correct 9 ms 7004 KB Output is correct
15 Correct 8 ms 6876 KB Output is correct
16 Correct 6 ms 7004 KB Output is correct
17 Correct 8 ms 7040 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 311 ms 25008 KB Output is correct
2 Correct 295 ms 24440 KB Output is correct
3 Correct 289 ms 24692 KB Output is correct
4 Correct 242 ms 24804 KB Output is correct
5 Correct 190 ms 25448 KB Output is correct
6 Correct 148 ms 24696 KB Output is correct
7 Correct 290 ms 24644 KB Output is correct
8 Correct 270 ms 25472 KB Output is correct
9 Correct 265 ms 24516 KB Output is correct
10 Correct 162 ms 24948 KB Output is correct
11 Correct 214 ms 25260 KB Output is correct
12 Correct 113 ms 25540 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 311 ms 25008 KB Output is correct
2 Correct 295 ms 24440 KB Output is correct
3 Correct 289 ms 24692 KB Output is correct
4 Correct 242 ms 24804 KB Output is correct
5 Correct 190 ms 25448 KB Output is correct
6 Correct 148 ms 24696 KB Output is correct
7 Correct 290 ms 24644 KB Output is correct
8 Correct 270 ms 25472 KB Output is correct
9 Correct 265 ms 24516 KB Output is correct
10 Correct 162 ms 24948 KB Output is correct
11 Correct 214 ms 25260 KB Output is correct
12 Correct 113 ms 25540 KB Output is correct
13 Correct 329 ms 25108 KB Output is correct
14 Correct 325 ms 26740 KB Output is correct
15 Correct 312 ms 27264 KB Output is correct
16 Correct 294 ms 26736 KB Output is correct
17 Correct 215 ms 26228 KB Output is correct
18 Correct 161 ms 26092 KB Output is correct
19 Correct 355 ms 27004 KB Output is correct
20 Correct 329 ms 26992 KB Output is correct
21 Correct 334 ms 26592 KB Output is correct
22 Correct 180 ms 26176 KB Output is correct
23 Correct 224 ms 26004 KB Output is correct
24 Correct 110 ms 26076 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 1 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6236 KB Output is correct
6 Correct 3 ms 6236 KB Output is correct
7 Correct 9 ms 6744 KB Output is correct
8 Correct 9 ms 6748 KB Output is correct
9 Correct 9 ms 6748 KB Output is correct
10 Correct 9 ms 6748 KB Output is correct
11 Correct 8 ms 6748 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 9 ms 6868 KB Output is correct
14 Correct 9 ms 7004 KB Output is correct
15 Correct 8 ms 6876 KB Output is correct
16 Correct 6 ms 7004 KB Output is correct
17 Correct 8 ms 7040 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct
19 Correct 311 ms 25008 KB Output is correct
20 Correct 295 ms 24440 KB Output is correct
21 Correct 289 ms 24692 KB Output is correct
22 Correct 242 ms 24804 KB Output is correct
23 Correct 190 ms 25448 KB Output is correct
24 Correct 148 ms 24696 KB Output is correct
25 Correct 290 ms 24644 KB Output is correct
26 Correct 270 ms 25472 KB Output is correct
27 Correct 265 ms 24516 KB Output is correct
28 Correct 162 ms 24948 KB Output is correct
29 Correct 214 ms 25260 KB Output is correct
30 Correct 113 ms 25540 KB Output is correct
31 Correct 329 ms 25108 KB Output is correct
32 Correct 325 ms 26740 KB Output is correct
33 Correct 312 ms 27264 KB Output is correct
34 Correct 294 ms 26736 KB Output is correct
35 Correct 215 ms 26228 KB Output is correct
36 Correct 161 ms 26092 KB Output is correct
37 Correct 355 ms 27004 KB Output is correct
38 Correct 329 ms 26992 KB Output is correct
39 Correct 334 ms 26592 KB Output is correct
40 Correct 180 ms 26176 KB Output is correct
41 Correct 224 ms 26004 KB Output is correct
42 Correct 110 ms 26076 KB Output is correct
43 Correct 357 ms 28788 KB Output is correct
44 Correct 367 ms 27256 KB Output is correct
45 Correct 358 ms 28204 KB Output is correct
46 Correct 294 ms 26740 KB Output is correct
47 Correct 239 ms 27252 KB Output is correct
48 Correct 144 ms 26724 KB Output is correct
49 Correct 366 ms 27000 KB Output is correct
50 Correct 361 ms 28208 KB Output is correct
51 Correct 343 ms 28592 KB Output is correct
52 Correct 214 ms 26424 KB Output is correct
53 Correct 225 ms 26336 KB Output is correct