oj.uz

Submission #559531

# Submission time Handle Problem Language Result Execution time Memory
559531 2022-05-10T06:13:08 Z Pherokung Skyscraper (JOI16_skyscraper) C++14
100 / 100
 139 ms 81892 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 105
#define L 1005
#define ll long long
const ll mod = 1e9+7;
int n,l,a[N];
ll dp[N][N][L][3],ans=0;
int main(){
	scanf("%d%d",&n,&l);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	
	if(n == 1){ // special case
		printf("1");
		return 0;
	}
	
	
	dp[1][1][0][0] = 1;
	dp[1][1][0][1] = 2;
	for(int idx=1;idx<n;idx++){
		for(int comp=1;comp<=idx;comp++){ 
			for(int sum=0;sum<=l;sum++){ 
				for(int ex=0;ex<=2;ex++){ // ex is number of endpoint(begin/end) which was filled
					int n_sum = sum + (2 * comp - ex) * (a[idx+1] - a[idx]); // add a[idx+1] to every available spaces
					ll val = dp[idx][comp][sum][ex];
					if(n_sum > l) continue;
					
					if(ex < 2){
						// add idx+1 to endpoint and merge to some components
						dp[idx+1][comp][n_sum][ex+1] += (2 - ex) * val;
						dp[idx+1][comp][n_sum][ex+1] %= mod;
						
						// add idx+1 to endpoint and create new component
						dp[idx+1][comp+1][n_sum][ex+1] += (2 - ex) * val;
						dp[idx+1][comp+1][n_sum][ex+1] %= mod;
					}
					
					// create new component
					dp[idx+1][comp+1][n_sum][ex] += (comp + 1 - ex) * val;
					dp[idx+1][comp+1][n_sum][ex] %= mod;
					
					// add to begin or end of component
					dp[idx+1][comp][n_sum][ex] += (2 * comp - ex) * val;
					dp[idx+1][comp][n_sum][ex] %= mod;
					
					// add and merge between two components
					dp[idx+1][comp-1][n_sum][ex] += (comp - 1) * val;
					dp[idx+1][comp-1][n_sum][ex] %= mod;
				}
			}
		}
	}
	
	for(int i=0;i<=l;i++) ans = (ans + dp[n][1][i][2]) % mod;
	printf("%lld",ans);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d%d",&n,&l);
      |  ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:11:29: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
      |                        ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 1 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 3 ms 3540 KB Output is correct
22 Correct 110 ms 69052 KB Output is correct
23 Correct 139 ms 80912 KB Output is correct
24 Correct 113 ms 79040 KB Output is correct
25 Correct 129 ms 81640 KB Output is correct
26 Correct 122 ms 76520 KB Output is correct
27 Correct 51 ms 43192 KB Output is correct
28 Correct 61 ms 49868 KB Output is correct
29 Correct 111 ms 76192 KB Output is correct
30 Correct 130 ms 81892 KB Output is correct