oj.uz

Submission #1071717

# Submission time Handle Problem Language Result Execution time Memory
1071717 2024-08-23T10:24:58 Z VMaksimoski008 San (COCI17_san) C++17
48 / 120
 60 ms 408 KB 
#include <bits/stdc++.h>
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

signed main() {
    ll n, T, ans = 0;
    cin >> n >> T;

    vector<ll> h(n), g(n);
    for(int i=0; i<n; i++) cin >> h[i] >> g[i];

    for(int s=1; s<(1<<n); s++) {
        ll sum = 0, last = -1, ok = 1;
        for(int i=0; i<n; i++) {
            if(s & (1 << i)) {
                sum += g[i];
                if(last > -1 && h[last] > h[i]) ok = 0;
                last = i;
            }
        }
        if(ok) ans += (sum >= T);
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 408 KB Output is correct
2 Correct 60 ms 348 KB Output is correct

Subtask #3
0 / 24.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 24.0

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