oj.uz

Submission #970736

# Submission time Handle Problem Language Result Execution time Memory
970736 2024-04-27T07:43:08 Z modwwe Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 476 ms 30084 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void ngha();
const int mod2=1e9+7;
const int  mod1=998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
//#ifndef ONLINE_JUDGE
    /// fin(task),fou(task);
//#endif
//NHP
//modwwe
    //  cin>>res;
    ngha(),down
    checktime
}
int bit[500001];
int bit2[500001];
ib a[500001];
bool cmp(ib a,ib b)
{
    return a.b>b.b;
}
void upd(int x,int y)
{
    for(x; x; x-=x&-x)bit[x]=min(bit[x],y);
}
void upd2(int x,int y)
{
    for(x; x<=n; x+=x&-x) bit2[x]=max(bit2[x],y);
}
int get1(int x)
{
    int ss=1e18;
    for(x; x<=n; x+=x&-x) ss=min(ss,bit[x]);
    return ss;
}
int get2(int x)
{
    int ss=-1e18;
    for(x; x; x-=x&-x) ss=max(ss,bit2[x]);
    return ss;
}
vector<int> v;
void ngha()
{
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i].a>>a[i].b,v.pb(a[i].a),bit[i]=1e18,bit2[i]=-1e18;
    sort(a+1,a+1+n,cmp);
    sort(v.begin(),v.end());
    for(int i=1; i<=n; i++)
        a[i].a=lower_bound(v.begin(),v.end(),a[i].a)-v.begin()+1 ;
    for(int i=1; i<=n; i++)
    {
        s2=get1(a[i].a);
        if(v[a[i].a-1]-a[i].b>=s2) continue;
        s2=get2(a[i].a);
        if(v[a[i].a-1]+a[i].b<=s2) continue;
        upd(a[i].a,v[a[i].a-1]-a[i].b);
        upd2(a[i].a,v[a[i].a-1]+a[i].b);
        s3++;
    }
    cout<<s3;
}

Compilation message

Main.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
Main.cpp: In function 'void upd(long long int, long long int)':
Main.cpp:65:9: warning: statement has no effect [-Wunused-value]
   65 |     for(x; x; x-=x&-x)bit[x]=min(bit[x],y);
      |         ^
Main.cpp: In function 'void upd2(long long int, long long int)':
Main.cpp:69:9: warning: statement has no effect [-Wunused-value]
   69 |     for(x; x<=n; x+=x&-x) bit2[x]=max(bit2[x],y);
      |         ^
Main.cpp: In function 'long long int get1(long long int)':
Main.cpp:74:9: warning: statement has no effect [-Wunused-value]
   74 |     for(x; x<=n; x+=x&-x) ss=min(ss,bit[x]);
      |         ^
Main.cpp: In function 'long long int get2(long long int)':
Main.cpp:80:9: warning: statement has no effect [-Wunused-value]
   80 |     for(x; x; x-=x&-x) ss=max(ss,bit2[x]);
      |         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 112 ms 14228 KB Output is correct
3 Correct 158 ms 17716 KB Output is correct
4 Correct 406 ms 29112 KB Output is correct
5 Correct 243 ms 24508 KB Output is correct
6 Correct 469 ms 29484 KB Output is correct
7 Correct 458 ms 29616 KB Output is correct
8 Correct 442 ms 29876 KB Output is correct
9 Correct 368 ms 29892 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4548 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4544 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4548 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4548 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4544 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4548 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 4556 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 112 ms 14228 KB Output is correct
3 Correct 158 ms 17716 KB Output is correct
4 Correct 406 ms 29112 KB Output is correct
5 Correct 243 ms 24508 KB Output is correct
6 Correct 469 ms 29484 KB Output is correct
7 Correct 458 ms 29616 KB Output is correct
8 Correct 442 ms 29876 KB Output is correct
9 Correct 368 ms 29892 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4548 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4544 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4548 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4556 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 2 ms 4444 KB Output is correct
36 Correct 307 ms 25012 KB Output is correct
37 Correct 404 ms 27108 KB Output is correct
38 Correct 471 ms 29808 KB Output is correct
39 Correct 415 ms 26756 KB Output is correct
40 Correct 476 ms 29772 KB Output is correct
41 Correct 470 ms 29764 KB Output is correct
42 Correct 435 ms 30084 KB Output is correct
43 Correct 413 ms 28600 KB Output is correct
44 Correct 437 ms 29920 KB Output is correct
45 Correct 389 ms 25952 KB Output is correct