Submission #1163150
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define FORR(i,a,b) for (int i=(a);i>=(b);i--) #define pb push_back using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; const int inf = 1e9; const int mod = 1e9+7; int n, m, a, x; map<int, ll> m1, m2, ans; map<int, ll>::iterator itr; int gcd(int i, int j){ while(j > 0){ i %= j; swap(i, j); } return i; } main(){ cin.tie(0); ios::sync_with_stdio(false); cin >> n >> m; FOR(i, 0, n){ cin >> a; for(itr = m1.begin(); itr != m1.end(); itr++) m2[gcd(itr->first, a)] += itr->second; m2[a] += 1; for(itr = m2.begin(); itr != m2.end(); itr++) ans[itr->first] += itr->second; m1 = m2; m2 = map<int, ll>({}); } FOR(i, 0, m){ cin >> x; cout << ans[x] << endl; } }
Submission Info
Submission Time | |
---|---|
Task | D - GCD区間 |
User | char134217728 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 871 Byte |
Status | AC |
Exec Time | 295 ms |
Memory | 6784 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 4 ms | 384 KB |
subtask1_02.txt | AC | 4 ms | 384 KB |
subtask1_03.txt | AC | 4 ms | 384 KB |
subtask1_04.txt | AC | 293 ms | 6784 KB |
subtask1_05.txt | AC | 290 ms | 6784 KB |
subtask1_06.txt | AC | 18 ms | 256 KB |
subtask1_07.txt | AC | 15 ms | 256 KB |
subtask1_08.txt | AC | 15 ms | 256 KB |
subtask1_09.txt | AC | 47 ms | 384 KB |
subtask1_10.txt | AC | 47 ms | 384 KB |
subtask1_11.txt | AC | 295 ms | 6656 KB |
subtask1_12.txt | AC | 23 ms | 256 KB |
subtask1_13.txt | AC | 57 ms | 256 KB |
subtask1_14.txt | AC | 25 ms | 256 KB |
subtask1_15.txt | AC | 38 ms | 256 KB |
subtask1_16.txt | AC | 48 ms | 256 KB |
subtask1_17.txt | AC | 53 ms | 256 KB |
subtask1_18.txt | AC | 25 ms | 256 KB |
subtask1_19.txt | AC | 26 ms | 256 KB |
subtask1_20.txt | AC | 26 ms | 256 KB |
subtask1_21.txt | AC | 17 ms | 256 KB |
subtask1_22.txt | AC | 23 ms | 256 KB |
subtask1_23.txt | AC | 29 ms | 256 KB |
subtask1_24.txt | AC | 21 ms | 256 KB |
subtask1_25.txt | AC | 22 ms | 256 KB |
subtask1_26.txt | AC | 199 ms | 6656 KB |
subtask1_27.txt | AC | 221 ms | 6656 KB |