Submission #856201


Source Code Expand

Copy
#include <iostream>
#include <string>
#include <string.h>
#include <stdio.h>
using namespace std;

int A;

long long F(int v[], int l, int r, int n, int s[], int s_len) {

    if (r-l < n)
        return 0;

    if (n == 0) {
        int sum = 0;
        for (int i = 0; i < s_len; ++ i) {
            sum += s[i];
            //cout << s[i] << " ";
        }
        //cout << endl;
        if (sum == s_len*A) return 1;
        else return 0;
    }

    long long res = 0;
    for (int i = l; i < r; ++ i) {
        s[s_len] = v[i];
        res += F(v, i+1, r, n-1, s, s_len+1);
    }
    return res;
}

int main() {

    //freopen("in.txt", "r", stdin);

    int n;
    int v[55];

    cin >> n >> A;
    for (int i = 0; i < n; ++ i)
        cin >> v[i];

    int s[55];
    int s_len = 0;

    long long res = 0;
    for (int i = 1; i <= n; ++ i) {
        res += F(v, 0, n, i, s, s_len);
    }
    cout << res << endl;

    /*cout << F(v, 0, n, 2, s, s_len) << endl;*/

    return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User zfz
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1047 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 6 ms 256 KB
subtask1_02.txt AC 6 ms 256 KB
subtask1_03.txt AC 6 ms 256 KB
subtask1_04.txt AC 6 ms 256 KB
subtask1_05.txt AC 6 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 6 ms 256 KB
subtask1_09.txt AC 5 ms 256 KB
subtask2_01.txt TLE 2101 ms 256 KB
subtask2_02.txt TLE 2101 ms 256 KB
subtask2_03.txt TLE 2101 ms 256 KB
subtask2_04.txt TLE 2101 ms 256 KB
subtask2_05.txt TLE 2101 ms 256 KB
subtask2_06.txt TLE 2101 ms 256 KB
subtask2_07.txt TLE 2101 ms 256 KB
subtask2_08.txt TLE 2104 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