oj.uz

Submission #767897

# Submission time Handle Problem Language Result Execution time Memory
767897 2023-06-27T09:13:30 Z dxz05 Akcija (COCI21_akcija) C++17
10 / 110
 26 ms 31700 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
#define BIT(x, i) (((x) >> (i)) & 1)
//#define endl '\n'

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 2002;

pair<int, int> p[N];
ll dp[N][N];

void solve(){
    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++) cin >> p[i].first >> p[i].second;

    sort(p + 1, p + n + 1, [](auto x, auto y){
        return x.second < y.second;
    });

    for (int i = 0; i <= n; i++){
        for (int t = 0; t <= n; t++){
            dp[i][t] = 1e18;
        }
    }

    dp[0][0] = 0;
    for (int i = 1; i <= n; i++){
        dp[i][0] = 0;

        auto [w, d] = p[i];

        for (int t = 0; t < i; t++){
            if (d > t){
                dp[i][t + 1] = min(dp[i][t + 1], dp[i - 1][t] + w);
            }
        }
    }

    for (int t = n; t >= 1; t--){
        ll ans = 1e18;
        for (int i = t; i <= n; i++){
            ans = min(ans, dp[i][t]);
        }
        if (ans != 1e18){
            cout << t << ' ' << ans << endl;
            return;
        }
    }

}

int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int test_cases = 1;
//    cin >> test_cases;

    for (int test = 1; test <= test_cases; test++){
        // cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:65:13: warning: unused variable 'startTime' [-Wunused-variable]
   65 |     clock_t startTime = clock();
      |             ^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 30420 KB Output is correct
2 Correct 18 ms 31700 KB Output is correct
3 Correct 16 ms 29068 KB Output is correct
4 Correct 21 ms 28760 KB Output is correct
5 Correct 18 ms 31316 KB Output is correct
6 Correct 19 ms 28656 KB Output is correct
7 Correct 26 ms 31572 KB Output is correct
8 Correct 19 ms 29268 KB Output is correct
9 Correct 18 ms 28544 KB Output is correct
10 Correct 19 ms 29684 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 30420 KB Output is correct
2 Correct 18 ms 31700 KB Output is correct
3 Correct 16 ms 29068 KB Output is correct
4 Correct 21 ms 28760 KB Output is correct
5 Correct 18 ms 31316 KB Output is correct
6 Correct 19 ms 28656 KB Output is correct
7 Correct 26 ms 31572 KB Output is correct
8 Correct 19 ms 29268 KB Output is correct
9 Correct 18 ms 28544 KB Output is correct
10 Correct 19 ms 29684 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Incorrect 17 ms 30392 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 30.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 30420 KB Output is correct
2 Correct 18 ms 31700 KB Output is correct
3 Correct 16 ms 29068 KB Output is correct
4 Correct 21 ms 28760 KB Output is correct
5 Correct 18 ms 31316 KB Output is correct
6 Correct 19 ms 28656 KB Output is correct
7 Correct 26 ms 31572 KB Output is correct
8 Correct 19 ms 29268 KB Output is correct
9 Correct 18 ms 28544 KB Output is correct
10 Correct 19 ms 29684 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Incorrect 17 ms 30392 KB Output isn't correct
15 Halted 0 ms 0 KB -