oj.uz

답안 #482635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482635 2021-10-26T00:03:05 Z robell Ice Hockey World Championship (CEOI15_bobek) C++14
40 / 100
 1000 ms 143124 KB 
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define countbits __builtin_popcount
#define beg0 __builtin_clz
#define terminal0 __builtin_ctz
#define f first
#define s second
int mod=1e9+7;
void setIO(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
}
void setIO(string f){
	freopen((f+".in").c_str(),"r",stdin);
	freopen((f+".out").c_str(),"w",stdout);
	setIO();
}
ll N, M, c[40];
ll s1[(1<<20)], s2[(1<<20)];
vector<int> v1, v2;
map<ll,int> m;
set<ll> store;
void setup1(){
	for (int i=1;i<(1<<v1.size());i++){
		for (int j=0;j<v1.size();j++){
			if (i&(1<<j)){
				int n = i&(~(1<<j));
				s1[i]=s1[n]+v1[j];
				break;
			}
		}
	}
}
void setup2(){
	for (int i=1;i<(1<<v2.size());i++){
		for (int j=0;j<v2.size();j++){
			if (i&(1<<j)){
				int n = i&(~(1<<j));
				s2[i]=s2[n]+v2[j];
				break;
			}
		}
	}
}
int main(){
	setIO(); cin >> N >> M; s1[0]=0;s2[0]=0;
	for (int i=0;i<N;i++){cin >> c[i];}
	for (int i=0;i<N/2;i++) v1.pb(c[i]);
	for (int i=N/2;i<N;i++) v2.pb(c[i]);
	setup1();setup2();
	for (int i=0;i<(1<<v1.size());i++){
		m[s1[i]]++;
		store.insert(s1[i]);
	}
	vector<ll> vals;for (ll j:store) vals.pb(j);
	vector<int> counts={0}; for (ll j:store) counts.pb(counts.back()+m[j]);
	ll res = 0;
	for (int i=0;i<(1<<v2.size());i++){
		ll diff = M-s2[i];
		int l=0,r=vals.size()-1;
		while (l!=r){
			int mid = (l+r+1)/2;
			if (vals[mid]<=diff) l=mid;
			else r=mid-1;
		}
		if (vals[r]<=diff){
			res+=counts[r+1];
		}else{
			res+=counts[r];
		}
	}
	cout << res << "\n";
}

Compilation message

bobek.cpp: In function 'void setup1()':
bobek.cpp:32:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for (int j=0;j<v1.size();j++){
      |                ~^~~~~~~~~~
bobek.cpp: In function 'void setup2()':
bobek.cpp:43:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for (int j=0;j<v2.size();j++){
      |                ~^~~~~~~~~~
bobek.cpp: In function 'void setIO(std::string)':
bobek.cpp:21:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  freopen((f+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:22:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  freopen((f+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 3416 KB Output is correct
2 Correct 242 ms 26064 KB Output is correct
3 Execution timed out 1094 ms 74424 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 4928 KB Output is correct
2 Correct 48 ms 8264 KB Output is correct
3 Correct 116 ms 9784 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 22 ms 4760 KB Output is correct
7 Correct 43 ms 9400 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 16824 KB Output is correct
2 Correct 231 ms 22112 KB Output is correct
3 Correct 213 ms 22144 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 19 ms 6488 KB Output is correct
6 Correct 200 ms 19112 KB Output is correct
7 Correct 308 ms 39352 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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