oj.uz

답안 #839498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839498 2023-08-30T08:06:14 Z vjudge1 Examination (JOI19_examination) C++17
100 / 100
 766 ms 59192 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef stack<int> si;
typedef queue<int> qi;
typedef deque<int> di;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

#define endl '\n'
#define pb push_back
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define BACK(i,a,b) for(int i = a; i >= b; i--)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define fi first
#define se second
#define gcd __gcd
#define setmin(x,y) x=min((x),(y))
#define setmax(x,y) x=max((x),(y))

const int MAXN=1e5+5;
const long long inf=1e18;
const int MOD=1e9+7;

struct query
{
	int x,y,z,idx;
	query(const int& x,const int& y,const int& z,const int& idx):x(x),y(y),z(z),idx(idx){}
	bool operator <(const query& other) {return z>other.z;}
};

struct stud
{
	int s,t;
	stud(const int& s,const int& t):s(s),t(t){}
	bool operator <(const stud& other) {return s+t>other.s+other.t;}
};

vector<query> q;
vector<stud> st;
int n,m,ans[MAXN];
vector<int> xs,ys;
vector<vector<int>> node,bit;

void fakeupd(int x,int y)
{
	for(;x<=xs.size();x+=x&-x) node[x].pb(y);
}

void fakeget(int x,int y)
{
	for(;x>0;x-=x&-x) node[x].pb(y);
}

void upd(int x,int yy)
{
	for(;x<=xs.size();x+=x&-x) for(int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y) bit[x][y-1]++;
}

int get(int x,int yy)
{
	int res=0;
	for(;x>0;x-=x&-x) for(int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y>0;y-=y&-y) res+=bit[x][y-1];
	return res;
}

int xid(const int& x)
{
	return lower_bound(xs.begin(),xs.end(),x,greater<int>())-xs.begin();
}

int yid(const int& y)
{
	return lower_bound(ys.begin(),ys.end(),y,greater<int>())-ys.begin();
}

signed main()
{
	fastIO
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	cin>>n>>m;
	FOR(i,0,n-1) {int s,t; cin>>s>>t; st.emplace_back(s,t); xs.pb(s); ys.pb(t);}
	FOR(i,0,m-1) {int x,y,z; cin>>x>>y>>z; q.emplace_back(x,y,z,i); xs.pb(x); ys.pb(y);}
	sort(xs.begin(),xs.end(),greater<int>());
	xs.erase(unique(xs.begin(),xs.end()),xs.end());
	sort(ys.begin(),ys.end(),greater<int>());
	ys.erase(unique(ys.begin(),ys.end()),ys.end());
	node.resize(xs.size()+1);
	bit.resize(xs.size()+1);
	FOR(i,0,n-1) fakeupd(xid(st[i].s)+1,yid(st[i].t));
	FOR(i,0,m-1) fakeget(xid(q[i].x)+1,yid(q[i].y));
	FOR(i,1,xs.size())
	{
		sort(node[i].begin(),node[i].end());
		node[i].erase(unique(node[i].begin(),node[i].end()),node[i].end());
		bit[i].resize(node[i].size());
	}
	sort(st.begin(),st.end()); sort(q.begin(),q.end());
	int cur=0;
	FOR(i,0,m-1)
	{
		while(cur<n&&st[cur].s+st[cur].t>=q[i].z) {upd(xid(st[cur].s)+1,yid(st[cur].t)); cur++;}
		ans[q[i].idx]=get(xid(q[i].x)+1,yid(q[i].y));
	}
	FOR(i,0,m-1) cout<<ans[i]<<endl;
}

Compilation message

examination.cpp: In function 'void fakeupd(long long int, long long int)':
examination.cpp:53:8: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for(;x<=xs.size();x+=x&-x) node[x].pb(y);
      |       ~^~~~~~~~~~~
examination.cpp: In function 'void upd(long long int, long long int)':
examination.cpp:63:8: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(;x<=xs.size();x+=x&-x) for(int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y) bit[x][y-1]++;
      |       ~^~~~~~~~~~~
examination.cpp:63:104: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(;x<=xs.size();x+=x&-x) for(int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y) bit[x][y-1]++;
      |                                                                                                       ~^~~~~~~~~~~~~~~~
examination.cpp: In function 'int main()':
examination.cpp:18:37: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define FOR(i,a,b) for(int i = a; i <= b; i++)
......
   99 |  FOR(i,1,xs.size())
      |      ~~~~~~~~~~~~~                   
examination.cpp:99:2: note: in expansion of macro 'FOR'
   99 |  FOR(i,1,xs.size())
      |  ^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 9 ms 1748 KB Output is correct
