oj.uz

Submission #957535

# Submission time Handle Problem Language Result Execution time Memory
957535 2024-04-04T01:32:59 Z VinhLuu Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 1468 ms 108008 KB 
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int oo = 2e18;

int px[N], py[N], tx, ty, n, X[N], E[N], c[N], f[N], b[N], t;


int st[N << 1];

void update(int i){
    i += n - 1;
    st[i]++;
    while(i > 1){
        i /= 2;
        st[i]++;
    }
}

int get(int l,int r){
    if(l > r) return 0;
    r++;
    int ret = 0;
    for(l += n - 1, r += n - 1; l < r; l /= 2, r /= 2){
        if(l & 1) ret += st[l++];
        if(r & 1) ret += st[--r];
    }
    return ret;
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> X[i] >> E[i];
        b[i] = i;
    }

    sort(b + 1, b + n + 1, [&] (int x,int y){return X[x] == X[y] ? E[x] < E[y] : X[x] < X[y];});

    t++;
    c[t] = b[1];
    for(int i = 2; i <= n; i ++){
        if(E[b[i]] == E[b[i - 1]] && X[b[i]] == X[b[i - 1]]) continue;
        t++;
        c[t] = b[i];
    }
    n = t;

    set<int> sx, sy;
    for(int i = 1; i <= n; i ++){
        sx.insert(X[c[i]] + E[c[i]]);
        sy.insert(X[c[i]] - E[c[i]]);
    }
    for(auto j : sx) px[++tx] = j;
    for(auto j : sy) py[++ty] = j;
    for(int k = 1; k <= n; k ++){
        int i = c[k];
        int w = lower_bound(px + 1, px + tx + 1, X[i] + E[i]) - px;
        f[k] += get(w, n);
        update(w);
    }
    for(int i = 1; i <= 2 * n; i ++) st[i] = 0;
    for(int k = n; k >= 1; k --){
        int i = c[k];
        int w = lower_bound(py + 1, py + ty + 1, X[i] - E[i]) - py;
        f[k] += get(1, w);
        update(w);
    }

    int ans = 0;
    for(int i = 1; i <= n; i ++) if(!f[i]) ans++;
    cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 132 ms 37224 KB Output is correct
3 Correct 96 ms 32328 KB Output is correct
4 Correct 142 ms 32372 KB Output is correct
5 Correct 59 ms 31316 KB Output is correct
6 Correct 557 ms 101716 KB Output is correct
7 Correct 321 ms 67392 KB Output is correct
8 Correct 129 ms 37344 KB Output is correct
9 Correct 87 ms 36688 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14816 KB Output is correct
5 Correct 2 ms 14796 KB Output is correct
6 Correct 2 ms 14936 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14816 KB Output is correct
5 Correct 2 ms 14796 KB Output is correct
6 Correct 2 ms 14936 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14936 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14684 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 132 ms 37224 KB Output is correct
3 Correct 96 ms 32328 KB Output is correct
4 Correct 142 ms 32372 KB Output is correct
5 Correct 59 ms 31316 KB Output is correct
6 Correct 557 ms 101716 KB Output is correct
7 Correct 321 ms 67392 KB Output is correct
8 Correct 129 ms 37344 KB Output is correct
9 Correct 87 ms 36688 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14816 KB Output is correct
14 Correct 2 ms 14796 KB Output is correct
15 Correct 2 ms 14936 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14684 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14936 KB Output is correct
30 Correct 3 ms 14684 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 3 ms 14684 KB Output is correct
33 Correct 2 ms 14684 KB Output is correct
34 Correct 2 ms 14684 KB Output is correct
35 Correct 3 ms 14684 KB Output is correct
36 Correct 771 ms 77136 KB Output is correct
37 Correct 1172 ms 94192 KB Output is correct
38 Correct 1429 ms 108008 KB Output is correct
39 Correct 1249 ms 90500 KB Output is correct
40 Correct 1468 ms 106452 KB Output is correct
41 Correct 1177 ms 94812 KB Output is correct
42 Correct 748 ms 94540 KB Output is correct
43 Correct 451 ms 85972 KB Output is correct
44 Correct 428 ms 79104 KB Output is correct
45 Correct 568 ms 104788 KB Output is correct