oj.uz

답안 #57992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57992 2018-07-16T15:23:21 Z Benq Savrsen (COCI17_savrsen) C++14
120 / 120
 1861 ms 40048 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 = 10000001;

int A,B, divi[MX];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    FOR(i,1,MX) for (int j = 2*i; j < MX; j += i) divi[j] += i;
    cin >> A >> B;
    ll ans = 0;
    FOR(i,A,B+1) ans += abs(divi[i]-i);
    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
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1850 ms 39416 KB Output is correct
2 Correct 1675 ms 39528 KB Output is correct
3 Correct 1854 ms 39640 KB Output is correct
4 Correct 1861 ms 39868 KB Output is correct
5 Correct 1782 ms 39868 KB Output is correct
6 Correct 1754 ms 39868 KB Output is correct
7 Correct 1810 ms 39900 KB Output is correct
8 Correct 1808 ms 40048 KB Output is correct