oj.uz

Submission #963268

# Submission time Handle Problem Language Result Execution time Memory
963268 2024-04-14T19:54:07 Z noobcodur Skyscraper (JOI16_skyscraper) C++14
15 / 100
 188 ms 179212 KB 
#include<bits/stdc++.h>
using namespace std;

using ld = long double;

#define int long long
#define pii pair<int,int>
#define forn(i,j) for(int i = 0; i < j; ++i)
#define forrange(i,j,k) for(int i = j; i < k; ++i)
#define vi vector<int>
#define vpii vector<pii>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()

const int MOD = 1e9+7; const int INF = 1e17+1; const int maxN = 2e5+1;

void setIO(string name){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	if(!name.empty()){
		freopen((name + ".in").c_str(),"r",stdin);
		freopen((name + ".out").c_str(),"w",stdout);
	}
}

int a[14],dp[(1 << 14)][14][101];

signed main(){
	setIO("");
	int n,L;
	cin >> n >> L;

	forn(i,n){
		cin >> a[i];
	}

	int res = 0;

	forrange(mask,1,1 << n){
		forn(i,n){
			if(!(mask & (1 << i))) continue;

			if(__builtin_popcount(mask) == 1){
				dp[mask][i][0] = 1;

				continue;
			}

			forn(j,n){
				if(!(mask & (1 << j)) || j == i) continue;

				int dist = abs(a[i]-a[j]);
				forn(l,L-dist+1){
					int mask2 = mask - (1 << i);

					dp[mask][i][l+dist] += dp[mask2][j][l];
					dp[mask][i][l+dist] %= MOD;
				}
			}
		}
	}

	forn(i,n){
		forn(l,L+1){
			res += dp[(1 << n)-1][i][l];
			res %= MOD;
		}
	}

	cout << res << endl;
}

Compilation message

skyscraper.cpp: In function 'void setIO(std::string)':
skyscraper.cpp:24:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   freopen((name + ".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen((name + ".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Incorrect 4 ms 3164 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 44112 KB Output is correct
2 Correct 180 ms 178936 KB Output is correct
3 Correct 146 ms 177748 KB Output is correct
4 Correct 177 ms 178948 KB Output is correct
5 Correct 169 ms 179024 KB Output is correct
6 Correct 188 ms 179212 KB Output is correct
7 Correct 120 ms 177224 KB Output is correct
8 Correct 148 ms 177584 KB Output is correct
9 Correct 178 ms 178484 KB Output is correct
10 Correct 173 ms 178772 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Incorrect 4 ms 3164 KB Output isn't correct
6 Halted 0 ms 0 KB -