Submission #235124

#	Time	Username	Problem	Language	Result	Execution time	Memory
235124		kartel	San (COCI17_san)	C++14	48 / 120	6 ms	512 KiB

san

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, i, j, h[25], g[25];
ll k, ans;
vector <int> G[25];

void dfs(int v, ll kol)
{
    if (kol >= k) ans++;
    for (auto u : G[v])
    {
        dfs(u, kol + g[u]);
    }
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> k;
    for (i = 1; i <= n; i++) cin >> h[i] >> g[i];
    for (i = 1; i <= n; i++)
        for (j = i + 1; j <= n; j++)
            if (h[j] >= h[i])
              G[i].pb(j);

    for (i = 1; i <= n; i++) dfs(i, g[i]);

    cout << ans;
}

//110000
//110000
//001100
//001100
//000011

• Subtask 1: 24 / 24
• Subtask 2: 24 / 24
• Subtask 3: 0 / 24
• Subtask 4: 0 / 24
• Subtask 5: 0 / 24