oj.uz

답안 #329605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329605 2020-11-21T19:21:13 Z TLP39 Mountains (NOI20_mountains) C++14
22 / 100
 120 ms 8684 KB 
#include<bits/stdc++.h>
using namespace std;


void so(int x,int y, long long int a[300001],int b[300001],int c[300001])
{
    if(x==y)
    {
        b[x]=0;
        c[x]=0;
        return;
    }
    if(y==x+1)
    {
        if(a[x]<a[x+1])
        {
            b[x]=0;
            c[x]=0;
            b[x+1]=1;
            c[x+1]=0;
        }
        else if(a[x]>a[x+1])
        {
            b[x]=0;
            c[x]=0;
            b[x+1]=0;
            c[x+1]=1;
            int temp=a[x];
            a[x]=a[x+1];
            a[x+1]=temp;
        }
        else
        {
            b[x]=0;
            c[x]=0;
            b[x+1]=0;
            c[x+1]=0;
        }
        return;
    }
    int ha=(y-x+1)/2;
    so(x,x+ha-1,a,b,c);
    so(x+ha,y,a,b,c);
    int a1[y-x+1]={};
    int b1[y-x+1]={};
    int c1[y-x+1]={};
    int p1=x,p11=x;
    int p2=x+ha;
    int p=0;
    while(p1<x+ha || p2<=y)
    {
        if(p1>=x+ha)
        {
            if(a[p2]>a[p1-1])
            {
                p11=x+ha;
            }
            a1[p]=a[p2];
            b1[p]=b[p2]+(p11-x);
            c1[p]=c[p2];
            p++;
            p2++;
        }
        else if(p2>y)
        {
            a1[p]=a[p1];
            b1[p]=b[p1];
            c1[p]=c[p1]+y-x-ha+1;
            p++;
            p1++;
        }
        else if(a[p1]<=a[p2])
        {
            a1[p]=a[p1];
            b1[p]=b[p1];
            c1[p]=c[p1]+(p2-x-ha);
            if(p1>x && a[p1]!=a[p1-1])
            {
                p11=p1;
            }
            p++;
            p1++;
        }
        else
        {
            if(p1>x && a[p2]>a[p1-1])
            {
                p11=p1;
            }
            a1[p]=a[p2];
            b1[p]=b[p2]+(p11-x);
            c1[p]=c[p2];
            p++;
            p2++;
        }
    }
    for(int i=0;i<=y-x;i++)
    {
        a[x+i]=a1[i];
        b[x+i]=b1[i];
        c[x+i]=c1[i];
    }
    return;
}

int main()
{
    int n;
    scanf("%d",&n);
    long long int h[300001]={};
    int bf[300001]={};
    int af[300001]={};
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&h[i]);
    }
    so(0,n-1,h,bf,af);
    long long int ans=0;
    for(int i=0;i<n;i++)
    {
        ans+=(long long)1*bf[i]*af[i];
    }
    printf("%lld",ans);
}

Compilation message

Mountains.cpp: In function 'int main()':
Mountains.cpp:109:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  109 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Mountains.cpp:115:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  115 |         scanf("%lld",&h[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Incorrect 120 ms 8556 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 8576 KB Output is correct
2 Correct 78 ms 8576 KB Output is correct
3 Correct 77 ms 8556 KB Output is correct
4 Correct 77 ms 8556 KB Output is correct
5 Correct 87 ms 8556 KB Output is correct
6 Correct 77 ms 8556 KB Output is correct
7 Correct 76 ms 8556 KB Output is correct
8 Correct 71 ms 8556 KB Output is correct
9 Correct 72 ms 8516 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 8576 KB Output is correct
2 Correct 78 ms 8576 KB Output is correct
3 Correct 77 ms 8556 KB Output is correct
4 Correct 77 ms 8556 KB Output is correct
5 Correct 87 ms 8556 KB Output is correct
6 Correct 77 ms 8556 KB Output is correct
7 Correct 76 ms 8556 KB Output is correct
8 Correct 71 ms 8556 KB Output is correct
9 Correct 72 ms 8516 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 86 ms 8556 KB Output is correct
12 Correct 86 ms 8556 KB Output is correct
13 Correct 86 ms 8556 KB Output is correct
14 Correct 90 ms 8556 KB Output is correct
15 Correct 88 ms 8556 KB Output is correct
16 Correct 86 ms 8556 KB Output is correct
17 Correct 86 ms 8556 KB Output is correct
18 Correct 75 ms 8684 KB Output is correct
19 Correct 71 ms 8556 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4972 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4972 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 8576 KB Output is correct
2 Correct 78 ms 8576 KB Output is correct
3 Correct 77 ms 8556 KB Output is correct
4 Correct 77 ms 8556 KB Output is correct
5 Correct 87 ms 8556 KB Output is correct
6 Correct 77 ms 8556 KB Output is correct
7 Correct 76 ms 8556 KB Output is correct
8 Correct 71 ms 8556 KB Output is correct
9 Correct 72 ms 8516 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 86 ms 8556 KB Output is correct
12 Correct 86 ms 8556 KB Output is correct
13 Correct 86 ms 8556 KB Output is correct
14 Correct 90 ms 8556 KB Output is correct
15 Correct 88 ms 8556 KB Output is correct
16 Correct 86 ms 8556 KB Output is correct
17 Correct 86 ms 8556 KB Output is correct
18 Correct 75 ms 8684 KB Output is correct
19 Correct 71 ms 8556 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 103 ms 8556 KB Output is correct
22 Correct 109 ms 8556 KB Output is correct
23 Correct 106 ms 8556 KB Output is correct
24 Correct 104 ms 8556 KB Output is correct
25 Correct 105 ms 8556 KB Output is correct
26 Correct 103 ms 8556 KB Output is correct
27 Correct 105 ms 8572 KB Output is correct
28 Correct 81 ms 8576 KB Output is correct
29 Correct 80 ms 8556 KB Output is correct
30 Correct 3 ms 4972 KB Output is correct

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Incorrect 120 ms 8556 KB Output isn't correct
3 Halted 0 ms 0 KB -