Submission #857701


Source Code Expand

Copy
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<set>
#include<cmath>
#include<queue>
#define MAX 1000050
#define ll long long int
using namespace std;

/*
long long int  getSubset(vector<int> numbers, int sum)
{
    vector<int>dp(sum+1);
    dp[0] = 1;
    int currentSum =0;
    for(int i = 0; i < numbers.size();i++) {
        currentSum+=numbers[i];
        for(int j = min(sum, currentSum); j>=numbers[i]; j--)
            dp[j]+= dp[j - numbers[i]];
    }
    return dp[sum];
}
*/
int n,a;
int x;
vector<int>cards;
int main(){
  cin>>n>>a;
  for(int i=0;i<n;i++){
    cin>>x;
    cards.push_back(x);
  }
  long long int s = (long long int) 1<<n;
  int ans = 0;
  for(int i=0;i<s;i++){
    int cnt = 0;
    long long int sum = 0;
    for(int j=0;j<n;j++){
      if((1<<j) & i){
        cnt++;
        sum+=cards[j];
      }
    }
    if(cnt>0 && 1.0*sum/cnt==(double)a){
      ans++;
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User ramin
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1071 Byte
Status TLE
Exec Time 2105 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
TLE × 1
AC × 12
AC × 12
TLE × 12
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 256 KB
example_02.txt AC 4 ms 256 KB
example_03.txt AC 4 ms 256 KB
example_04.txt TLE 2101 ms 256 KB
subtask1_01.txt AC 9 ms 256 KB
subtask1_02.txt AC 9 ms 256 KB
subtask1_03.txt AC 9 ms 256 KB
subtask1_04.txt AC 9 ms 256 KB
subtask1_05.txt AC 9 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 9 ms 256 KB
subtask1_09.txt AC 6 ms 256 KB
subtask2_01.txt TLE 2105 ms 256 KB
subtask2_02.txt TLE 2105 ms 256 KB
subtask2_03.txt TLE 2101 ms 256 KB
subtask2_04.txt TLE 2105 ms 256 KB
subtask2_05.txt TLE 2105 ms 256 KB
subtask2_06.txt TLE 2105 ms 256 KB
subtask2_07.txt TLE 2101 ms 256 KB
subtask2_08.txt TLE 2105 ms 256 KB
subtask2_09.txt TLE 2105 ms 256 KB
subtask2_10.txt TLE 2105 ms 256 KB
subtask2_11.txt TLE 2101 ms 256 KB