# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242621 | SamAnd | Modsum (NOI12_modsum) | C++17 | 394 ms | 1272 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 m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1003, M = 102;
int n;
int l[N], r[N];
int dp[N * M];
int ndp[N * M];
void solv()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &l[i], &r[i]);
dp[0] = 1;
for (int i = 1; i <= n; ++i)
{
memset(ndp, 0, sizeof ndp);
for (int j = 0; j < N * M; ++j)
{
if (!dp[j])
continue;
ndp[j + l[i]] += dp[j];
ndp[j + r[i] + 1] -= dp[j];
}
memcpy(dp, ndp, sizeof ndp);
for (int j = 1; j < N * M; ++j)
dp[j] += dp[j - 1];
}
int ans = 0;
for (int j = 0; j < N * M; ++j)
{
int u = (j * 1LL * j) % 5;
u = (u * (u + 2)) % 5;
++u;
ans += dp[j] * u;
}
printf("%d\n", ans);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |