2021-01-05 USACO Arithmetic Progressions

An arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0, 1, 2, 3, ... . For this problem, a is a non-negative integer and b is a positive integer.

Write a program that finds all arithmetic progressions of length n in the set S of bisquares. The set of bisquares is defined as the set of all integers of the form p2 + q2 (where p and q are non-negative integers).

TIME LIMIT: 5 secs

PROGRAM NAME: ariprog

INPUT FORMAT

Line 1:	N (3 <= N <= 25), the length of progressions for which to search
Line 2:	M (1 <= M <= 250), an upper bound to limit the search to the bisquares with 0 <= p,q <= M.

SAMPLE INPUT (file ariprog.in)

5
7

OUTPUT FORMAT

If no sequence is found, a single line reading `NONE'. Otherwise, output one or more lines, each with two integers: the first element in a found sequence and the difference between consecutive elements in the same sequence. The lines should be ordered with smallest-difference sequences first and smallest starting number within those sequences first.

There will be no more than 10,000 sequences.

SAMPLE OUTPUT (file ariprog.out)

1 4
37 4
2 8
29 8
1 12
5 12
13 12
17 12
5 20
2 24

比我想象中还要暴力——剪枝的迷幻复杂度。

/*
ID: traysen1
TASK: ariprog
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;

struct Sequence {
	int first, diff;
	
	bool operator < (const Sequence& sq) const {
		return diff < sq.diff || diff == sq.diff && first < sq.first;
	}
}seq[10010];
int is_bisquare[2 * 250 * 250 + 10];
int N, M, bis_num, seq_num;

void init_bisquares() {
	for (int p = 0; p <= M; p++)
		for (int q = p; q <= M; q++)
			is_bisquare[p * p + q * q] = 1;
}

int main() {
	ifstream fin("ariprog.in");
	fin >> N >> M;
	fin.close();
	
	init_bisquares();
	
	for (int a = 0; a <= 2 * M * M; a++)
		if (is_bisquare[a]) {
			for (int b = 1; b <= 2 * M * M; b++) {
				if (a + b * (N - 1)> 2 * M * M) break;
				
				int num = 1, nxt = a + b;
				while (is_bisquare[nxt] && num < N) {
					num++;
					nxt += b;
				}
				
				if (num == N) {
					seq[seq_num].first = a;
					seq[seq_num].diff = b;
					seq_num++;
				}
			}
		}
	
	sort(seq, seq + seq_num);
	
	ofstream fout("ariprog.out");
	if (seq_num == 0) {
		fout << "NONE" << endl;
	} else {
		for (int i = 0; i < seq_num; i++)
			fout << seq[i].first << " " << seq[i].diff << endl;
	}
	
	return 0;
}