oj.uz

답안 #146805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146805 2019-08-26T08:40:23 Z algorithm16 San (COCI17_san) C++14
0 / 120
 1000 ms 7524 KB 
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
typedef long long int llint;
llint dp[45],n,k,sol;
pair <llint,llint> p[45];
map <llint,vector <llint> > m;
vector <llint> v;
void rek(llint ind,llint x,llint poc) {
	if(ind>=n/2) return;
	m[p[ind].first].push_back(x);
	v.push_back(p[ind].first);
	llint c=n/2;
	for(llint i=ind+1;i<c;i++) {
		if(ind==-1) rek(i,x+p[i].second,p[i].first);
		else if(p[i].first>=p[ind].first) rek(i,x+p[i].second,poc);
	}
}
void rek2(llint ind,llint x,llint poc) {
	//cout << ind << " " << x << " " << poc << endl;
	if(ind>=n) return;
	if(ind>=n/2) {
		//cout << ind << " " << x << " " << poc << endl;
		llint ind1=lower_bound(v.begin(),v.end(),poc+1)-v.begin();
		//if(p[ind1].first==poc) ind1+=1;
		for(llint i=0;i<ind1;i++) {
			sol+=m[v[i]].size()-(lower_bound(m[v[i]].begin(),m[v[i]].end(),k-x)-m[v[i]].begin());
			//cout << v[i] << " " << sol << endl;
		}
	}
	for(llint i=ind+1;i<n;i++) {
		//cout << i << " " << p[i].first << endl;
		if(ind==n/2-1) rek2(i,x+p[i].second,p[i].first);
		else if(p[i].first>=p[ind].first) rek2(i,x+p[i].second,poc);
	}
}
int main()
{
	cin >> n >> k;
	for(llint i=0;i<n;i++) {
		cin >> p[i].first >> p[i].second;
		if(p[i].second>=k) sol+=1;
	}
	rek(-1,0,0);
	sort(v.begin(),v.end());
	for(llint i=0;i<v.size();i++) {
		sort(m[v[i]].begin(),m[v[i]].end());
	}
	v.erase(unique(v.begin(),v.end()),v.end());
	for(llint i=0;i<v.size();i++) {
		//cout << v[i] << endl;
		for(llint j=0;j<m[v[i]].size();j++) {
			//cout << m[v[i]][j] << " ";
			if(m[v[i]][j]>=k) sol+=1;
		}
		//cout << endl;
	}
	rek2(n/2-1,0,0);
	cout << sol;
	return 0;
}

Compilation message

san.cpp: In function 'int main()':
san.cpp:50:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llint i=0;i<v.size();i++) {
                ~^~~~~~~~~
san.cpp:54:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llint i=0;i<v.size();i++) {
                ~^~~~~~~~~
san.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(llint j=0;j<m[v[i]].size();j++) {
                 ~^~~~~~~~~~~~~~~

Subtask #1
0 / 24.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 24.0

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