oj.uz

답안 #1054785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054785 2024-08-12T12:08:16 Z Harold Skyscraper (JOI16_skyscraper) C++14
5 / 100
 2000 ms 440 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long

ll pick(vector<int>& a, int l, set<int> s, int prev) {
    if(l < 0) {
        return 0;
    }
    if(s.size() == a.size()) {
        return 1;
    }
    ll res = 0;
    for(auto i: a) {
        if(s.count(i)) {
            continue;
        }
        if(s.empty()) {
            prev = i;
        }
        s.insert(i);
        res = (res + pick(a, l-abs(i-prev), s, i)) % 1000000007;
        s.erase(i);
    }
    return res;
}

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    cout << pick(a, k, {}, 0) << endl;

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 16 ms 440 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 16 ms 440 KB Output is correct
11 Execution timed out 2040 ms 344 KB Time limit exceeded
12 Halted 0 ms 0 KB -