oj.uz

답안 #528546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528546 2022-02-20T13:46:32 Z aSSSd Skyscraper (JOI16_skyscraper) C++14
5 / 100
 52 ms 68056 KB 
//#pragma GCC optimize("O2,unroll-loops")
//#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r)
{
    return l+rng()%(r-l+1);
}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define forinc(x,a,b) for(int x=a;x<=b;x++)
#define fordec(x,a,b) for(int x=a;x>=b;x--)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<long long,long long>
#define getbit(x,i) ((x>>(i))&1)
#define batbit(x,i) (x|(1ll<<(i)))
#define tatbit(x,i) (x&~(1<<(i)))
#define gg exit(0);
#define all(a) a.begin() , a.end()
const int N = 14;
const int mod = 1e9 + 7;
int n, L;
int a[N];
int f[(1<<14) + 10][15][110];

main()
{
    fasty;
    cin >> n >> L;
    forinc(i,1,n) cin >> a[i];
    f[0][0][0] = 1;
    if(n <= 10)
    {
        int cnt=0;
        sort(a+1 , a+n+1);
        do
        {
            int sum=0;
            forinc(i,1,n-1) sum += abs(a[i] - a[i+1]);
            if(sum <=  L) cnt++;
        }while(next_permutation(a+1 , a+n + 1));
        cout << cnt;
        return 0;
    }
    for(int tt =0 ; tt <= (1<<n) - 1 ; tt++) forinc(i , 0 , n) forinc(l , 0 , L) if(f[tt][i][l])
    {
        forinc(j , 1 , n) if(!getbit(tt , j-1))
        {
            int kc=0;
            if(tt != 0) kc = l + abs(a[j] - a[i]);
            int tt2 = batbit(tt , j-1);
            f[tt2][j][kc] = (f[tt2][j][kc] + f[tt][i][l])%mod;
        }

    }
    int res=0;
    forinc(i,1,n) forinc(l , 0 , L) res = (res + f[(1<<n) - 1][i][l])%mod;
    cout << res;


}

Compilation message

skyscraper.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main()
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 26564 KB Output is correct
2 Incorrect 52 ms 68056 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 32 ms 26564 KB Output is correct
12 Incorrect 52 ms 68056 KB Output isn't correct
13 Halted 0 ms 0 KB -