oj.uz

답안 #473748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473748 2021-09-16T04:28:11 Z NhatMinh0208 Examination (JOI19_examination) C++14
100 / 100
 530 ms 16284 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
vector<pii(int)> v2;
int n,m,i,j,k,t,t1,u,v,a,b;
int x[100001];
int y[100001];
int rx[100001];
int ry[100001];
int rz[100001];
int rr[100001];
ordered_set(ll) os;
int main()
{
	fio;
    cin>>n>>m;
    for (i=0;i<n;i++) {
        cin>>x[i]>>y[i];
    }
    for (j=0;j<m;j++) {
        cin>>rx[j]>>ry[j]>>rz[j];
    }
    for (i=0;i<n;i++) {
        vec.push_back(x[i]+y[i]);
    }
    sort(vec.begin(),vec.end());
    for (i=0;i<m;i++) {
        rr[i]=vec.end()-lower_bound(vec.begin(),vec.end(),rz[i]);
    }


    // for (i=0;i<m;i++) cout<<rr[i]<<endl;

    v2.clear();
    for (i=0;i<n;i++) {
        v2.push_back({x[i]+y[i],i});
    }
    for (i=0;i<m;i++) {
        v2.push_back({rz[i],-i-1});
    }
    sort(v2.begin(),v2.end(),[](pii(int) a, pii(int) b){
        if (a.fi-b.fi) return (a.fi>b.fi);
        return (a.se>b.se);
    });
    os.clear();
    for (auto g : v2) {
        if (g.se>=0) os.insert((ll)y[g.se]*1e9+g.se);
        else {
            u=-(g.se)-1;
                rr[u]-=os.order_of_key((ll)(ry[u])*(1e9))-os.order_of_key((ll)0*(1e9));
        }
    }


    v2.clear();
    for (i=0;i<n;i++) {
        v2.push_back({x[i]+y[i],i});
    }
    for (i=0;i<m;i++) {
        v2.push_back({rz[i],-i-1});
    }
    sort(v2.begin(),v2.end(),[](pii(int) a, pii(int) b){
        if (a.fi-b.fi) return (a.fi>b.fi);
        return (a.se>b.se);
    });
    os.clear();
    for (auto g : v2) {
        if (g.se>=0) os.insert((ll)y[g.se]*1e9+g.se);
        else {
            u=-(g.se)-1;
            rr[u]-=os.size()-os.order_of_key(ll(max(ry[u],rz[u]-rx[u]))*1e9);
        }
    }

    v2.clear();
    for (i=0;i<n;i++) {
        v2.push_back({x[i],i});
    }
    for (i=0;i<m;i++) {
        v2.push_back({rx[i],-i-1});
    }
    sort(v2.begin(),v2.end(),[](pii(int) a, pii(int) b){
        if (a.fi-b.fi) return (a.fi>b.fi);
        return (a.se>b.se);
    });
    os.clear();
    for (auto g : v2) {
        if (g.se>=0) os.insert((ll)y[g.se]*1e9+g.se);
        else {
            u=-(g.se)-1;
            rr[u]+=os.size()-os.order_of_key(ll(max(ry[u],rz[u]-rx[u]))*1e9);
        }
    }
    for (i=0;i<m;i++) cout<<rr[i]<<endl;
}  
// N;

Compilation message

