oj.uz

답안 #401627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401627 2021-05-10T15:07:26 Z Fidisk Feast (NOI19_feast) C++14
33 / 100
 121 ms 10180 KB 
#include <bits/stdc++.h>
using namespace std;

#define oo 1e15
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
typedef pair<pair<long long,long long>,pair<long long,long long>> pllll;
typedef pair<pair<long long,long long>,bool> pllb;

const ll base=361;
const ll mod=998244353;
const ld eps=1e-5;
const ll maxn=1e6;

struct comp{
    bool operator() (pll x,pll y) {
        return x.fi>y.fi;
    }
};

ll sig(ll x) {
    if (x<0) {
        return -1;
    }
    return 1;
}

priority_queue<pll,vector<pll>,comp> heap;
ll n,k,i,a[400009],tmp,b[400009],m,l[400009],r[400009],res,cnt,cur;
bool ok[400009];

int main(){
    IO;
    cin>>n>>k;
    //cout<<n<<'\n';
    for (i=1;i<=n;i++) {
        cin>>a[i];
    }
    for (i=1;i<=n;i++) {
        if (i!=1&&sig(a[i])*sig(a[i-1])<0) {
            if (m==0&&cur<0) {
                cur=a[i];
            }
            else {
                //cout<<i<<'\n';
                m++;
                b[m]=cur;
                cur=a[i];
            }
        }
        else {
            cur+=a[i];
        }
        //cout<<cur<<'\n';
    }
    if (cur>0) {
        m++;
        b[m]=cur;
    }
    //cout<<m<<'\n';
    for (i=1;i<=m;i++) {
        //cout<<b[i]<<' ';
        l[i]=i+1;
        r[i]=i-1;
        if (b[i]>0) {
            cnt++;
        }
        heap.push({abs(b[i]),i});
    }
    //for (i=2;i<=m;i++) {
    //    if (sig(b[i])*sig(b[i-1])>=0) {
    //        cout<<"a\n";
    //    }
    //}
    //cout<<'\n';
    r[1]=0;
    l[m]=0;
    l[0]=1;
    r[m+1]=m;
    while (cnt>k) {

        while (b[l[0]]<0) {
            ok[l[0]]=true;
            l[0]=l[l[0]];
            r[l[0]]=0;
        }
        while (b[r[m+1]]<0) {
            ok[r[m+1]]=true;
            r[m+1]=r[r[m+1]];
            l[r[m+1]]=0;
        }

        ll y=heap.top().fi;
        ll x=heap.top().se;
        heap.pop();
        if (ok[x]) continue;
        //cout<<b[x]<<' '<<l[x]<<' '<<r[x]<<'\n';
        cnt--;
        ok[l[x]]=true;
        ok[r[x]]=true;
        b[x]=b[l[x]]+b[r[x]]+b[x];
        l[x]=l[l[x]];
        r[x]=r[r[x]];
        //if (l[x]!=0) {
            r[l[x]]=x;
        //}
        //if (r[x]!=0) {
            l[r[x]]=x;
        //}
        //if (b[x]>=0) {
            heap.push({abs(b[x]),x});
        //}
    }
    for (i=1;i<=m;i++) {
        if (!ok[i]&&b[i]>0) {
            res+=b[i];
        }
    }
    cout<<res<<'\n';
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:106:12: warning: unused variable 'y' [-Wunused-variable]
  106 |         ll y=heap.top().fi;
      |            ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 2520 KB Output is correct
2 Correct 64 ms 2596 KB Output is correct
3 Correct 51 ms 2628 KB Output is correct
4 Correct 39 ms 2580 KB Output is correct
5 Correct 52 ms 2568 KB Output is correct
6 Correct 37 ms 2572 KB Output is correct
7 Correct 38 ms 2544 KB Output is correct
8 Correct 79 ms 2604 KB Output is correct
9 Correct 52 ms 2512 KB Output is correct
10 Correct 55 ms 2636 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2572 KB Output is correct
2 Correct 34 ms 2680 KB Output is correct
3 Correct 26 ms 2648 KB Output is correct
4 Correct 27 ms 2568 KB Output is correct
5 Correct 37 ms 2604 KB Output is correct
6 Correct 33 ms 2516 KB Output is correct
7 Correct 49 ms 2656 KB Output is correct
8 Correct 39 ms 2640 KB Output is correct
9 Correct 38 ms 2512 KB Output is correct
10 Correct 38 ms 2608 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 10048 KB Output is correct
2 Correct 112 ms 10024 KB Output is correct
3 Correct 98 ms 10180 KB Output is correct
4 Incorrect 101 ms 10096 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 344 KB Output is correct
26 Correct 2 ms 360 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Incorrect 2 ms 344 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 2520 KB Output is correct
2 Correct 64 ms 2596 KB Output is correct
3 Correct 51 ms 2628 KB Output is correct
4 Correct 39 ms 2580 KB Output is correct
5 Correct 52 ms 2568 KB Output is correct
6 Correct 37 ms 2572 KB Output is correct
7 Correct 38 ms 2544 KB Output is correct
8 Correct 79 ms 2604 KB Output is correct
9 Correct 52 ms 2512 KB Output is correct
10 Correct 55 ms 2636 KB Output is correct
11 Correct 26 ms 2572 KB Output is correct
12 Correct 34 ms 2680 KB Output is correct
13 Correct 26 ms 2648 KB Output is correct
14 Correct 27 ms 2568 KB Output is correct
15 Correct 37 ms 2604 KB Output is correct
16 Correct 33 ms 2516 KB Output is correct
17 Correct 49 ms 2656 KB Output is correct
18 Correct 39 ms 2640 KB Output is correct
19 Correct 38 ms 2512 KB Output is correct
20 Correct 38 ms 2608 KB Output is correct
21 Correct 121 ms 10048 KB Output is correct
22 Correct 112 ms 10024 KB Output is correct
23 Correct 98 ms 10180 KB Output is correct
24 Incorrect 101 ms 10096 KB Output isn't correct
25 Halted 0 ms 0 KB -