oj.uz

Submission #999748

# Submission time Handle Problem Language Result Execution time Memory
999748 2024-06-16T06:15:44 Z modwwe Fish 3 (JOI24_fish3) C++17
100 / 100
 601 ms 170068 KB 
///https://www.instagram.com/_modwwe/
#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 phongbeo();
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
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
    /// cin>>s1;
    // modwwe
    phongbeo();

}
struct IT
{
    int t[1200000];
    void upd(int node,int l,int r,int l1,int r1,int x)
    {
        if(l1>r1) return;
        if(l>r1||r<l1) return ;
        if(l>=l1&&r<=r1)
        {
            t[node]+=x;
            return;
        }
        int mid=l+r>>1;
        upd(node<<1,l,mid,l1,r1,x);
        upd(node<<1|1,mid+1,r,l1,r1,x);
        t[node]=t[node<<1]+t[node<<1|1];
    }
    int get(int node,int l,int r,int l1,int r1)
    {
        if(l1>r1) return 0;
        if(l>r1||r<l1) return 0;
        if(l>=l1&&r<=r1) return t[node];
        int mid=l+r>>1;
        return get(node<<1,l,mid,l1,r1)+get(node<<1|1,mid+1,r,l1,r1);
    }
} st1,st2;
ib st[19][300001];
vector<ic> v[300002];
int a[300001];
int b[300001];
int c[300001];
int ans[300001];
vector<ib> v2[300001];
int get(int l,int r)
{
    int k=log2(r-l+1);
    return min(st[k][l].a,st[k][r-(1<<k)+1].a);
}
int get2(int l,int r)
{
    int k=log2(r-l+1);
    if(st[k][r-(1<<k)+1].a<=st[k][l].a) return st[k][r-(1<<k)+1].b;
    return st[k][l].b;
}
void solve()
{
    for(int i=1; i<=n; i++)
    {
        l=1;
        r=i;
        while(l<=r)
        {
            int mid=l+r>>1;
            if(get(mid,i)==a[i]) r=mid-1;
            else l=mid+1;
        }
        s2=(a[i]-a[r])*r;
        s3=a[i]-a[r];
        v[i].pb({i,s2,s3});
        l=i+1;
        r=n;
        while(l<=r)
        {
            int mid=l+r>>1;
            if(a[i]<get(i+1,mid))l=mid+1;
            else r=mid-1;
        }
        v[l].pb({i,-s2,-s3});
    }
}
void phongbeo()
{
    cin>>n>>k;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=n; i++)
    {
        if(a[i-1]%k>a[i]%k)b[i]++;
        b[i]+=b[i-1];
    }
    for(int i=1; i<=n; i++)
        a[i]=a[i]/k-b[i],st[0][i].a=a[i],st[0][i].b=i,c[i]=c[i-1]+a[i];
    for(int i=1; i<19; i++)
        for(int j=1; j<=n; j++)
            if(st[i-1][j+(1<<(i-1))].a<=st[i-1][j].a)st[i][j]=st[i-1][j+(1<<(i-1))];
            else st[i][j]=st[i-1][j];
    solve();
    cin>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>l>>r;
        v2[r].pb({l,i});
    }
    for(int i=1; i<=n; i++)
    {
        for(auto x:v[i])
            st1.upd(1,1,n,x.a,x.a,x.b),
                    st2.upd(1,1,n,x.a,x.a,x.c);
        for(auto x:v2[i])
        {
            s3=get(x.a,i);
            s3+=b[x.a];
            if(s3<0) ans[x.b]=-1;
            else
            {
                s4=c[i]-c[x.a-1];
                s4+=b[x.a]*(i-x.a+1);
                s4-=s3*(i-x.a+1);
                s5=get2(x.a,i);
                s4+=st1.get(1,1,n,s5+1,i);
                s4-=i*st2.get(1,1,n,s5+1,i);
                ans[x.b]=s4;
            }
        }
    }
    for(int i=1; i<=m; i++)
        cout<<ans[i],down
    }

Compilation message

Main.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main()
      | ^~~~
Main.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int, long long int, long long int)':
Main.cpp:67:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'long long int IT::get(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:77:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'void solve()':
Main.cpp:107:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |             int mid=l+r>>1;
      |                     ~^~
Main.cpp:118:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  118 |             int mid=l+r>>1;
      |                     ~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 37464 KB Output is correct
