oj.uz

Submission #530967

# Submission time Handle Problem Language Result Execution time Memory
530967 2022-02-27T08:27:53 Z Slavita Akcija (COCI21_akcija) C++14
20 / 110
 387 ms 87468 KB 
#include <bits/stdc++.h>
#pragma optimize("O3")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e3 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, k;
pair<ll, ll> a[N];
set<pair<ll, ll>> dp[N];

bool cmp(pair<ll, ll> a, pair<ll, ll> b){
    if (a.se <= b.se) return 1;
    return 0;
}

void upd(ll &a, ll b){
    if (a > b) {a = b;}
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> k;
    for (int i = 1; i <= n; i++){
        cin >> a[i].fi >> a[i].se;
    }
    stable_sort(a + 1, a + n + 1, cmp);

    dp[0].insert({0, 0});
    for (int i = 0; i < n; i++){
        while(si(dp[i]) > k * 100) dp[i].erase(--dp[i].end());
        for (auto item : dp[i]){
            dp[i + 1].insert(item);
        }

        for (auto item : dp[i]){
            if (-item.fi + 1 <= a[i + 1].se)
                dp[i + 1].insert({item.fi - 1, item.se + a[i + 1].fi});
        }
    }

    set<pair<ll, ll>> ans;
    for (auto item : dp[n]){
        ans.insert(item);
    }

    int kol = 0;
    for (auto item : ans){
        kol++;
        if (kol > k) break;
        cout << -item.fi << ' ' << item.se << en;
    }

    if (kol <= k){
        for (int i = kol + 1; i <= k; i++) cout << 0 << ' ' << 0 << en;
    }
    return 0;
}
/*
*/

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      |

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 12100 KB Output is correct
2 Correct 33 ms 12504 KB Output is correct
3 Correct 29 ms 11596 KB Output is correct
4 Correct 27 ms 11468 KB Output is correct
5 Correct 31 ms 12496 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 7 ms 2892 KB Output is correct
10 Correct 15 ms 5964 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 460 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 12100 KB Output is correct
2 Correct 33 ms 12504 KB Output is correct
3 Correct 29 ms 11596 KB Output is correct
4 Correct 27 ms 11468 KB Output is correct
5 Correct 31 ms 12496 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 7 ms 2892 KB Output is correct
10 Correct 15 ms 5964 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 460 KB Output is correct
14 Incorrect 45 ms 12360 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 76620 KB Output is correct
2 Correct 387 ms 85612 KB Output is correct
3 Correct 212 ms 47540 KB Output is correct
4 Correct 99 ms 22616 KB Output is correct
5 Correct 369 ms 87468 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 29 ms 6860 KB Output is correct
8 Correct 3 ms 1356 KB Output is correct
9 Correct 3 ms 1100 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 157 ms 40372 KB Output is correct

Subtask #5
0 / 30.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 12100 KB Output is correct
2 Correct 33 ms 12504 KB Output is correct
3 Correct 29 ms 11596 KB Output is correct
4 Correct 27 ms 11468 KB Output is correct
5 Correct 31 ms 12496 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 7 ms 2892 KB Output is correct
10 Correct 15 ms 5964 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 460 KB Output is correct
14 Incorrect 45 ms 12360 KB Output isn't correct
15 Halted 0 ms 0 KB -