oj.uz

답안 #586238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586238 2022-06-30T05:26:05 Z nguyen31hoang08minh2003 Savrsen (COCI17_savrsen) C++14
120 / 120
 1102 ms 78596 KB 
/*
   /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\     /\
  /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \   /  \
 /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \ /    \
*------*------*------*------*------*------*------*------*------*------*------*------*------*------*------*------*------*
 \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    / \    /
  \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /   \  /
   \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/     \/
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

const int maxB = 1e7 + 7;

int a, b;
ll res, sum[maxB];

int ceilint(int x, int y) {
    return x / y + !!(x % y);
}

int main() {
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> a >> b;
    fort(i, 1, b >> 1)
        for (int j = max(i << 1, ceilint(a, i) * i); j <= b; j += i)
            sum[j] += i;
    fort(i, a, b)
        res += abs(sum[i] - i);
    cout << res << '\n';
    return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 26 ms 212 KB Output is correct
5 Correct 981 ms 70768 KB Output is correct
6 Correct 1102 ms 78596 KB Output is correct
7 Correct 1010 ms 71320 KB Output is correct
8 Correct 275 ms 20132 KB Output is correct