oj.uz

Submission #343275

# Submission time Handle Problem Language Result Execution time Memory
343275 2021-01-03T15:37:34 Z mp007mp Skyscraper (JOI16_skyscraper) C++14
5 / 100
 2000 ms 364 KB 
#include<bits/stdc++.h>
#define S second
#define F first
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pii;
const int maxn = 1e5+20;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,L;
	cin>>n>>L;
	pii A[n];
	for(int i=0;i<n;i++){
		cin>>A[i].S;
		A[i].F=i;
	}
	sort(A,A+n);
	int cnt=0;
	do{
		int tmp=0;
		for(int i=1;i<n;i++){
			tmp += abs(A[i].S-A[i-1].S);
		}
		if(tmp<=L){
			cnt++;
		}
	}while(next_permutation(A,A+n));
	cout<<cnt;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2077 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Execution timed out 2077 ms 364 KB Time limit exceeded
12 Halted 0 ms 0 KB -