# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906885 | daoquanglinh2007 | Bootfall (IZhO17_bootfall) | C++17 | 529 ms | 5208 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;
#define int long long
const int NM = 500, MOD = 1e15+7;
int N, a[NM+5], sum = 0, dp[NM*NM+5], dp0[NM*NM+5], K = 0;
bool ok[NM*NM+5];
void add(int x){
for (int i = NM*NM; i >= x; i--)
dp[i] = (dp[i]+dp[i-x])%MOD;
}
void remove(int x){
for (int i = x; i <= NM*NM; i++)
dp[i] = (dp[i]+MOD-dp[i-x])%MOD;
}
void solve(int t){
for (int i = 0; i <= NM*NM; i++) dp[i] = dp0[i];
remove(a[t]);
for (int i = 1; i <= NM*NM; i++)
if ((sum-a[t]+i)%2 != 0 || (sum-a[t]+i)/2-i < 0 || !dp[(sum-a[t]+i)/2-i]) ok[i] = 0;
}
signed main(){
ios_base::sync_with_stdio(0);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |