oj.uz

답안 #362377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362377 2021-02-02T20:03:38 Z shahriarkhan Ice Hockey World Championship (CEOI15_bobek) C++14
50 / 100
 406 ms 20936 KB 
#include<bits/stdc++.h>
using namespace std ;

const int mx = 45 ;

int n , a[mx] , fs , ss ;

long long m , ans = 0 ;

vector<long long> vf , vs ;

int main()
{
    scanf("%d%lld",&n,&m) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        scanf("%lld",&a[i]) ;
    }
    fs = n/2 , ss = n - fs ;
    for(int i = 0 ; i < (1<<fs) ; ++i)
    {
        long long sum = 0 ;
        for(int j = 0 ; j < fs ; ++j)
        {
            if(i&(1<<j)) sum += a[j+1] ;
        }
        vf.push_back(sum) ;
    }
    for(int i = 0 ; i < (1<<ss) ; ++i)
    {
        long long sum = 0 ;
        for(int j = 0 ; j < ss ; ++j)
        {
            if(i&(1<<j)) sum += a[j+fs+1] ;
        }
        vs.push_back(sum) ;
    }
    sort(vf.begin(),vf.end()) ;
    sort(vs.begin(),vs.end()) ;
    for(long long i : vf)
    {
        ans += (lower_bound(vs.begin(),vs.end(),m-i+1) - vs.begin()) ;
    }
    printf("%lld\n",ans) ;
    return 0 ;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:17:19: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
   17 |         scanf("%lld",&a[i]) ;
      |                ~~~^  ~~~~~
      |                   |  |
      |                   |  int*
      |                   long long int*
      |                %d
bobek.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |     scanf("%d%lld",&n,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~~~
bobek.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |         scanf("%lld",&a[i]) ;
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2024 KB Output is correct
2 Correct 93 ms 5468 KB Output is correct
3 Correct 406 ms 20808 KB Output is correct
4 Correct 93 ms 5468 KB Output is correct
5 Correct 15 ms 1636 KB Output is correct
6 Correct 10 ms 1024 KB Output is correct
7 Correct 20 ms 1636 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 2912 KB Output is correct
2 Correct 32 ms 2024 KB Output is correct
3 Correct 159 ms 10580 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 21 ms 1636 KB Output is correct
7 Correct 20 ms 1636 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 3556 KB Output is correct
2 Correct 139 ms 6628 KB Output is correct
3 Correct 137 ms 6624 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 89 ms 6624 KB Output is correct
6 Correct 343 ms 20936 KB Output is correct
7 Correct 133 ms 6624 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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