제출 #1168924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168924		hamzabc	Modsum (NOI12_modsum)	C++20	25 / 25	0 ms	328 KiB

modsum

#include <bits/stdc++.h>

using namespace std;
 
 
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define sp << " " <<
#define endl << '\n'


long long int N;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> N;
    vector<long long> rt(5), rt2(5);
    rt[0] = 1;
    for (int i = 0; i < N; i++){
        long long a, b;
        cin >> a >> b;
        for (int o = 0; o < 5; o++) rt2[(o + a % 5) % 5] = rt[o] * ((b - a + 5) / 5);
        for (int o = 0; o < 5; o++) rt2[(o + a % 5 + 1) % 5] += rt[o] * ((b - a + 4) / 5);
        for (int o = 0; o < 5; o++) rt2[(o + a % 5 + 2) % 5] += rt[o] * ((b - a + 3) / 5);
        for (int o = 0; o < 5; o++) rt2[(o + a % 5 + 3) % 5] += rt[o] * ((b - a + 2) / 5);
        for (int o = 0; o < 5; o++) rt2[(o + a % 5 + 4) % 5] += rt[o] * ((b - a + 1) / 5);
        swap(rt, rt2);
    }
    long long a = 0;
    for (int i = 0; i < 5; i++){
        a += ((i * i * i * i + 2 * i * i) % 5 + 1) * rt[i];
    }
    cout << a;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5