8 Correct 9 ms 1748 KB Output is correct
9 Correct 9 ms 1748 KB Output is correct
10 Correct 6 ms 1620 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 9 ms 1748 KB Output is correct
14 Correct 9 ms 1748 KB Output is correct
15 Correct 11 ms 1748 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 2 ms 724 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 561 ms 47372 KB Output is correct
2 Correct 588 ms 47292 KB Output is correct
3 Correct 582 ms 47240 KB Output is correct
4 Correct 254 ms 37856 KB Output is correct
5 Correct 173 ms 16536 KB Output is correct
6 Correct 75 ms 14524 KB Output is correct
7 Correct 577 ms 45340 KB Output is correct
8 Correct 528 ms 46884 KB Output is correct
9 Correct 495 ms 43612 KB Output is correct
10 Correct 130 ms 13052 KB Output is correct
11 Correct 206 ms 36308 KB Output is correct
12 Correct 46 ms 11960 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 561 ms 47372 KB Output is correct
2 Correct 588 ms 47292 KB Output is correct
3 Correct 582 ms 47240 KB Output is correct
4 Correct 254 ms 37856 KB Output is correct
5 Correct 173 ms 16536 KB Output is correct
6 Correct 75 ms 14524 KB Output is correct
7 Correct 577 ms 45340 KB Output is correct
8 Correct 528 ms 46884 KB Output is correct
9 Correct 495 ms 43612 KB Output is correct
10 Correct 130 ms 13052 KB Output is correct
11 Correct 206 ms 36308 KB Output is correct
12 Correct 46 ms 11960 KB Output is correct
13 Correct 635 ms 47176 KB Output is correct
14 Correct 640 ms 47316 KB Output is correct
15 Correct 583 ms 47260 KB Output is correct
16 Correct 280 ms 37896 KB Output is correct
17 Correct 187 ms 16440 KB Output is correct
18 Correct 73 ms 14776 KB Output is correct
19 Correct 594 ms 47512 KB Output is correct
20 Correct 595 ms 47552 KB Output is correct
21 Correct 592 ms 44468 KB Output is correct
22 Correct 132 ms 13100 KB Output is correct
23 Correct 202 ms 36420 KB Output is correct
24 Correct 50 ms 11960 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 9 ms 1748 KB Output is correct
8 Correct 9 ms 1748 KB Output is correct
9 Correct 9 ms 1748 KB Output is correct
10 Correct 6 ms 1620 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 9 ms 1748 KB Output is correct
14 Correct 9 ms 1748 KB Output is correct
15 Correct 11 ms 1748 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 561 ms 47372 KB Output is correct
20 Correct 588 ms 47292 KB Output is correct
21 Correct 582 ms 47240 KB Output is correct
22 Correct 254 ms 37856 KB Output is correct
23 Correct 173 ms 16536 KB Output is correct
24 Correct 75 ms 14524 KB Output is correct
25 Correct 577 ms 45340 KB Output is correct
26 Correct 528 ms 46884 KB Output is correct
27 Correct 495 ms 43612 KB Output is correct
28 Correct 130 ms 13052 KB Output is correct
29 Correct 206 ms 36308 KB Output is correct
30 Correct 46 ms 11960 KB Output is correct
31 Correct 635 ms 47176 KB Output is correct
32 Correct 640 ms 47316 KB Output is correct
33 Correct 583 ms 47260 KB Output is correct
34 Correct 280 ms 37896 KB Output is correct
35 Correct 187 ms 16440 KB Output is correct
36 Correct 73 ms 14776 KB Output is correct
37 Correct 594 ms 47512 KB Output is correct
38 Correct 595 ms 47552 KB Output is correct
39 Correct 592 ms 44468 KB Output is correct
40 Correct 132 ms 13100 KB Output is correct
41 Correct 202 ms 36420 KB Output is correct
42 Correct 50 ms 11960 KB Output is correct
43 Correct 766 ms 58592 KB Output is correct
44 Correct 713 ms 58808 KB Output is correct
45 Correct 740 ms 58880 KB Output is correct
46 Correct 352 ms 48768 KB Output is correct
47 Correct 236 ms 17304 KB Output is correct
48 Correct 78 ms 14488 KB Output is correct
49 Correct 685 ms 58844 KB Output is correct
50 Correct 693 ms 59192 KB Output is correct
51 Correct 683 ms 58932 KB Output is correct
52 Correct 151 ms 14140 KB Output is correct
53 Correct 275 ms 47224 KB Output is correct