2 Correct 5 ms 37464 KB Output is correct
3 Correct 4 ms 33372 KB Output is correct
4 Correct 9 ms 34652 KB Output is correct
5 Correct 7 ms 34652 KB Output is correct
6 Correct 8 ms 34140 KB Output is correct
7 Correct 6 ms 32088 KB Output is correct
8 Correct 9 ms 38452 KB Output is correct
9 Correct 7 ms 38492 KB Output is correct
10 Correct 8 ms 32640 KB Output is correct
11 Correct 7 ms 32444 KB Output is correct
12 Correct 8 ms 36440 KB Output is correct
13 Correct 7 ms 34652 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 159060 KB Output is correct
2 Correct 445 ms 161872 KB Output is correct
3 Correct 54 ms 46672 KB Output is correct
4 Correct 423 ms 161536 KB Output is correct
5 Correct 408 ms 161364 KB Output is correct
6 Correct 421 ms 161304 KB Output is correct
7 Correct 425 ms 161360 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 51792 KB Output is correct
2 Correct 590 ms 169972 KB Output is correct
3 Correct 535 ms 169956 KB Output is correct
4 Correct 534 ms 170068 KB Output is correct
5 Correct 543 ms 169872 KB Output is correct
6 Correct 514 ms 163476 KB Output is correct
7 Correct 550 ms 163664 KB Output is correct
8 Correct 533 ms 166740 KB Output is correct
9 Correct 509 ms 166800 KB Output is correct
10 Correct 506 ms 162020 KB Output is correct
11 Correct 491 ms 162020 KB Output is correct
12 Correct 601 ms 166652 KB Output is correct
13 Correct 581 ms 167416 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 134272 KB Output is correct
2 Correct 469 ms 161416 KB Output is correct
3 Correct 161 ms 86864 KB Output is correct
4 Correct 467 ms 162084 KB Output is correct
5 Correct 415 ms 155696 KB Output is correct
6 Correct 506 ms 165360 KB Output is correct
7 Correct 444 ms 140948 KB Output is correct
8 Correct 490 ms 165604 KB Output is correct
9 Correct 547 ms 159724 KB Output is correct
10 Correct 458 ms 159572 KB Output is correct
11 Correct 492 ms 162108 KB Output is correct
12 Correct 483 ms 161464 KB Output is correct
13 Correct 462 ms 165240 KB Output is correct
14 Correct 451 ms 161108 KB Output is correct
15 Correct 438 ms 165200 KB Output is correct
16 Correct 425 ms 161364 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 37464 KB Output is correct
2 Correct 5 ms 37464 KB Output is correct
3 Correct 4 ms 33372 KB Output is correct
4 Correct 9 ms 34652 KB Output is correct
5 Correct 7 ms 34652 KB Output is correct
6 Correct 8 ms 34140 KB Output is correct
7 Correct 6 ms 32088 KB Output is correct
8 Correct 9 ms 38452 KB Output is correct
9 Correct 7 ms 38492 KB Output is correct
10 Correct 8 ms 32640 KB Output is correct
11 Correct 7 ms 32444 KB Output is correct
12 Correct 8 ms 36440 KB Output is correct
13 Correct 7 ms 34652 KB Output is correct
14 Correct 489 ms 159060 KB Output is correct
15 Correct 445 ms 161872 KB Output is correct
16 Correct 54 ms 46672 KB Output is correct
17 Correct 423 ms 161536 KB Output is correct
18 Correct 408 ms 161364 KB Output is correct
19 Correct 421 ms 161304 KB Output is correct
20 Correct 425 ms 161360 KB Output is correct
21 Correct 95 ms 51792 KB Output is correct
22 Correct 590 ms 169972 KB Output is correct
23 Correct 535 ms 169956 KB Output is correct
24 Correct 534 ms 170068 KB Output is correct
25 Correct 543 ms 169872 KB Output is correct
26 Correct 514 ms 163476 KB Output is correct
27 Correct 550 ms 163664 KB Output is correct
28 Correct 533 ms 166740 KB Output is correct
29 Correct 509 ms 166800 KB Output is correct
30 Correct 506 ms 162020 KB Output is correct
31 Correct 491 ms 162020 KB Output is correct
32 Correct 601 ms 166652 KB Output is correct
33 Correct 581 ms 167416 KB Output is correct
34 Correct 384 ms 134272 KB Output is correct
35 Correct 469 ms 161416 KB Output is correct
36 Correct 161 ms 86864 KB Output is correct
37 Correct 467 ms 162084 KB Output is correct
38 Correct 415 ms 155696 KB Output is correct
39 Correct 506 ms 165360 KB Output is correct
40 Correct 444 ms 140948 KB Output is correct
41 Correct 490 ms 165604 KB Output is correct
42 Correct 547 ms 159724 KB Output is correct
43 Correct 458 ms 159572 KB Output is correct
44 Correct 492 ms 162108 KB Output is correct
45 Correct 483 ms 161464 KB Output is correct
46 Correct 462 ms 165240 KB Output is correct
47 Correct 451 ms 161108 KB Output is correct
48 Correct 438 ms 165200 KB Output is correct
49 Correct 425 ms 161364 KB Output is correct
50 Correct 566 ms 169964 KB Output is correct
51 Correct 490 ms 163664 KB Output is correct
52 Correct 515 ms 166736 KB Output is correct
53 Correct 510 ms 162016 KB Output is correct
54 Correct 590 ms 166604 KB Output is correct
55 Correct 583 ms 169812 KB Output is correct
56 Correct 457 ms 164688 KB Output is correct
57 Correct 440 ms 162436 KB Output is correct
58 Correct 402 ms 161616 KB Output is correct
59 Correct 484 ms 168008 KB Output is correct
60 Correct 425 ms 164856 KB Output is correct
61 Correct 511 ms 162132 KB Output is correct
62 Correct 412 ms 164356 KB Output is correct
63 Correct 567 ms 166356 KB Output is correct
64 Correct 429 ms 164692 KB Output is correct