# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566488 | Uzouf | Bootfall (IZhO17_bootfall) | C++14 | 723 ms | 5784 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include "xylophone.h"
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=672894013467956;//1e9+7;
const int N=505;//2e5+5;
const int M=250005;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
int n,sum;
int v[N],dp[M],kk[M];
vector<int> ans;
void remove(int nm) {
for (int j=nm;j<=M;j++) {
dp[j]-=dp[j-nm];
if (dp[j]>=mod) dp[j]%=mod;
}
}
void add(int nm) {
for (int j=M;j>=nm;j--) {
dp[j]+=dp[j-nm];
if (dp[j]>=mod) dp[j]%=mod;
}
# | 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... |