oj.uz

답안 #474075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474075 2021-09-16T19:09:39 Z _L__ San (COCI17_san) C++17
0 / 120
 1000 ms 10640 KB 
// This code is written by _L__
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;
#define endl '\n'
#define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll mod = 1e9+7, N = 5e5+13, inf = 1e11;
const ld E = 1e-6;
#define ff first
#define ss second

int main(void){
    F_word;
    ll n, k; cin >> n >> k;
    vector<pair<ll, ll>> a1, a2;
    for(int i = 0; i < n/2; ++i){ll x, y; cin >> x >> y; a1.push_back({x,y});}
    for(int i = n/2; i < n; ++i){ll x, y; cin >> x >> y; a2.push_back({x,y});}
    int sz1 = a1.size(), sz2 = a2.size();
    vector<pair<ll, ll>> smth;
    for(int i = 0; i < (1<<sz1); ++i){
        ll last = 0, x = 0;
        bool valid = 1;
        for(int j = 0; j < sz1; ++j){
            if(!(i&(1<<j))) continue;
            if(a1[j].ff >= last){
                last = a1[j].ff;
                x += a1[j].ss;
            } else {
                valid = 0;
                break;
            }
        }
        if(valid) smth.push_back({last, x});
    }
    map<ll, vector<ll>> bar;
    for(int i = 0; i < (1<<sz2); ++i){
        ll fi = inf, last = 0, x = 0, valid = 1;
        for(int j = 0; j < sz2; ++j){   
            if(!(i&(1<<j))) continue;
            if(fi == inf) fi = a2[j].ff;
            if(a2[j].ff >= last){
                last = a2[j].ff;
                x += a2[j].ss;
            } else {
                valid = 0;
                break;
            }
        }
        if(valid) bar[fi].push_back(x);
    }
    ll ans = 0;
    for(auto i: bar) sort(i.ss.begin(), i.ss.end());
    for(auto i: smth){
        for(auto u: bar){
            if(u.ff >= i.ff){
                ll z = lower_bound(u.ss.begin(), u.ss.end(), max(k-i.ss, 0ll))-u.ss.begin();
                ans += u.ss.size()-z;
            }
        }
    }
    cout << ans << endl;
}

Subtask #1
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 794 ms 1592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1034 ms 2624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 10640 KB Time limit exceeded
2 Halted 0 ms 0 KB -