Contest Duration: - (local time) (90 minutes) Back to Home

Submission #171740

Source Code Expand

Copy
```import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";

static void solve()
{
int n = ni(), m = ni();
int[] a = na(n);
int[][] qs = new int[m][];
for(int i = 0;i < m;i++){
qs[i] = new int[]{ni(), i};
}
Arrays.sort(qs, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[0] - b[0];
}
});
int[] qt = new int[m];
for(int i = 0;i < m;i++){
qt[i] = qs[i][0] * 2;
}

int[][] pre = new int[35][2];
int[][] cur = new int[35][2];
int prep = 0, curp = 0;
long[] ans = new long[m];
for(int i = 0;i < n;i++){
curp = 0;
cur[curp][0] = a[i];
cur[curp][1] = 1;
curp++;
for(int j = 0;j < prep;j++){
int g = gcd(cur[curp-1][0], pre[j][0]);
if(g == cur[curp-1][0]){
cur[curp-1][1] += pre[j][1];
}else{
cur[curp][0] = g;
cur[curp][1] = pre[j][1];
curp++;
}
}
for(int j = 0;j < curp;j++){
int ind = Arrays.binarySearch(qt, cur[j][0]*2-1);
ind = -ind-1;
if(ind < m && qt[ind] == cur[j][0]*2){
ans[qs[ind][1]] += cur[j][1];
}
}
prep = curp;
int[][] dum = pre; pre = cur; cur = dum;
}
for(int i = 0;i < m;i++){
if(i-1 >= 0 && qt[i] == qt[i-1]){
ans[qs[i][1]] = ans[qs[i-1][1]];
}
}
for(int i = 0;i < m;i++){
out.println(ans[i]);
}
}

public static int gcd(int a, int b) {
while (b > 0){
int c = a;
a = b;
b = c % b;
}
return a;
}

public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);

solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}

private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}

private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;

private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}

private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//	private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }

private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}

private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}

private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}

private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}

private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}

while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}

private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}

while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}

private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
```

#### Submission Info

Submission Time 2014-05-17 21:27:10+0900 D - GCD区間 uwi Java (OpenJDK 1.7.0) 100 4844 Byte AC 1012 ms 33584 KB

#### 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 360 ms 17732 KB
subtask0_sample_02.txt AC 352 ms 17740 KB
subtask0_sample_03.txt AC 351 ms 17732 KB
subtask1_01.txt AC 387 ms 19020 KB
subtask1_02.txt AC 377 ms 19268 KB
subtask1_03.txt AC 367 ms 19100 KB
subtask1_04.txt AC 1012 ms 32880 KB
subtask1_05.txt AC 889 ms 32916 KB
subtask1_06.txt AC 421 ms 20716 KB
subtask1_07.txt AC 428 ms 20432 KB
subtask1_08.txt AC 446 ms 20540 KB
subtask1_09.txt AC 475 ms 20532 KB
subtask1_10.txt AC 452 ms 20780 KB
subtask1_11.txt AC 923 ms 32220 KB
subtask1_12.txt AC 462 ms 20392 KB
subtask1_13.txt AC 454 ms 20724 KB
subtask1_14.txt AC 457 ms 20892 KB
subtask1_15.txt AC 444 ms 20644 KB
subtask1_16.txt AC 450 ms 20404 KB
subtask1_17.txt AC 466 ms 20436 KB
subtask1_18.txt AC 425 ms 20776 KB
subtask1_19.txt AC 424 ms 20640 KB
subtask1_20.txt AC 444 ms 20428 KB
subtask1_21.txt AC 415 ms 20508 KB
subtask1_22.txt AC 445 ms 20568 KB
subtask1_23.txt AC 432 ms 20432 KB
subtask1_24.txt AC 423 ms 20512 KB
subtask1_25.txt AC 426 ms 20792 KB
subtask1_26.txt AC 539 ms 33584 KB
subtask1_27.txt AC 610 ms 30388 KB