Submission #895865

#	Time	Username	Problem	Language	Result	Execution time	Memory
895865		thunopro	Examination (JOI19_examination)	C++14	100 / 100	284 ms	21136 KiB

examination

#include<bits/stdc++.h>
using namespace std ; 
#define ll long long 
#define maxn 200009 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1  

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<ll> vl ; 
typedef vector<pii> vii ; 
 
void add ( int &a , int b ) 
{
	a += b ;
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n , nq ; 

struct score {
	int math , info , sum , id ; 
} a [maxn] , q [maxn] , b [maxn] ; 
int res [maxn] ; 
bool cmp_math ( score u , score v ) 
{
	if (u.math == v.math) 
	{
		return u.id < v.id ; 
	}
	return u.math >= v.math ; 
}
bool cmp_info ( score u , score v ) 
{
	if ( u.info == v.info ) 
	{
		return u.id < v.id ; 
	}
	return u.info >= v.info ; 
}

int num ; 

int bit [maxn] ; 
void update ( int x , int y ) 
{
	while ( x ) bit [x] += y , x -= (x&-x) ; 
}
int get ( int x ) 
{
	int res = 0 ; 
	while ( x < maxn ) res += bit [x] , x += (x&-x) ; 
	return res ; 
}

void dnc ( int l , int r ) 
{
	if ( l == r ) return ; 
	int mid = (l+r)/2 ; 
	dnc (l,mid) ; 
	dnc (mid+1,r) ; 
	
	vector<score> impor ; 
	
	for ( int i = l ; i <= mid ; i ++ ) if ( b [i].id == - 1 ) impor.pb (b[i]) ; 
	for ( int i = mid + 1 ; i <= r ; i ++ ) if ( b[i].id != - 1 ) impor.pb (b[i]) ; 
	
	sort (impor.begin(),impor.end(),cmp_info) ; 
	
	for ( auto x : impor ) 
	{
		int info = x.info , sum = x.sum , id = x.id ;
		if ( id == - 1 ) update (sum,1) ; 
		else res [id] += get (sum) ; 
	}
	for ( auto x : impor ) if ( x.id == - 1 ) update (x.sum,-1) ; 
}

void mapping () 
{
	vi v ; 
	for ( int i = 1 ; i <= n ; i ++ ) v . pb (a[i].sum) ; 
	for ( int i = 1 ; i <= nq ; i ++ ) v . pb (q[i].sum) ; 
	sort (v.begin(),v.end()) ; 
	v.resize(unique(v.begin(),v.end())-v.begin()) ; 
	for ( int i = 1 ; i <= n ; i ++ ) a [i].sum = _lower(a[i].sum) ; 
	for ( int i = 1 ; i <= nq ; i ++ ) q [i].sum = _lower(q[i].sum) ; 
	
}
int main () 
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0) ; 
//	rf () ; 
	cin >> n >> nq ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		cin >> a [i].math >> a [i].info ; a [i].sum = a [i].math + a [i].info ; 
	}
	
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		cin >> q [i].math >> q [i].info >> q [i].sum ; 
	}
	
	mapping () ; 
	
	int num = 0 ;
	for ( int i = 1 ; i <= n ; i ++ ) a [i].id = - 1 , b [++num] = a [i] ; 
	for ( int i = 1 ; i <= nq ; i ++ ) q [i].id = i , b [++num] = q [i] ; 
	
	sort (b+1,b+num+1,cmp_math) ; 
	dnc (1,num) ; 
	
	for ( int i = 1 ; i <= nq ; i ++ ) cout << res [i] << "\n" ; 
}

// range , error , check speical , ... 
// find key , find key 
//'-std=c++11' stay hard 
// there is no tomorrow 

Compilation message (stderr)

examination.cpp: In function 'void dnc(int, int)':
examination.cpp:99:7: warning: unused variable 'info' [-Wunused-variable]
   99 |   int info = x.info , sum = x.sum , id = x.id ;
      |       ^~~~
examination.cpp: In function 'void rf()':
examination.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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