oj.uz

답안 #768043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768043 2023-06-27T11:40:14 Z Filya Examination (JOI19_examination) C++14
20 / 100
 58 ms 6940 KB 
//♥God will make a way♥

//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#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>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
pii a[200005]; 
pair<pii, int> b[200005];
int ans[200005];
struct fenwick {
    int size;
    vector<long long> tree;
    void init(int s) {
        tree.assign(s + 2, 0);
        size = s;
    }
    void upd(int u, long long v) {
        while(u <= size) {
            tree[u] += v;
            u += u & (-u);
        }
    } 
    long long qry(int u) {
        long long sum = 0;
        while(u > 0) {
            sum += tree[u];
            u -= u & (-u); // lsb
        }
        return sum;
    }
    long long sum(int l, int r) {
        return qry(r) - qry(l - 1);
    }
} ft;
int main() {
    fastio;
    int n, q, x, y, z; cin >> n >> q;
    fri(n) {
        cin >> a[i].ff >> a[i].ss;
        a[i].ff++, a[i].ss++;
    }
    sort(a, a + n);
    ft.init(100002);
    fri(q) {
        cin >> b[i].ff.ff >> b[i].ff.ss >> z;
        b[i].ff.ff++, b[i].ff.ss++;
        b[i].ss = i;
    }
    sort(b, b + q); reverse(b, b + q);
    int id = n;
    fri(q) {
        while(id > 0 && a[id-1].ff >= b[i].ff.ff) {
            id--;
            ft.upd(a[id].ss, 1);
        }
        ans[b[i].ss] = ft.sum(b[i].ff.ss, 100001);
    }
    fri(q) cout << ans[i] << '\n';
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:119:15: warning: unused variable 'x' [-Wunused-variable]
  119 |     int n, q, x, y, z; cin >> n >> q;
      |               ^
examination.cpp:119:18: warning: unused variable 'y' [-Wunused-variable]
  119 |     int n, q, x, y, z; cin >> n >> q;
      |                  ^

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 4168 KB Output is correct
2 Correct 56 ms 6476 KB Output is correct
3 Correct 53 ms 6464 KB Output is correct
4 Correct 51 ms 5712 KB Output is correct
5 Correct 58 ms 5704 KB Output is correct
6 Correct 44 ms 4952 KB Output is correct
7 Correct 52 ms 6404 KB Output is correct
8 Correct 52 ms 6440 KB Output is correct
9 Correct 53 ms 6276 KB Output is correct
10 Correct 47 ms 5576 KB Output is correct
11 Correct 47 ms 5580 KB Output is correct
12 Correct 37 ms 4552 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 4168 KB Output is correct
2 Correct 56 ms 6476 KB Output is correct
3 Correct 53 ms 6464 KB Output is correct
4 Correct 51 ms 5712 KB Output is correct
5 Correct 58 ms 5704 KB Output is correct
6 Correct 44 ms 4952 KB Output is correct
7 Correct 52 ms 6404 KB Output is correct
8 Correct 52 ms 6440 KB Output is correct
9 Correct 53 ms 6276 KB Output is correct
10 Correct 47 ms 5576 KB Output is correct
11 Correct 47 ms 5580 KB Output is correct
12 Correct 37 ms 4552 KB Output is correct
13 Incorrect 55 ms 6940 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -