oj.uz

답안 #1054846

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

using namespace std;

int main()
{
    vector <int> V;
    int n, k;
    cin >> n >> k;
    for(int i = 0; i<n ;i++)
    {
        int x;
        cin >> x;
        V.push_back(x);
    }
    int ats = 0;
    int c = 0;
    sort(V.begin(), V.end());
    do
    {
        c++;
        long long skirt = 0;
        for(int i = 1; i<n; i++)
        {
            skirt += abs(V[i] - V[i-1]);
        }
        if(skirt <= k) ats++;
    } while(next_permutation(V.begin(), V.end()));
    cout << ats;
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 2057 ms 348 KB Time limit exceeded
12 Halted 0 ms 0 KB -