Submission #1511900


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;
const bool debug = 0;
//---------------------------------//

int n, m;
map<int, ll> mm;
int a[112345];
int db[20][112345];

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

int main() {
	cin >> n >> m;
	REP(i, n) scanf("%d", a + i);
	
	REP(i, n) db[0][i] = a[i];
	REP(i, 16) REP(j, n) {
		if (j + (1<<(i + 1)) > n) break;
		db[i + 1][j] = gcd(db[i][j], db[i][j + (1<<i)]);
	}
	
	REP(l, n) {
		int g = a[l];
		
		int r = l; // [l,r]
		while (r < n) {
			int p = r;
			for (int i = 16; i >= 0; i--) {
				if (db[i][p] != 0) {
					if (gcd(g, db[i][p]) == g) p += 1<<i;
				}
			}
			
			mm[g] += p - r;
			r = p;
			if (r < n) g = gcd(g, a[r]);
		}
	}
	
	REP(i, m) {
		int x;
		scanf("%d", &x);
		printf("%lld\n", mm[x]);
	}
	return 0;
}

Submission Info

Submission Time
Task D - GCD区間
User tkmst201
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1401 Byte
Status AC
Exec Time 329 ms
Memory 15104 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, n) scanf("%d", a + i);
                              ^
./Main.cpp:60:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 30
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 3 ms 2432 KB
subtask1_02.txt AC 3 ms 2432 KB
subtask1_03.txt AC 3 ms 2432 KB
subtask1_04.txt AC 214 ms 15104 KB
subtask1_05.txt AC 216 ms 15104 KB
subtask1_06.txt AC 329 ms 8704 KB
subtask1_07.txt AC 43 ms 8704 KB
subtask1_08.txt AC 41 ms 8704 KB
subtask1_09.txt AC 178 ms 8704 KB
subtask1_10.txt AC 178 ms 8704 KB
subtask1_11.txt AC 189 ms 15104 KB
subtask1_12.txt AC 110 ms 8704 KB
subtask1_13.txt AC 177 ms 8704 KB
subtask1_14.txt AC 72 ms 8704 KB
subtask1_15.txt AC 290 ms 8704 KB
subtask1_16.txt AC 220 ms 8704 KB
subtask1_17.txt AC 239 ms 8704 KB
subtask1_18.txt AC 113 ms 8704 KB
subtask1_19.txt AC 120 ms 8704 KB
subtask1_20.txt AC 116 ms 8704 KB
subtask1_21.txt AC 52 ms 8704 KB
subtask1_22.txt AC 102 ms 8704 KB
subtask1_23.txt AC 139 ms 8704 KB
subtask1_24.txt AC 80 ms 8704 KB
subtask1_25.txt AC 122 ms 8704 KB
subtask1_26.txt AC 44 ms 6656 KB
subtask1_27.txt AC 91 ms 15104 KB