oj.uz

답안 #1079236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079236 2024-08-28T12:14:43 Z vnm06 Skyscraper (JOI16_skyscraper) C++14
5 / 100
 2000 ms 380 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

int n, l;
int a[12];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>l;
    for(int i=0; i<n; i++) cin>>a[i];
    sort(a, a+n);
    int br=0;
    do
    {
        int sum=0;
        for(int i=1; i<n; i++)
        {
            sum+=max(a[i]-a[i-1], a[i-1]-a[i]);
        }
        if(sum<=l) br++;
    }while(next_permutation(a, a+n));
    cout<<br<<endl;
    return 0;
}

Subtask #1
5.0 / 5.0

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