oj.uz

답안 #60302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
60302 2018-07-24T00:57:41 Z Benq Skyscraper (JOI16_skyscraper) C++11
20 / 100
 2000 ms 18184 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,L;
vi A;
map<array<int,3>,int> m, M;

void MUL(int& a, int b) { a = (ll)a*b % MOD; }
void AD(int& a, int b) { a = (a+b)%MOD; }

void triEnd(int x, array<int,3> a, int b) {
    if (!a[0]) return;
    MUL(b,a[0]); a[0] --; a[2] += x;
    F0R(i,2) F0R(j,2) AD(m[{a[0]+i,a[1]+j,a[2]-i*x-2*j*x}],b);
}

void triMid(int x, array<int,3> a, int b) {
    if (!a[1]) return;
    MUL(b,a[1]), a[1] --; a[2] += 2*x;
    F0R(i,2) F0R(j,2) AD(m[{a[0],a[1]+i+j,a[2]-2*i*x-2*j*x}],b);
}

void ad(int x) {
    swap(m,M); m.clear();
    for (auto a: M) {
        triEnd(x,a.f,a.s);
        triMid(x,a.f,a.s);
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> L; A.resize(N);
    F0R(i,N) cin >> A[i];
    sort(all(A));
    F0R(i,2) F0R(j,2) AD(m[{i+j,0,-(i+j)*A[0]}],1);
    FOR(i,1,sz(A)) ad(A[i]);
    
    int ans = 0;
    for (auto x: m) if (x.f[0] == 0 && x.f[1] == 0 && x.f[2] <= L) AD(ans,x.s);
    // for (auto x: m) if (x.f[0] == 0 && x.f[1] == 0) cout << x.f[2] << " " << x.s << "\n";
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 608 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 11 ms 1796 KB Output is correct
6 Correct 13 ms 1840 KB Output is correct
7 Correct 10 ms 1840 KB Output is correct
8 Correct 4 ms 1840 KB Output is correct
9 Correct 15 ms 1852 KB Output is correct
10 Correct 7 ms 1852 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1852 KB Output is correct
2 Correct 63 ms 3188 KB Output is correct
3 Correct 12 ms 3188 KB Output is correct
4 Correct 74 ms 3188 KB Output is correct
5 Correct 76 ms 3844 KB Output is correct
6 Correct 36 ms 3844 KB Output is correct
7 Correct 23 ms 3844 KB Output is correct
8 Correct 18 ms 3844 KB Output is correct
9 Correct 14 ms 3844 KB Output is correct
10 Correct 47 ms 3844 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 608 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 11 ms 1796 KB Output is correct
6 Correct 13 ms 1840 KB Output is correct
7 Correct 10 ms 1840 KB Output is correct
8 Correct 4 ms 1840 KB Output is correct
9 Correct 15 ms 1852 KB Output is correct
10 Correct 7 ms 1852 KB Output is correct
11 Correct 7 ms 1852 KB Output is correct
12 Correct 63 ms 3188 KB Output is correct
13 Correct 12 ms 3188 KB Output is correct
14 Correct 74 ms 3188 KB Output is correct
15 Correct 76 ms 3844 KB Output is correct
16 Correct 36 ms 3844 KB Output is correct
17 Correct 23 ms 3844 KB Output is correct
18 Correct 18 ms 3844 KB Output is correct
19 Correct 14 ms 3844 KB Output is correct
20 Correct 47 ms 3844 KB Output is correct
21 Correct 925 ms 10136 KB Output is correct
22 Execution timed out 2056 ms 18184 KB Time limit exceeded
23 Halted 0 ms 0 KB -