oj.uz

Submission #978491

# Submission time Handle Problem Language Result Execution time Memory
978491 2024-05-09T09:04:44 Z sleepntsheep Fish 3 (JOI24_fish3) C
100 / 100
 533 ms 45392 KB 
#include<stdio.h>
#include<stdlib.h>

#define N 300000

#define Q 300000

int n, q, *eh[N+1], eo[N+1];
long long d,ans[Q];

void push(int i,int j)
{
    int o=eo[i]++;
    if(!o)eh[i]=(int*)malloc(2*sizeof**eh);
    else if(!(o&o-1))eh[i]=(int*)realloc(eh[i],2*o*sizeof**eh);
    eh[i][o]=j;
}


/*
 * sweep from left to right,
 *
 * decompose fishes to dominoes
 *
 * amortized O(n) dominoes move
 *
 *
 * need segtree that can 
 * decrease k from a[l..r], add k to b[l..r]
 * point query a[i]
 * range query b[l..r]
 */

#define N_ (((N+1)<<2)+1)
long long ta[N_], la[N_], tb[N_], lb[N_], c;

int dominoes[N+1], top;

void pul(int v,int l,int r)
{
    long long m=l+(r-l)/2, w1=m-l+1, w2=r-m;
    ta[v] = ta[2*v] +  ta[2*v+1] + w1 * la[2*v] + w2 * la[2*v+1];
    tb[v] = tb[2*v] +  tb[2*v+1] + w1 * lb[2*v] + w2 * lb[2*v+1];
}

void add(int x,int y,long long k,long long k2,int v,int l,int r)
{
    if (r < x || y < l) return;
    if (x <= l && r <= y)
    {
        la[v] += k;
        lb[v] += k2;
        return;
    }
    add(x, y, k, k2, 2*v, l, l+(r-l)/2);
    add(x, y, k, k2, 2*v+1, l+(r-l)/2+1, r);
    pul(v, l, r);
}
void add_(int x,int y,long long k,long long k2) { add(x, y, k, k2, 1, 0, n); }

long long query1(int p,int v,int l,int r)
{
    if(l==r)return ta[v] + la[v];
    return la[v] + (p <= l+(r-l)/2 ? query1(p,2*v,l,l+(r-l)/2): query1(p,2*v+1,l+(r-l)/2+1,r));
}
long long query1_(int p) { return query1(p, 1, 0, n); }

int max(int i,int j){return i>j?i:j;}
int min(int i,int j){return i<j?i:j;}
int overlap(int x,int y,int a, int b) { return(y<a||b<x)? 0:min(b,y)-max(x,a)+1; }

long long query2(int x,int y,int v,int l,int r)
{
    if(r<x||y<l)return 0;
    if (x<=l&&r<=y) return lb[v] * (r-l+1ll) + tb[v];
    return lb[v] * overlap(x,y,l,r) + query2(x, y, 2*v, l, l+(r-l)/2) + query2(x, y, 2*v+1, l+(r-l)/2+1, r);
}
long long query2_(int x,int y) { return query2(x, y, 1, 0, n); }

int broken = 0;

void fix(int r)
{
    long long delta = query1_(r-1) - query1_(r);
    if (delta <= 0)
        return;
    long long ii = (delta + d - 1) / d;
    if (query1_(dominoes[top]) < d * ii)
    {
        int lower = dominoes[top], upper = r;
        while (upper - lower > 1)
        {
            int mid = lower + (upper - lower) / 2;
            if (query1_(mid) < d * ii) lower = mid;
            else upper = mid;
        }
        if (lower > broken)
        {
            broken = lower;
            add_(broken, broken, -1e18, 0);
            dominoes[top=1]=broken+1;
        }
    }
    add_(dominoes[top], r-1, -ii * d, ii);
}

int main()
{
    scanf("%d%lld",&n,&d);
    add_(0, 0, -1e18, 0);
    for(int i=1;i<=n;++i)scanf("%lld",&c), add_(i, i, c, 0);

    scanf("%d",&q);
    for(int ll,rr,i=0;i<q;++i)scanf("%d%d",&ll,&rr),push(rr,i),push(rr,ll);

    for(int r=1;r<=n;++r)
    {
        fix(r);

        while (top && query1_(dominoes[top]) - query1_(dominoes[top]-1) < d)
            fix(dominoes[top--]);

        if (query1_(r) - query1_(r-1) >= d)
            dominoes[++top] = r;

        for(int j=0;j<eo[r];j+=2)
        {
            int ll=eh[r][j+1], ii=eh[r][j];
            ans[ii] = (broken >= ll) ? -1 : query2_(ll, r);
        }
    }

    for(int i=0;i<q;++i)printf("%lld\n",ans[i]);
}

Compilation message

Main.c: In function 'push':
Main.c:15:18: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |     else if(!(o&o-1))eh[i]=(int*)realloc(eh[i],2*o*sizeof**eh);
      |                 ~^~
Main.c: In function 'main':
Main.c:109:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |     scanf("%d%lld",&n,&d);
      |     ^~~~~~~~~~~~~~~~~~~~~
Main.c:111:26: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |     for(int i=1;i<=n;++i)scanf("%lld",&c), add_(i, i, c, 0);
      |                          ^~~~~~~~~~~~~~~~
Main.c:113:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |     scanf("%d",&q);
      |     ^~~~~~~~~~~~~~
