oj.uz

답안 #866230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866230 2023-10-25T15:44:32 Z andrei_boaca 식물 비교 (IOI20_plants) C++17
49 / 100
 907 ms 45856 KB 
#include "plants.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
vector<int> muchii[200005];
int n,bigger[200005],smaller[200005],lastsmall[200005],lastbig[200005],k,v[200005];
bool use[200005];
ll mars[500005],can[500005];
vector<int> R;
int dist(int a,int b)
{
    return (b-a+n)%n;
}
int myprv(int x)
{
    return (x-1+n)%n;
}
struct aint
{
    int maxim,minim,pozmax,pozmin;
    int toprop;
} arb[3][4*200005];
vector<int> who;
aint combine(aint a,aint b)
{
    aint rez;
    rez.toprop=0;
    rez.maxim=a.maxim;
    rez.pozmax=a.pozmax;
    if(b.maxim>rez.maxim)
    {
        rez.maxim=b.maxim;
        rez.pozmax=b.pozmax;
    }

    rez.minim=a.minim;
    rez.pozmin=a.pozmin;
    if(b.minim<rez.minim)
    {
        rez.minim=b.minim;
        rez.pozmin=b.pozmin;
    }
    return rez;
}
void prop(int ind,int nod)
{
    int val=arb[ind][nod].toprop;
    arb[ind][nod*2].toprop+=val;
    arb[ind][nod*2].maxim+=val;
    arb[ind][nod*2].minim+=val;

    arb[ind][nod*2+1].toprop+=val;
    arb[ind][nod*2+1].maxim+=val;
    arb[ind][nod*2+1].minim+=val;
}
void build(int ind,int nod,int st,int dr)
{
    arb[ind][nod].toprop=0;
    if(st==dr)
    {
        arb[ind][nod].minim=arb[ind][nod].maxim=R[st]*(ind==1);
        arb[ind][nod].pozmin=arb[ind][nod].pozmax=st;
        return;
    }
    int mij=(st+dr)/2;
    build(ind,nod*2,st,mij);
    build(ind,nod*2+1,mij+1,dr);
    arb[ind][nod]=combine(arb[ind][nod*2],arb[ind][nod*2+1]);
}
void update(int ind,int nod,int st,int dr,int a,int b,int val)
{
    if(st!=dr)
        prop(ind,nod);
    arb[ind][nod].toprop=0;
    if(st>=a&&dr<=b)
    {
        arb[ind][nod].maxim+=val;
        arb[ind][nod].minim+=val;
        arb[ind][nod].toprop+=val;
        return;
    }
    int mij=(st+dr)/2;
    if(a<=mij)
        update(ind,nod*2,st,mij,a,b,val);
    if(b>mij)
        update(ind,nod*2+1,mij+1,dr,a,b,val);
    arb[ind][nod]=combine(arb[ind][nod*2],arb[ind][nod*2+1]);
}
void getwho(int ind,int nod,int st,int dr,int a,int b)
{
    if(st!=dr)
        prop(ind,nod);
    arb[ind][nod].toprop=0;
    if(arb[ind][nod].maxim<k-1)
        return;
    if(st==dr)
    {
        who.push_back(st);
        return;
    }
    int mij=(st+dr)/2;
    if(a<=mij)
        getwho(ind,nod*2,st,mij,a,b);
    if(b>mij)
        getwho(ind,nod*2+1,mij+1,dr,a,b);
}
void plsadd(int ind,int st,int lg,int val)
{
    if(st+lg-1<=n-1)
    {
        update(ind,1,0,n-1,st,st+lg-1,val);
        return;
    }
    update(ind,1,0,n-1,st,n-1,val);
    update(ind,1,0,n-1,0,(st+lg-1)%n,val);
}
void guesswho(int ind,int st,int lg)
{
    who.clear();
    if(st+lg-1<=n-1)
    {
        getwho(ind,1,0,n-1,st,st+lg-1);
        return;
    }
    getwho(ind,1,0,n-1,st,n-1);
    getwho(ind,1,0,n-1,0,(st+lg-1)%n);
}
void init(int K, std::vector<int> r)
{
    R=r;
    n=r.size();
    k=K;
    for(int i=0;i<n;i++)
    {
        lastbig[i]=-1;
        lastsmall[i]=-1;
    }
    for(int i=0;i<n;i++)
    {
        if(r[i]==0)
        {
            int j=(i-1+n)%n;
            while(r[j]==1)
            {
                lastsmall[j]=i;
                j=(j-1+n)%n;
            }
        }
        if(r[i]==1)
        {
            int j=(i-1+n)%n;
            while(r[j]==0)
            {
                lastbig[j]=i;
                j=(j-1+n)%n;
            }
        }
    }
    if(k>2)
    {
        build(1,1,0,n-1);
        build(2,1,0,n-1);
        for(int i=0;i<n;i++)
        {
            if(r[i]==k-1)
                plsadd(2,(i+1)%n,k-1,1);
            else
                plsadd(2,i,1,1);
        }
        for(int value=1;value<=n;value++)
        {
            int poz=arb[2][1].pozmin;
            assert(arb[2][1].minim==0);
            v[poz]=value;
            plsadd(2,poz,1,1e6);
            plsadd(2,(poz+1)%n,k-1,-1);
            plsadd(1,poz,1,-1e6);
            int p=(poz-(k-1)+n)%n;
            plsadd(1,p,k-1,1);
            guesswho(1,p,k-1);
            for(auto i:who)
            {
                plsadd(2,i,1,-1);
                plsadd(2,(i+1)%n,k-1,1);
            }
        }
    }
}
int compare_plants(int x, int y)
{
    if(k==2)
    {
        if(lastsmall[x]!=-1&&dist(x,y)+dist(y,lastsmall[x])==dist(x,lastsmall[x]))
            return -1;
        if(lastbig[x]!=-1&&dist(x,y)+dist(y,lastbig[x])==dist(x,lastbig[x]))
            return 1;
        if(lastsmall[y]!=-1&&dist(y,x)+dist(x,lastsmall[y])==dist(y,lastsmall[y]))
            return 1;
        if(lastbig[y]!=-1&&dist(y,x)+dist(x,lastbig[y])==dist(y,lastbig[y]))
            return -1;
        return 0;
    }
    if(v[x]<v[y])
        return -1;
    if(v[x]>v[y])
        return 1;
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 2 ms 10332 KB Output is correct
6 Correct 42 ms 13116 KB Output is correct
7 Correct 46 ms 13468 KB Output is correct
8 Correct 61 ms 15164 KB Output is correct
9 Correct 62 ms 15184 KB Output is correct
10 Correct 62 ms 15148 KB Output is correct
11 Correct 62 ms 15188 KB Output is correct
12 Correct 60 ms 15184 KB Output is correct
13 Correct 61 ms 15444 KB Output is correct
14 Correct 62 ms 15188 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 3 ms 16476 KB Output is correct
4 Correct 3 ms 16476 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 52 ms 19528 KB Output is correct
8 Correct 4 ms 16728 KB Output is correct
9 Correct 6 ms 16736 KB Output is correct
10 Correct 53 ms 19540 KB Output is correct
11 Correct 50 ms 19340 KB Output is correct
12 Correct 49 ms 19604 KB Output is correct
13 Correct 52 ms 19532 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 3 ms 16476 KB Output is correct
4 Correct 3 ms 16476 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 52 ms 19528 KB Output is correct
8 Correct 4 ms 16728 KB Output is correct
9 Correct 6 ms 16736 KB Output is correct
10 Correct 53 ms 19540 KB Output is correct
11 Correct 50 ms 19340 KB Output is correct
12 Correct 49 ms 19604 KB Output is correct
13 Correct 52 ms 19532 KB Output is correct
14 Correct 100 ms 21920 KB Output is correct
15 Correct 875 ms 45856 KB Output is correct
16 Correct 105 ms 23984 KB Output is correct
17 Correct 858 ms 45608 KB Output is correct
18 Correct 605 ms 45188 KB Output is correct
19 Correct 598 ms 45648 KB Output is correct
20 Correct 803 ms 45668 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 3 ms 16476 KB Output is correct
3 Correct 43 ms 19276 KB Output is correct
4 Correct 442 ms 41888 KB Output is correct
5 Correct 559 ms 44816 KB Output is correct
6 Correct 786 ms 45256 KB Output is correct
7 Correct 823 ms 45376 KB Output is correct
8 Correct 907 ms 45768 KB Output is correct
9 Correct 519 ms 45140 KB Output is correct
10 Correct 528 ms 44884 KB Output is correct
11 Correct 63 ms 18004 KB Output is correct
12 Correct 416 ms 44808 KB Output is correct
13 Correct 603 ms 45032 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 3 ms 10408 KB Output is correct
4 Correct 3 ms 16476 KB Output is correct
5 Incorrect 3 ms 16476 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Incorrect 3 ms 16472 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 2 ms 10332 KB Output is correct
6 Correct 42 ms 13116 KB Output is correct
7 Correct 46 ms 13468 KB Output is correct
8 Correct 61 ms 15164 KB Output is correct
9 Correct 62 ms 15184 KB Output is correct
10 Correct 62 ms 15148 KB Output is correct
11 Correct 62 ms 15188 KB Output is correct
12 Correct 60 ms 15184 KB Output is correct
13 Correct 61 ms 15444 KB Output is correct
14 Correct 62 ms 15188 KB Output is correct
15 Correct 2 ms 10332 KB Output is correct
16 Correct 2 ms 10332 KB Output is correct
17 Correct 3 ms 16476 KB Output is correct
18 Correct 3 ms 16476 KB Output is correct
19 Correct 3 ms 16728 KB Output is correct
20 Correct 6 ms 16732 KB Output is correct
21 Correct 52 ms 19528 KB Output is correct
22 Correct 4 ms 16728 KB Output is correct
23 Correct 6 ms 16736 KB Output is correct
24 Correct 53 ms 19540 KB Output is correct
25 Correct 50 ms 19340 KB Output is correct
26 Correct 49 ms 19604 KB Output is correct
27 Correct 52 ms 19532 KB Output is correct
28 Correct 100 ms 21920 KB Output is correct
29 Correct 875 ms 45856 KB Output is correct
30 Correct 105 ms 23984 KB Output is correct
31 Correct 858 ms 45608 KB Output is correct
32 Correct 605 ms 45188 KB Output is correct
33 Correct 598 ms 45648 KB Output is correct
34 Correct 803 ms 45668 KB Output is correct
35 Correct 3 ms 10332 KB Output is correct
36 Correct 3 ms 16476 KB Output is correct
37 Correct 43 ms 19276 KB Output is correct
38 Correct 442 ms 41888 KB Output is correct
39 Correct 559 ms 44816 KB Output is correct
40 Correct 786 ms 45256 KB Output is correct
41 Correct 823 ms 45376 KB Output is correct
42 Correct 907 ms 45768 KB Output is correct
43 Correct 519 ms 45140 KB Output is correct
44 Correct 528 ms 44884 KB Output is correct
45 Correct 63 ms 18004 KB Output is correct
46 Correct 416 ms 44808 KB Output is correct
47 Correct 603 ms 45032 KB Output is correct
48 Correct 2 ms 10332 KB Output is correct
49 Correct 2 ms 10332 KB Output is correct
50 Correct 3 ms 10408 KB Output is correct
51 Correct 3 ms 16476 KB Output is correct
52 Incorrect 3 ms 16476 KB Output isn't correct
53 Halted 0 ms 0 KB -