結果
問題 | No.752 mod数列 |
ユーザー | tsutaj |
提出日時 | 2019-03-29 22:19:45 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 894 ms / 2,000 ms |
コード長 | 2,363 bytes |
コンパイル時間 | 972 ms |
コンパイル使用メモリ | 101,412 KB |
実行使用メモリ | 81,880 KB |
最終ジャッジ日時 | 2024-11-07 01:27:06 |
合計ジャッジ時間 | 11,726 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 122 ms
81,712 KB |
testcase_01 | AC | 124 ms
81,792 KB |
testcase_02 | AC | 123 ms
81,664 KB |
testcase_03 | AC | 123 ms
81,664 KB |
testcase_04 | AC | 123 ms
81,664 KB |
testcase_05 | AC | 123 ms
81,792 KB |
testcase_06 | AC | 123 ms
81,748 KB |
testcase_07 | AC | 123 ms
81,664 KB |
testcase_08 | AC | 123 ms
81,740 KB |
testcase_09 | AC | 124 ms
81,664 KB |
testcase_10 | AC | 126 ms
81,696 KB |
testcase_11 | AC | 127 ms
81,716 KB |
testcase_12 | AC | 125 ms
81,788 KB |
testcase_13 | AC | 125 ms
81,784 KB |
testcase_14 | AC | 126 ms
81,664 KB |
testcase_15 | AC | 298 ms
81,664 KB |
testcase_16 | AC | 324 ms
81,752 KB |
testcase_17 | AC | 894 ms
81,664 KB |
testcase_18 | AC | 320 ms
81,664 KB |
testcase_19 | AC | 326 ms
81,792 KB |
testcase_20 | AC | 336 ms
81,664 KB |
testcase_21 | AC | 346 ms
81,664 KB |
testcase_22 | AC | 340 ms
81,692 KB |
testcase_23 | AC | 348 ms
81,680 KB |
testcase_24 | AC | 351 ms
81,664 KB |
testcase_25 | AC | 191 ms
81,664 KB |
testcase_26 | AC | 562 ms
81,792 KB |
testcase_27 | AC | 377 ms
81,664 KB |
testcase_28 | AC | 506 ms
81,688 KB |
testcase_29 | AC | 482 ms
81,788 KB |
testcase_30 | AC | 339 ms
81,880 KB |
testcase_31 | AC | 122 ms
81,792 KB |
testcase_32 | AC | 123 ms
81,692 KB |
testcase_33 | AC | 123 ms
81,732 KB |
ソースコード
// #define _GLIBCXX_DEBUG // for STL debug (optional)#include <iostream>#include <iomanip>#include <cstdio>#include <string>#include <cstring>#include <deque>#include <list>#include <queue>#include <stack>#include <vector>#include <utility>#include <algorithm>#include <map>#include <set>#include <complex>#include <cmath>#include <limits>#include <cfloat>#include <climits>#include <ctime>#include <cassert>#include <numeric>#include <fstream>#include <functional>#include <bitset>using namespace std;#define debug(...) fprintf(stderr, __VA_ARGS__)#define int long long inttemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}template<typename T> void chmin(T &a, T b) {a = min(a, b);}template<typename T> void chadd(T &a, T b) {a = a + b;}typedef pair<int, int> pii;typedef long long ll;int dx[] = {0, 0, 1, -1};int dy[] = {1, -1, 0, 0};const ll INF = 1001001001001001LL;const ll MOD = 1000000007LL;const int K = 10000000;int sum[K+10];signed main() {int P, Q; cin >> P >> Q;for(int i=1; i<=K; i++) {int mod = P % i;sum[i] = sum[i-1] + mod;}while(Q--) {if(Q % 10000 == 0) {fprintf(stderr, "Q = %lld\n", Q);}int l, r; cin >> l >> r;int ans = 0;if(r <= K) {ans = sum[r] - sum[l-1];cout << ans << endl;continue;}else if(l <= K and K <= r) {ans = sum[K] - sum[l-1];l = K+1;}int vl = P / l, vr = P / r, cur = l;int cnt = 0;for(int div=vl; div>=vr; div--) {cnt++;if(div == 0) {int ll = max(l, P + 1);int rr = r;int add = 2 * P * (rr - ll + 1) / 2;ans += add;}else {int ll = max(P / (div + 1) + 1, l);int rr = min(P / div, r);int lll = P % ll, rrr = P % rr;int add = (lll + rrr) * (rr - ll + 1) / 2;ans += add;if(P / cur != P / (cur + 1)) {cur++;div = P / cur + 1;}}}// fprintf(stderr, "div cnt = %lld\n", cnt);cout << ans << endl;}return 0;}