oj.uz

답안 #886662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886662 2023-12-12T15:18:55 Z Alora Magneti (COCI21_magneti) C++17
10 / 110
 3 ms 4452 KB 
#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 10003
const int M = 1e9 + 7;
using namespace std;
int n, l, r[55];
ll res, C[55][maxn], gt[55];
void add(ll &x, ll y){x = (x + y) % M;}

void pre(){
    fi(i, 1, l) C[0][i] = 1;
    C[1][1] = 1;
    fi(i, 2, l){
        fi(j, 1, min(50, i)){
            add(C[j][i], C[j][i - 1] + C[j - 1][i - 1]);
        }
    }
    gt[0] = 1;
    fi(i, 1, n) gt[i] = 1ll*gt[i - 1]*i % M;
}

void sub1(){
    if(n == 1) {cout << l; exit(0);}
    int len = l - (1 + r[1]*(n - 1));
    if(len < 0){cout << 0; exit(0);}
    len += n;
    cout << C[n][len]*gt[n] % M;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	if(fopen(Alora".inp", "r")){
    freopen(Alora".inp", "r", stdin);
    freopen(Alora".out", "w", stdout);}
    cin >> n >> l;
    fi(i, 1, n) cin >> r[i];
    pre();
    sort(r + 1, r + n + 1);
    if(r[1] == r[n]) sub1();

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen(Alora".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen(Alora".out", "w", stdout);}
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4440 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 3 ms 4452 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4440 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 3 ms 4452 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Incorrect 3 ms 4444 KB Output isn't correct
12 Halted 0 ms 0 KB -