oj.uz

Submission #58911

# Submission time Handle Problem Language Result Execution time Memory
58911 2018-07-19T19:25:34 Z Benq Modsum (NOI12_modsum) C++14
25 / 25
 3 ms 1336 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    vi num(5); num[0] = 1;
    F0R(i,n) {
        int a,b; cin >> a >> b;
        vi NUM(5);
        FOR(j,a,b+1) F0R(k,5) NUM[(j+k)%5] += num[k];
        num = NUM;
    }
    int ans = 0;
    F0R(i,5) ans += num[i]*((i*i*i*i+2*i*i)%5+1);
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 672 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 764 KB Output is correct
4 Correct 3 ms 784 KB Output is correct
5 Correct 3 ms 904 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 904 KB Output is correct
2 Correct 2 ms 956 KB Output is correct
3 Correct 3 ms 956 KB Output is correct
4 Correct 2 ms 960 KB Output is correct
5 Correct 2 ms 964 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 968 KB Output is correct
2 Correct 2 ms 1016 KB Output is correct
3 Correct 2 ms 1020 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 3 ms 1136 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1268 KB Output is correct
2 Correct 3 ms 1304 KB Output is correct
3 Correct 3 ms 1304 KB Output is correct
4 Correct 3 ms 1328 KB Output is correct
5 Correct 3 ms 1336 KB Output is correct