oj.uz

답안 #1048321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048321 2024-08-08T06:45:50 Z otarius Examination (JOI19_examination) C++17
0 / 100
 502 ms 78348 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()

#define int long long
// #define int unsigned long long

#define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 2 * 1e5 + 25;

int tim;
struct node {
    int a, b, c, id;
};
bool comp(node x, node y) {
    return (x.a < y.a);
}
node arr[maxN];
ordered_set(pii) bit[maxN];
void update(int x, int val) {
    for ( ; x; x -= (x & -x)) bit[x].insert({val, ++tim});
}
int query(int x, int val) {
    int ans = 0;
    for ( ; x < maxN; x += (x & -x))
        ans += bit[x].size() - bit[x].order_of_key({val, inf});
    return ans;
}
void solve() {
    int n, q;
    cin >> n >> q;
    int ans[q + 1];
    for (int i = 1; i <= n; i++) {
        cin >> arr[i].a >> arr[i].b;
        arr[i].c = arr[i].a + arr[i].b; arr[i].id = 0;
    } for (int i = 1; i <= q; i++) {
        cin >> arr[n + i].a >> arr[n + i].b >> arr[n + i].c; arr[n + i].id = i;
    } sort(arr + 1, arr + n + q + 1, comp);
    vector<int> x;
    for (int i = 1; i <= n + q; i++) x.pb(arr[i].b);
    sort(x.begin(), x.end());
    x.resize(unique(all(x)) - x.begin());
    for (int i = 1; i <= n + q; i++)
        arr[i].b = lower_bound(all(x), arr[i].b) - x.begin() + 1;
    for (int i = n + q; i >= 1; i--) {
        ans[arr[i].id] = query(arr[i].b, arr[i].c);
        if (arr[i].id == 0) update(arr[i].b, arr[i].c);
    } for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
}
int32_t main() { 
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
    return 0;
}

Compilation message

examination.cpp: In function 'void open_file(std::string)':
examination.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19292 KB Output is correct
2 Correct 8 ms 19256 KB Output is correct
3 Correct 8 ms 19124 KB Output is correct
4 Correct 8 ms 19176 KB Output is correct
5 Correct 8 ms 19156 KB Output is correct
6 Correct 8 ms 19092 KB Output is correct
7 Correct 14 ms 22604 KB Output is correct
8 Correct 15 ms 22524 KB Output is correct
9 Correct 13 ms 22364 KB Output is correct
10 Correct 12 ms 21788 KB Output is correct
11 Incorrect 14 ms 22364 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19292 KB Output is correct
2 Correct 8 ms 19256 KB Output is correct
3 Correct 8 ms 19124 KB Output is correct
4 Correct 8 ms 19176 KB Output is correct
5 Correct 8 ms 19156 KB Output is correct
6 Correct 8 ms 19092 KB Output is correct
7 Correct 14 ms 22604 KB Output is correct
8 Correct 15 ms 22524 KB Output is correct
9 Correct 13 ms 22364 KB Output is correct
10 Correct 12 ms 21788 KB Output is correct
11 Incorrect 14 ms 22364 KB Output isn't correct
12 Halted 0 ms 0 KB -