oj.uz

답안 #235131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235131 2020-05-27T07:04:34 Z kartel San (COCI17_san) C++14
120 / 120
 287 ms 416 KB 
#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;

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

void dfs(ll v, ll kol)
{
    if (kol >= k) {ans += paths[v]; return;}
    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];
//    n = rand() % 40 + 1;
//    k = rand() % ll(4e10);
//    for (i = 1; i <= n; i++) h[i] = rand() % ll(1e9), g[i] = rand() % ll(1e9);
    for (i = 1; i <= n; i++)
        for (j = i + 1; j <= n; j++)
            if (h[j] >= h[i])
                  G[i].pb(j);

    for (ll v = n; v >= 1; v--)
    {
        paths[v] = 1;

        for (auto u : G[v])
            paths[v] += paths[u];
    }

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

    cout << ans;
}

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

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 287 ms 416 KB Output is correct