oj.uz

답안 #200004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200004 2020-02-04T17:41:30 Z mdn2002 San (COCI17_san) C++14
24 / 120
 151 ms 10708 KB 
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
long long n,k,a[44],b[44],nm,ans;
vector<pair<long long,long long> >on;
vector<long long>to[44];
vector<long long>cal;
map<long long,long long>mp;
void bt(int x,int y,int mx,long long sum)
{
    if(y==mx+1)
    {
        if(sum>=k)ans++;
        if(sum>0)
        {
            if(mx==n/2)on.push_back({mp[a[x]],sum});
            else to[mp[a[x]]].push_back(sum);
        }
        return;
    }
    if(a[x]<=a[y])bt(y,y+1,mx,sum+b[y]);
    bt(x,y+1,mx,sum);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen("gpsduel.in","r",stdin);
    //freopen("gpsduel.out","w",stdout);
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i]>>b[i];
        cal.push_back(a[i]);
    }
    sort(cal.begin(),cal.end());
    for(int i=0;i<cal.size();i++)
    {
        if(mp[cal[i]]==0)mp[cal[i]]=++nm;
    }
    bt(0,1,n/2,0);
    bt(0,(n/2)+1,n,0);
    for(int i=0;i<=n;i++)sort(to[i].begin(),to[i].end());
    for(int i=0;i<on.size();i++)
    {
        long long x=on[i].first,y=on[i].second;
        for(int j=x;j<=n;j++)
        {
            int num=lower_bound(to[j].begin(),to[j].end(),k-y)-to[j].begin();
            ans+=(to[j].size())-num;
        }
    }
    cout<<ans;
}

Compilation message

san.cpp: In function 'int main()':
san.cpp:38:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<cal.size();i++)
                 ~^~~~~~~~~~~
san.cpp:45:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<on.size();i++)
                 ~^~~~~~~~~~

Subtask #1
0 / 24.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1396 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct

Subtask #4
0 / 24.0

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

Subtask #5
0 / 24.0

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