oj.uz

답안 #553536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553536 2022-04-26T07:37:20 Z farhan132 Examination (JOI19_examination) C++17
100 / 100
 385 ms 27680 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e5 + 5;

ll a[N] , b[N] , x[N], y[N], z[N], ans[N];

void solve(){

  ll n, q;
  cin >> n >> q;
  vector < tuple < ll, ll, ll > > v;

  for(ll i = 1; i <= n; i++){
    cin >> a[i] >> b[i];
    v.pb({ -(a[i] + b[i]) , 0, i});
  }
  for(ll i = 1; i <= q; i++){
    cin >> x[i] >> y[i] >> z[i];
    v.pb({-max(z[i], x[i] + y[i]), 1, i});
  }
  sort(v.begin(), v.end());
  ll got = 0;
  ordered_set < ii > X, Y;
  for(auto [tot, d, i] : v){
    if(!d){
        got++;
        X.in({a[i], i});
        Y.in({b[i], i});
    }else{
        ans[i] = got - X.order_of_key({x[i] , 0}) - Y.order_of_key({y[i], 0});
    }
  }
  for(ll i = 1; i <= q; i++) cout << ans[i] << '\n';
  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:114:15: warning: unused variable 'CT' [-Wunused-variable]
  114 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 1132 KB Output is correct
8 Correct 5 ms 1172 KB Output is correct
9 Correct 5 ms 1172 KB Output is correct
10 Correct 5 ms 1044 KB Output is correct
11 Correct 5 ms 1044 KB Output is correct
12 Correct 4 ms 948 KB Output is correct
13 Correct 6 ms 1172 KB Output is correct
14 Correct 5 ms 1064 KB Output is correct
15 Correct 5 ms 1172 KB Output is correct
16 Correct 4 ms 1092 KB Output is correct
17 Correct 5 ms 1048 KB Output is correct
18 Correct 4 ms 1044 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 345 ms 25332 KB Output is correct
2 Correct 283 ms 25328 KB Output is correct
3 Correct 276 ms 25292 KB Output is correct
4 Correct 242 ms 24708 KB Output is correct
5 Correct 197 ms 24568 KB Output is correct
6 Correct 169 ms 23736 KB Output is correct
7 Correct 352 ms 25180 KB Output is correct
8 Correct 272 ms 25264 KB Output is correct
9 Correct 324 ms 25116 KB Output is correct
10 Correct 203 ms 24300 KB Output is correct
11 Correct 188 ms 24308 KB Output is correct
12 Correct 168 ms 23476 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 345 ms 25332 KB Output is correct
2 Correct 283 ms 25328 KB Output is correct
3 Correct 276 ms 25292 KB Output is correct
4 Correct 242 ms 24708 KB Output is correct
5 Correct 197 ms 24568 KB Output is correct
6 Correct 169 ms 23736 KB Output is correct
7 Correct 352 ms 25180 KB Output is correct
8 Correct 272 ms 25264 KB Output is correct
9 Correct 324 ms 25116 KB Output is correct
10 Correct 203 ms 24300 KB Output is correct
11 Correct 188 ms 24308 KB Output is correct
12 Correct 168 ms 23476 KB Output is correct
13 Correct 295 ms 25680 KB Output is correct
14 Correct 363 ms 25704 KB Output is correct
15 Correct 284 ms 25260 KB Output is correct
16 Correct 247 ms 24872 KB Output is correct
17 Correct 214 ms 24924 KB Output is correct
18 Correct 176 ms 23760 KB Output is correct
19 Correct 324 ms 25712 KB Output is correct
20 Correct 318 ms 25664 KB Output is correct
21 Correct 312 ms 25676 KB Output is correct
22 Correct 284 ms 24364 KB Output is correct
23 Correct 224 ms 24392 KB Output is correct
24 Correct 196 ms 23468 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 1132 KB Output is correct
8 Correct 5 ms 1172 KB Output is correct
9 Correct 5 ms 1172 KB Output is correct
10 Correct 5 ms 1044 KB Output is correct
11 Correct 5 ms 1044 KB Output is correct
12 Correct 4 ms 948 KB Output is correct
13 Correct 6 ms 1172 KB Output is correct
14 Correct 5 ms 1064 KB Output is correct
15 Correct 5 ms 1172 KB Output is correct
16 Correct 4 ms 1092 KB Output is correct
17 Correct 5 ms 1048 KB Output is correct
18 Correct 4 ms 1044 KB Output is correct
19 Correct 345 ms 25332 KB Output is correct
20 Correct 283 ms 25328 KB Output is correct
21 Correct 276 ms 25292 KB Output is correct
22 Correct 242 ms 24708 KB Output is correct
23 Correct 197 ms 24568 KB Output is correct
24 Correct 169 ms 23736 KB Output is correct
25 Correct 352 ms 25180 KB Output is correct
26 Correct 272 ms 25264 KB Output is correct
27 Correct 324 ms 25116 KB Output is correct
28 Correct 203 ms 24300 KB Output is correct
29 Correct 188 ms 24308 KB Output is correct
30 Correct 168 ms 23476 KB Output is correct
31 Correct 295 ms 25680 KB Output is correct
32 Correct 363 ms 25704 KB Output is correct
33 Correct 284 ms 25260 KB Output is correct
34 Correct 247 ms 24872 KB Output is correct
35 Correct 214 ms 24924 KB Output is correct
36 Correct 176 ms 23760 KB Output is correct
37 Correct 324 ms 25712 KB Output is correct
38 Correct 318 ms 25664 KB Output is correct
39 Correct 312 ms 25676 KB Output is correct
40 Correct 284 ms 24364 KB Output is correct
41 Correct 224 ms 24392 KB Output is correct
42 Correct 196 ms 23468 KB Output is correct
43 Correct 306 ms 27568 KB Output is correct
44 Correct 350 ms 27680 KB Output is correct
45 Correct 338 ms 27620 KB Output is correct
46 Correct 283 ms 26008 KB Output is correct
47 Correct 306 ms 26060 KB Output is correct
48 Correct 194 ms 23592 KB Output is correct
49 Correct 385 ms 27536 KB Output is correct
50 Correct 343 ms 27516 KB Output is correct
51 Correct 363 ms 27472 KB Output is correct
52 Correct 272 ms 25844 KB Output is correct
53 Correct 242 ms 25268 KB Output is correct