oj.uz

답안 #16708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16708 2015-09-08T08:43:55 Z gs14004 Xtreme gcd sum (kriii2_X) C++14
0 / 4
 4000 ms 262144 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;

int che[1000005];
int moebius[1000005];
int n, a[10005], b[10005], rng[10005];
lint cnt[1000005];

lint mod_inv(int x, int p){
	lint ret = 1, piv = x;
	while(p){
		if(p&1) ret *= piv;
		piv *= piv;
		ret %= mod;
		piv %= mod;
		p >>= 1;
	}
	return ret;
}

int maxp;

void get_moebius(){
	for(int i=2; i<=maxp; i++){
		for(int j=i; j<=maxp; j+=i){
			if(!che[j]) che[j] = i;
		}
	}
	for(int i=1; i<=maxp; i++){
		int cnt = 0, lst = -1;
		int x = i;
		while(x > 1){
			if(lst == che[x]){
				cnt = -1;
				break;
			}
			lst = che[x];
			x /= lst;
			cnt++;
		}
		if(cnt < 0) continue;
		moebius[i] = cnt % 2 ? -1 : 1;
	}
}

vector<int> change[1000005];

int main(){
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d %d",&a[i], &b[i]);
	}
	maxp = *min_element(b, b+n);
	get_moebius();
	lint curr = 1;
	for(int i=0; i<n; i++){
		rng[i] = 1;
		change[1].push_back(i);
	}
	for(int i=1; i<=maxp; i++){
		for(auto &j : change[i]){
			rng[j] = b[j] / i - (a[j] - 1) / i;
			int s = i+1, e = maxp+1;
			while(s != e){
				int m = (s+e)/2;
				if(b[j] / m != b[j] / i){
					e = m;
				}
				else s = m+1;
			}
			change[s].push_back(j);
			s = i+1, e = maxp + 1;
			while(s != e){
				int m = (s+e)/2;
				if((a[j] - 1) / m != (a[j] - 1) / i){
					e = m;
				}
				else s = m+1;
			}
			change[s].push_back(j);
		}
		lint curr = 1;
		for(int i=1; i<=n; i++){
			curr *= rng[i-1];
			curr %= mod;
		}
		cnt[i] = curr;
	}
	lint ret = 0;
	for(int i=1; i<=maxp; i++){
		for(int j=1; i*j<=maxp; j++){
			ret += 1ll * i * moebius[j] * cnt[i * j] % mod;
			ret %= mod;
		}
	}
	ret += mod;
	ret %= mod;
	printf("%lld",ret);
}

Subtask #1
0.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1145 ms 113860 KB Output is correct
2 Correct 53 ms 45492 KB Output is correct
3 Correct 757 ms 77184 KB Output is correct
4 Correct 61 ms 45288 KB Output is correct
5 Correct 333 ms 62932 KB Output is correct
6 Correct 97 ms 50660 KB Output is correct
7 Correct 25 ms 43484 KB Output is correct
8 Correct 22 ms 43708 KB Output is correct
9 Correct 33 ms 43744 KB Output is correct
10 Correct 41 ms 44028 KB Output is correct
11 Execution timed out 4000 ms 262144 KB Program timed out
12 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -