oj.uz

Submission #42356

# Submission time Handle Problem Language Result Execution time Memory
42356 2018-02-26T13:12:27 Z dqhungdl 즐거운 채소 기르기 (JOI14_growing) C++14
0 / 100
 17 ms 2136 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int64_t,int64_t> ii;
int64_t n,res=0,treeL[300005],treeR[300005];
ii a[300005];

void UpdateL(int64_t idx)
{
    while(idx>0)
    {
        treeL[idx]++;
        idx-=idx&-idx;
    }
}

int64_t QueryL(int64_t idx)
{
    int64_t rs=0;
    while(idx<=n)
    {
        rs+=treeL[idx];
        idx+=idx&-idx;
    }
    return rs;
}

void UpdateR(int64_t idx)
{
    while(idx<=n)
    {
        treeR[idx]++;
        idx+=idx&-idx;
    }
}

int64_t QueryR(int64_t idx)
{
    int64_t rs=0;
    while(idx>0)
    {
        rs+=treeR[idx];
        idx-=idx&-idx;
    }
    return rs;
}

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>n;
    for(int64_t i=1;i<=n;i++)
    {
        cin>>a[i].first;
        a[i].second=i;
    }
    sort(a+1,a+n+1);
    int64_t tmp=1,L=0,R=n+1;
    for(int64_t i=2;i<=n;i++)
        if(a[i].first!=a[i-1].first)
            while(tmp<i)
            {
                int64_t pos=a[tmp].second+QueryL(a[tmp].second)-QueryR(a[tmp].second);
                int64_t moveL=pos-L-1;
                int64_t moveR=R-pos-1;
                res+=min(moveL,moveR);
                if(moveL<moveR)
                {
                    L++;
                    UpdateL(a[tmp].second);
                }
                else
                {
                    R--;
                    UpdateR(a[tmp].second);
                }
                tmp++;
            }
    cout<<res;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 496 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 548 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Incorrect 2 ms 548 KB Output isn't correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 548 KB Output is correct
2 Incorrect 1 ms 548 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct
2 Incorrect 2 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2136 KB Output isn't correct
2 Halted 0 ms 0 KB -