QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#293468#5. 在线 O(1) 逆元iee100 ✓5959ms394432kbC++11439b2023-12-29 10:43:252023-12-29 10:43:27

Judging History

你现在查看的是测评时间为 2023-12-29 10:43:27 的历史记录

  • [2024-11-05 21:57:23]
  • 管理员手动重测本题所有提交记录
  • 测评结果:100
  • 用时:5487ms
  • 内存:394540kb
  • [2023-12-29 10:43:27]
  • 评测
  • 测评结果:100
  • 用时:5959ms
  • 内存:394432kb
  • [2023-12-29 10:43:25]
  • 提交

answer

#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "inv.h"
using namespace std;
constexpr int N = 1e8;
int v[N], P;
void init(int p) {
	P = p;
	v[1] = 1;
	for (int i = 2; i < N; i++) {
		v[i] = P - 1ll * v[P % i] * (P / i) % P;
	}
}
int inv(int x) {
	int res = 1;
	while (x >= N) {
		res = P - 1ll * res * (P / x) % P;
		x = P % x;
	}
	return 1ll * res * v[x] % P;
}

Details

Test #1:

score: 30
Accepted
time: 724ms
memory: 394208kb

Test #2:

score: 40
Accepted
time: 1213ms
memory: 394432kb

Test #3:

score: 30
Accepted
time: 5959ms
memory: 394248kb