Main.c:114:31: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |     for(int ll,rr,i=0;i<q;++i)scanf("%d%d",&ll,&rr),push(rr,i),push(rr,ll);
      |                               ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 5 ms 10844 KB Output is correct
5 Correct 4 ms 10824 KB Output is correct
6 Correct 5 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 4 ms 10844 KB Output is correct
11 Correct 4 ms 10840 KB Output is correct
12 Correct 4 ms 10844 KB Output is correct
13 Correct 6 ms 10588 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 40860 KB Output is correct
2 Correct 377 ms 36920 KB Output is correct
3 Correct 61 ms 15476 KB Output is correct
4 Correct 329 ms 36484 KB Output is correct
5 Correct 336 ms 36696 KB Output is correct
6 Correct 318 ms 36324 KB Output is correct
7 Correct 327 ms 36436 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 19280 KB Output is correct
2 Correct 511 ms 45060 KB Output is correct
3 Correct 518 ms 45116 KB Output is correct
4 Correct 516 ms 45192 KB Output is correct
5 Correct 514 ms 45392 KB Output is correct
6 Correct 530 ms 41692 KB Output is correct
7 Correct 477 ms 41724 KB Output is correct
8 Correct 489 ms 41864 KB Output is correct
9 Correct 480 ms 41812 KB Output is correct
10 Correct 379 ms 37456 KB Output is correct
11 Correct 394 ms 37616 KB Output is correct
12 Correct 442 ms 42100 KB Output is correct
13 Correct 438 ms 41884 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 30976 KB Output is correct
2 Correct 374 ms 37972 KB Output is correct
3 Correct 199 ms 25560 KB Output is correct
4 Correct 381 ms 37876 KB Output is correct
5 Correct 493 ms 44460 KB Output is correct
6 Correct 530 ms 45236 KB Output is correct
7 Correct 437 ms 35776 KB Output is correct
8 Correct 525 ms 44976 KB Output is correct
9 Correct 319 ms 37204 KB Output is correct
10 Correct 269 ms 36596 KB Output is correct
11 Correct 387 ms 38200 KB Output is correct
12 Correct 328 ms 37288 KB Output is correct
13 Correct 526 ms 44984 KB Output is correct
14 Correct 428 ms 36548 KB Output is correct
15 Correct 533 ms 44884 KB Output is correct
16 Correct 439 ms 37252 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 5 ms 10844 KB Output is correct
5 Correct 4 ms 10824 KB Output is correct
6 Correct 5 ms 10588 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 4 ms 10844 KB Output is correct
11 Correct 4 ms 10840 KB Output is correct
12 Correct 4 ms 10844 KB Output is correct
13 Correct 6 ms 10588 KB Output is correct
14 Correct 456 ms 40860 KB Output is correct
15 Correct 377 ms 36920 KB Output is correct
16 Correct 61 ms 15476 KB Output is correct
17 Correct 329 ms 36484 KB Output is correct
18 Correct 336 ms 36696 KB Output is correct
19 Correct 318 ms 36324 KB Output is correct
20 Correct 327 ms 36436 KB Output is correct
21 Correct 114 ms 19280 KB Output is correct
22 Correct 511 ms 45060 KB Output is correct
23 Correct 518 ms 45116 KB Output is correct
24 Correct 516 ms 45192 KB Output is correct
25 Correct 514 ms 45392 KB Output is correct
26 Correct 530 ms 41692 KB Output is correct
27 Correct 477 ms 41724 KB Output is correct
28 Correct 489 ms 41864 KB Output is correct
29 Correct 480 ms 41812 KB Output is correct
30 Correct 379 ms 37456 KB Output is correct
31 Correct 394 ms 37616 KB Output is correct
32 Correct 442 ms 42100 KB Output is correct
33 Correct 438 ms 41884 KB Output is correct
34 Correct 349 ms 30976 KB Output is correct
35 Correct 374 ms 37972 KB Output is correct
36 Correct 199 ms 25560 KB Output is correct
37 Correct 381 ms 37876 KB Output is correct
38 Correct 493 ms 44460 KB Output is correct
39 Correct 530 ms 45236 KB Output is correct
40 Correct 437 ms 35776 KB Output is correct
41 Correct 525 ms 44976 KB Output is correct
42 Correct 319 ms 37204 KB Output is correct
43 Correct 269 ms 36596 KB Output is correct
44 Correct 387 ms 38200 KB Output is correct
45 Correct 328 ms 37288 KB Output is correct
46 Correct 526 ms 44984 KB Output is correct
47 Correct 428 ms 36548 KB Output is correct
48 Correct 533 ms 44884 KB Output is correct
49 Correct 439 ms 37252 KB Output is correct
50 Correct 509 ms 45032 KB Output is correct
51 Correct 498 ms 41808 KB Output is correct
52 Correct 493 ms 41724 KB Output is correct
53 Correct 381 ms 37456 KB Output is correct
54 Correct 451 ms 41936 KB Output is correct
55 Correct 525 ms 45380 KB Output is correct
56 Correct 374 ms 38992 KB Output is correct
57 Correct 346 ms 39512 KB Output is correct
58 Correct 354 ms 36688 KB Output is correct
59 Correct 474 ms 42836 KB Output is correct
60 Correct 398 ms 40632 KB Output is correct
61 Correct 389 ms 37420 KB Output is correct
62 Correct 393 ms 36180 KB Output is correct
63 Correct 449 ms 41904 KB Output is correct
64 Correct 398 ms 39572 KB Output is correct