# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496634 | JovanB | Magneti (COCI21_magneti) | C++17 | 182 ms | 54520 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
const int N = 50;
const int LEN = 10000;
int add(int a, int b){ a += b; if(a >= MOD) a -= MOD; return a;}
int mul(int a, int b){ return (1LL*a*b)%MOD; }
int a[55];
int dp[55][55][LEN+5];
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n, len;
cin >> n >> len;
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) a[i]--;
sort(a+1, a+1+n);
reverse(a+1, a+1+n);
dp[0][2][0] = 1;
for(int i=1; i<=n; i++){
for(int k=1; k<=i+2; k++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |