oj.uz

답안 #996631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996631 2024-06-11T01:30:22 Z cpptowin Feast (NOI19_feast) C++17
12 / 100
 207 ms 23312 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf (int)1e18
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1LL)
#define offbit(i,j) (i^(1LL<<j))
#define onbit(i,j) (i|(1LL<<j))
#define vi vector<int>
#define mp make_pair
template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
int n,k;
int a[maxn];
vi v;
int arr[maxn];
set<pii> s;
set<int> save;
main()
{
#define name "TASK"
    if(fopen(name".inp","r"))
    {
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    fo(i,1,n)
        cin >> a[i];
    int pos = 0;
    fo(i,1,n)
    {
        int now = i;
        int sum = a[i];
        while(now + 1 <= n and a[i] * a[now + 1] >= 0) sum += a[++now];
        if(sum >= 0) v.pb(sum);
        arr[++pos] = sum;
        s.insert({abs(sum),pos});
        save.insert(pos);
        i = now;
    }
    if(v.size() <= k)
    {
        int tot = 0;
        for(int it : v) tot += it;
        return cout << tot,0;
    }
    fod(i,v.size(),k + 1)
    {
        int id = s.begin() -> se;
        auto lb = save.lower_bound(id);
        auto pre = prev(lb),nxt = next(lb);
        s.erase({abs(arr[*pre]),*pre});
        s.erase({abs(arr[id]),id});
        s.erase({abs(arr[*nxt]),*nxt});
        arr[id] += arr[*pre];
        arr[id] += arr[*nxt];
        s.insert({abs(arr[id]),id});
        save.erase(*pre);
        save.erase(*nxt);
    }
    int ans = 0;
    for(int it : save) if(arr[it] >= 0) ans += arr[it];
    cout << ans;
}

Compilation message

feast.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
feast.cpp: In function 'int main()':
feast.cpp:70:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   70 |     if(v.size() <= k)
      |        ~~~~~~~~~^~~~
feast.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
feast.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 4444 KB Output is correct
2 Correct 19 ms 4444 KB Output is correct
3 Correct 19 ms 4444 KB Output is correct
4 Correct 20 ms 4444 KB Output is correct
5 Correct 19 ms 4444 KB Output is correct
6 Correct 18 ms 4440 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 18 ms 4440 KB Output is correct
9 Correct 18 ms 4568 KB Output is correct
10 Correct 21 ms 4564 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4444 KB Output is correct
2 Correct 12 ms 4444 KB Output is correct
3 Correct 12 ms 4572 KB Output is correct
4 Correct 13 ms 5468 KB Output is correct
5 Correct 20 ms 7240 KB Output is correct
6 Correct 13 ms 5464 KB Output is correct
7 Correct 14 ms 5584 KB Output is correct
8 Correct 21 ms 7224 KB Output is correct
9 Correct 20 ms 7240 KB Output is correct
10 Correct 13 ms 5468 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 4444 KB Output is correct
2 Correct 19 ms 4444 KB Output is correct
3 Correct 19 ms 4444 KB Output is correct
4 Correct 20 ms 4444 KB Output is correct
5 Correct 19 ms 4444 KB Output is correct
6 Correct 18 ms 4440 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 18 ms 4440 KB Output is correct
9 Correct 18 ms 4568 KB Output is correct
10 Correct 21 ms 4564 KB Output is correct
11 Correct 12 ms 4444 KB Output is correct
12 Correct 12 ms 4444 KB Output is correct
13 Correct 12 ms 4572 KB Output is correct
14 Correct 13 ms 5468 KB Output is correct
15 Correct 20 ms 7240 KB Output is correct
16 Correct 13 ms 5464 KB Output is correct
17 Correct 14 ms 5584 KB Output is correct
18 Correct 21 ms 7224 KB Output is correct
19 Correct 20 ms 7240 KB Output is correct
20 Correct 13 ms 5468 KB Output is correct
21 Incorrect 207 ms 23312 KB Output isn't correct
22 Halted 0 ms 0 KB -