examination.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 820 KB Output is correct
8 Correct 9 ms 716 KB Output is correct
9 Correct 8 ms 716 KB Output is correct
10 Correct 8 ms 716 KB Output is correct
11 Correct 8 ms 716 KB Output is correct
12 Correct 7 ms 588 KB Output is correct
13 Correct 8 ms 716 KB Output is correct
14 Correct 8 ms 712 KB Output is correct
15 Correct 9 ms 716 KB Output is correct
16 Correct 8 ms 740 KB Output is correct
17 Correct 8 ms 760 KB Output is correct
18 Correct 7 ms 588 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 13868 KB Output is correct
2 Correct 460 ms 14016 KB Output is correct
3 Correct 423 ms 13892 KB Output is correct
4 Correct 373 ms 13120 KB Output is correct
5 Correct 392 ms 13156 KB Output is correct
6 Correct 328 ms 12488 KB Output is correct
7 Correct 510 ms 13796 KB Output is correct
8 Correct 378 ms 13756 KB Output is correct
9 Correct 399 ms 13752 KB Output is correct
10 Correct 376 ms 12992 KB Output is correct
11 Correct 361 ms 13020 KB Output is correct
12 Correct 302 ms 11988 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 13868 KB Output is correct
2 Correct 460 ms 14016 KB Output is correct
3 Correct 423 ms 13892 KB Output is correct
4 Correct 373 ms 13120 KB Output is correct
5 Correct 392 ms 13156 KB Output is correct
6 Correct 328 ms 12488 KB Output is correct
7 Correct 510 ms 13796 KB Output is correct
8 Correct 378 ms 13756 KB Output is correct
9 Correct 399 ms 13752 KB Output is correct
10 Correct 376 ms 12992 KB Output is correct
11 Correct 361 ms 13020 KB Output is correct
12 Correct 302 ms 11988 KB Output is correct
13 Correct 436 ms 14328 KB Output is correct
14 Correct 508 ms 14272 KB Output is correct
15 Correct 493 ms 13896 KB Output is correct
16 Correct 434 ms 13544 KB Output is correct
17 Correct 428 ms 13504 KB Output is correct
18 Correct 339 ms 12472 KB Output is correct
19 Correct 530 ms 14328 KB Output is correct
20 Correct 427 ms 14320 KB Output is correct
21 Correct 425 ms 14304 KB Output is correct
22 Correct 385 ms 12992 KB Output is correct
23 Correct 378 ms 13028 KB Output is correct
24 Correct 355 ms 12024 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 820 KB Output is correct
8 Correct 9 ms 716 KB Output is correct
9 Correct 8 ms 716 KB Output is correct
10 Correct 8 ms 716 KB Output is correct
11 Correct 8 ms 716 KB Output is correct
12 Correct 7 ms 588 KB Output is correct
13 Correct 8 ms 716 KB Output is correct
14 Correct 8 ms 712 KB Output is correct
15 Correct 9 ms 716 KB Output is correct
16 Correct 8 ms 740 KB Output is correct
17 Correct 8 ms 760 KB Output is correct
18 Correct 7 ms 588 KB Output is correct
19 Correct 428 ms 13868 KB Output is correct
20 Correct 460 ms 14016 KB Output is correct
21 Correct 423 ms 13892 KB Output is correct
22 Correct 373 ms 13120 KB Output is correct
23 Correct 392 ms 13156 KB Output is correct
24 Correct 328 ms 12488 KB Output is correct
25 Correct 510 ms 13796 KB Output is correct
26 Correct 378 ms 13756 KB Output is correct
27 Correct 399 ms 13752 KB Output is correct
28 Correct 376 ms 12992 KB Output is correct
29 Correct 361 ms 13020 KB Output is correct
30 Correct 302 ms 11988 KB Output is correct
31 Correct 436 ms 14328 KB Output is correct
32 Correct 508 ms 14272 KB Output is correct
33 Correct 493 ms 13896 KB Output is correct
34 Correct 434 ms 13544 KB Output is correct
35 Correct 428 ms 13504 KB Output is correct
36 Correct 339 ms 12472 KB Output is correct
37 Correct 530 ms 14328 KB Output is correct
38 Correct 427 ms 14320 KB Output is correct
39 Correct 425 ms 14304 KB Output is correct
40 Correct 385 ms 12992 KB Output is correct
41 Correct 378 ms 13028 KB Output is correct
42 Correct 355 ms 12024 KB Output is correct
43 Correct 516 ms 16284 KB Output is correct
44 Correct 495 ms 16284 KB Output is correct
45 Correct 467 ms 16188 KB Output is correct
46 Correct 427 ms 14776 KB Output is correct
47 Correct 416 ms 14704 KB Output is correct
48 Correct 311 ms 12244 KB Output is correct
49 Correct 492 ms 16176 KB Output is correct
50 Correct 429 ms 16160 KB Output is correct
51 Correct 491 ms 16040 KB Output is correct
52 Correct 432 ms 14448 KB Output is correct
53 Correct 386 ms 13760 KB Output is correct