oj.uz

답안 #473173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473173 2021-09-15T09:45:47 Z Mr_Ph San (COCI17_san) C++14
48 / 120
 524 ms 19856 KB 
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int dx[4] = {0, 0, 1, -1};
//int dy[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
    ll n,k;
    cin>>n>>k;
    vector<pair<ll,ll>>arr(n);
    for(int i=0; i<n; i++)
        cin>>arr[i].first>>arr[i].second;
    set<vector<ll>>st;
    for(ll i=0; i<(1<<n); i++)
    {
        vll temp;
        ll sum=0;
        ll prv=0;
        for(ll e=0; e<n; e++)
        {
            ll Try=(1<<e)&i;
            if(Try)
            {
                if(arr[e].first>=prv)
                {
                    prv=arr[e].first;
                    temp.push_back(e);
                    sum+=arr[e].second;
                }
            }
        }
        if(sum>=k)
            st.insert(temp);
    }
    cout<<st.sz<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    //freopen("window.in","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;//int st;
    //cin>>t;//cin>>st;
    while(t--)
        solve();
}

Subtask #1
24.0 / 24.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 24.0

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