oj.uz

답안 #996636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996636 2024-06-11T02:02:25 Z cpptowin Feast (NOI19_feast) C++17
100 / 100
 227 ms 26048 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];
int cnt;
int arr[maxn];
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];
    a[0] = a[n + 1] = -inf;
    int pos = 0;
    set<pii> s;
    set<int> save;
    fo(i,0,n + 1)
    {
        int now = i;
        int sum = 0;
        while(now <= n + 1 and (a[i] >= 0) == (a[now] >= 0)) sum += a[now++];
        if(sum >= 0) cnt++;
        arr[++pos] = sum;
        s.insert({abs(sum),pos});
        save.insert(pos);
        i = now - 1;
    }
    fod(i,cnt,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[*nxt]),*nxt});
        s.erase({abs(arr[id]),id});
        arr[id] += arr[*pre];
        arr[id] += arr[*nxt];
        save.erase(*pre);
        save.erase(*nxt);
        s.insert({abs(arr[id]),id});
    }
    int ans = 0;
    for(int it : save) if(arr[it] >= 0) ans += arr[it];
    cout << ans;
}

Compilation message

feast.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main()
      | ^~~~
feast.cpp: In function 'int main()':
feast.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
feast.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 227 ms 22816 KB Output is correct
2 Correct 199 ms 22612 KB Output is correct
3 Correct 205 ms 22868 KB Output is correct
4 Correct 206 ms 22612 KB Output is correct
5 Correct 215 ms 22608 KB Output is correct
6 Correct 193 ms 22868 KB Output is correct
7 Correct 195 ms 22868 KB Output is correct
8 Correct 199 ms 22868 KB Output is correct
9 Correct 211 ms 22960 KB Output is correct
10 Correct 211 ms 23120 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2512 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2512 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2516 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 2 ms 2648 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4440 KB Output is correct
2 Correct 19 ms 4444 KB Output is correct
3 Correct 20 ms 4440 KB Output is correct
4 Correct 25 ms 4444 KB Output is correct
5 Correct 18 ms 4440 KB Output is correct
6 Correct 19 ms 4444 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 20 ms 4568 KB Output is correct
9 Correct 20 ms 4444 KB Output is correct
10 Correct 19 ms 4444 KB Output is correct
11 Correct 12 ms 4568 KB Output is correct
12 Correct 12 ms 4440 KB Output is correct
13 Correct 13 ms 4444 KB Output is correct
14 Correct 12 ms 4568 KB Output is correct
15 Correct 19 ms 4572 KB Output is correct
16 Correct 12 ms 4568 KB Output is correct
17 Correct 12 ms 4444 KB Output is correct
18 Correct 19 ms 4440 KB Output is correct
19 Correct 19 ms 4444 KB Output is correct
20 Correct 12 ms 4444 KB Output is correct
21 Correct 227 ms 22816 KB Output is correct
22 Correct 199 ms 22612 KB Output is correct
23 Correct 205 ms 22868 KB Output is correct
24 Correct 206 ms 22612 KB Output is correct
25 Correct 215 ms 22608 KB Output is correct
26 Correct 193 ms 22868 KB Output is correct
27 Correct 195 ms 22868 KB Output is correct
28 Correct 199 ms 22868 KB Output is correct
29 Correct 211 ms 22960 KB Output is correct
30 Correct 211 ms 23120 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 0 ms 2396 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2512 KB Output is correct
42 Correct 0 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 0 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2512 KB Output is correct
50 Correct 0 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2516 KB Output is correct
53 Correct 1 ms 2652 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 1 ms 2652 KB Output is correct
56 Correct 1 ms 2652 KB Output is correct
57 Correct 1 ms 2652 KB Output is correct
58 Correct 1 ms 2652 KB Output is correct
59 Correct 1 ms 2652 KB Output is correct
60 Correct 2 ms 2648 KB Output is correct
61 Correct 132 ms 25684 KB Output is correct
62 Correct 111 ms 26048 KB Output is correct
63 Correct 203 ms 25936 KB Output is correct
64 Correct 133 ms 25924 KB Output is correct
65 Correct 165 ms 25852 KB Output is correct
66 Correct 195 ms 25964 KB Output is correct
67 Correct 177 ms 25540 KB Output is correct
68 Correct 204 ms 26040 KB Output is correct
69 Correct 199 ms 25668 KB Output is correct
70 Correct 220 ms 25428 KB Output is correct