oj.uz

Submission #466897

# Submission time Handle Problem Language Result Execution time Memory
466897 2021-08-21T02:23:50 Z XBoRickie Savrsen (COCI17_savrsen) C++11
120 / 120
 527 ms 81400 KB 
#include <bits/stdc++.h>
using namespace std;
// Typedef
typedef string                     str;
typedef long double                ld;
typedef long long int              int64;
typedef unsigned long long int     uint64;
typedef std::pair<int, int>        PII;
typedef std::pair<int64, int64>    PLL;
typedef std::vector<int>           VI;
typedef std::vector<long long>     VLL;
// Define For-loop
#define FOR(i, j, k, in)           for (int i = (j); i < (k) ; i += (in))
#define FORW(i, j, k, in)          for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in)          for (int i = (j); i >= (k); i -= (in))
// Define Data structure func
#define all(cont)                  cont.begin(), cont.end()
#define rall(cont)                 cont.rbegin(), cont.rend()
#define sz(cont)                   int((cont).size())
#define pb                         push_back
#define mp                         make_pair
#define fi                         first
#define se                         second
// Define number
#define IINF                       0x3f3f3f3f
#define LLINF                      1000111000111000111LL
#define PI                         3.1415926535897932384626433832795
// Other
#define lend                       '\n'
#define hardio(name)               freopen(name".inp","r",stdin), freopen(name".out","w",stdout);
void FastIO() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); cin.exceptions(cin.failbit); srand(time(NULL)); }

const int MOD = 1e9 + 7, MOD2 = 1e9 + 9;
// ======================================================================

int l, r;
vector<int> pr;
void sieve(int N = sqrt(1e9)) {
    int lp[N + 12] = {};
    FORW(i, 2, N, 1) {
        if (lp[i] == 0)
            lp[i] = i, pr.pb(i);
        for(int j = 0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] <= N; ++j)
            lp[i * pr[j]] = pr[j];
    }
}

int sum[10000007] = {};

int Abs(int n) {
  return (n^(n>>31)) - (n>>31);
}

int main(int argc, char* argv[]) {
    FastIO();

    cin >> l >> r;
    sieve(r);

    FORW(i, 1, r, 1) sum[i] = 1;

    for(int p : pr) {
        int64 sm = 1;
        for(int64 x = p; x <= r; x *= p) {
            for(int64 y = x; y <= r; y += x) {
                sum[y] /= sm;
                sum[y] *= (sm + x);
            }
            sm += x;
        }
    }

    int64 ans = 0;
    FORW(i, l, r, 1) ans += Abs(2 * i - sum[i]);
    cout << ans << endl;

    return 0; }

Compilation message

savrsen.cpp: In function 'void sieve(int)':
savrsen.cpp:43:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j = 0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] <= N; ++j)
      |                        ~~^~~~~~~~~~~

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 1228 KB Output is correct
4 Correct 506 ms 81400 KB Output is correct
5 Correct 519 ms 81312 KB Output is correct
6 Correct 527 ms 81312 KB Output is correct
7 Correct 485 ms 74940 KB Output is correct
8 Correct 108 ms 21184 KB Output is correct