oj.uz

답안 #145683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145683 2019-08-20T18:41:45 Z heon San (COCI17_san) C++17
120 / 120
 309 ms 21060 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <iomanip>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef vector <int> vi;
typedef pair<int,int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 1e9 + 7;
const ll inf = 3e18 + 5;
int add(int a, int b) { return (a += b) < mod ? a : a - mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
 
int h[41], g[41];
int n;
vector<pair<int, ll>> v;
vector<pair<ll, int>> u;
 
void f(int i, ll coins){
  for(int j = i + 1; j < n / 2; j++){
    if(h[i] <= h[j]){
      f(j, coins + g[j]);
    }
  }
  v.emplace_back(h[i], coins);
}
 
void ff(int i, ll coins, int start){
  for(int j = i + 1; j < n; j++){
    if(h[i] <= h[j]){
      ff(j, coins + g[j], start);
    }
  }
  u.emplace_back(coins, start);
}
 
int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
 
  ll k;
  cin >> n >> k;
  for(int i = 0; i < n; i++) cin >> h[i] >> g[i];
  for(int i = 0; i < n / 2; i++) f(i, g[i]);
  for(int i = n / 2; i < n; i++) ff(i, g[i], i);
  h[n] = 1e9 + 5;
  v.emplace_back(0, 0);
  u.emplace_back(0, n);
  sort(all(v));
  sort(all(u));
  ll res = 0;
  map<int, vector <ll>> ump;
  for(auto [coins, start] : u){
    ump[start].push_back(coins);
  }
  for(auto [endh, coins] : v){
    for(int i = n / 2; i <= n; i++){
      if(h[i] >= endh){
        res += ump[i].end() - lower_bound(all(ump[i]), k - coins);
      }
    }
  }
  cout << res;
}

Subtask #1
24.0 / 24.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 2672 KB Output is correct
2 Correct 3 ms 504 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 5356 KB Output is correct
2 Correct 13 ms 1036 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 21060 KB Output is correct
2 Correct 64 ms 3560 KB Output is correct