結果
| 問題 | No.97 最大の値を求めるくえり |
| ユーザー |
 atn112323
|
| 提出日時 | 2016-03-23 13:42:21 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 591 ms / 5,000 ms |
| コード長 | 12,911 bytes |
| コンパイル時間 | 3,002 ms |
| コンパイル使用メモリ | 93,644 KB |
| 実行使用メモリ | 48,812 KB |
| 最終ジャッジ日時 | 2024-10-01 19:30:22 |
| 合計ジャッジ時間 | 12,142 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 106 ms
40,288 KB |
| testcase_01 | AC | 114 ms
40,864 KB |
| testcase_02 | AC | 496 ms
47,280 KB |
| testcase_03 | AC | 467 ms
48,272 KB |
| testcase_04 | AC | 331 ms
48,812 KB |
| testcase_05 | AC | 365 ms
48,408 KB |
| testcase_06 | AC | 354 ms
48,244 KB |
| testcase_07 | AC | 415 ms
47,284 KB |
| testcase_08 | AC | 407 ms
47,228 KB |
| testcase_09 | AC | 390 ms
47,464 KB |
| testcase_10 | AC | 467 ms
47,260 KB |
| testcase_11 | AC | 519 ms
47,412 KB |
| testcase_12 | AC | 526 ms
47,320 KB |
| testcase_13 | AC | 591 ms
47,056 KB |
| testcase_14 | AC | 409 ms
47,120 KB |
| testcase_15 | AC | 408 ms
47,376 KB |
| testcase_16 | AC | 408 ms
47,404 KB |
| testcase_17 | AC | 396 ms
47,556 KB |
| testcase_18 | AC | 398 ms
47,568 KB |
ソースコード
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
/**
* This class represents a problem setting.
*/
class Problem implements IProblem {
int[] NQ;
int[] q;
@Override
public void set(ProblemReader reader) throws IOException {
NQ = reader.nextIntArray();
q = reader.nextIntArray(NQ[1]);
}
@Override
public String toString() {
// TODO
return null;
}
}
/**
* Solver for the problem.
* It's the most important part of codes in this file.
*/
class Solver implements IProblemSolver<Problem> {
final int MOD = 100003;
long xor128_x = 123456789, xor128_y = 362436069, xor128_z = 521288629, xor128_w = 88675123;
long xor128() {
long t = (xor128_x ^ (xor128_x << 11)) & 0xffffffffl;
xor128_x = xor128_y; xor128_y = xor128_z; xor128_z = xor128_w;
return xor128_w = (xor128_w ^ (xor128_w >> 19) ^ (t ^ (t >> 8))) & 0xffffffffl;
}
int[] generateA(int N) {
int[] A = new int[N];
for(int i = 0; i < N; i++) {
A[i] = (int)(xor128() % MOD);
}
return A;
}
@Override
public String solve(Problem problem) {
int N = problem.NQ[0], Q = problem.NQ[1];
int[] q = problem.q;
return StringUtils.toString(solve(N, Q, q), "\n");
}
private int[] solve(int N, int Q, int[] q) {
int[] A = generateA(N);
boolean[] exist = new boolean[MOD];
for (int i = 0; i < N; i++) {
exist[A[i]] = true;
}
int[] res = new int[Q];
for (int i = 0; i < Q; i++) {
if (q[i] == 0) {
res[i] = 0;
continue;
}
if (N <= 1000) {
for (int j = 0; j < N; j++) {
res[i] = Math.max(res[i], (int)(A[j] * (long)q[i] % MOD));
}
} else {
long r = pow(q[i], MOD - 2, MOD);
for (int j = MOD - 1; j >= 0; j--) {
int a = (int)(j * r % MOD);
if (exist[a]) {
res[i] = j;
break;
}
}
}
}
return res;
}
private long pow(long x, long n, long mod) {
long res = 1;
while (n > 0) {
if ((n & 1) == 1) {
res = (res * x) % mod;
}
x = (x * x) % mod;
n >>= 1;
}
return res;
}
}
/**
* This class is a solver to confirm the main solver.
* This solver often works only for a problem with a small number setting.
*/
class Solver2 implements IProblemSolver<Problem> {
@Override
public String solve(Problem problem) {
// TODO
return null;
}
}
class Factory implements IProblemFactory<Problem> {
@Override
public Problem newProblem() {
// TODO
return null;
}
@Override
public Problem newProblem(ProblemReader reader) throws IOException {
Problem problem = new Problem();
problem.set(reader);
return problem;
}
}
class ResultComparator implements IResultComparator {
@Override
public boolean same(String res1, String res2) {
// TODO
return res1.equals(res2);
}
}
ProblemProcessor<Problem> processor;
Main() {
Init();
}
void Init() {
ProblemProcessorConfig<Problem> config = new ProblemProcessorConfig<>();
config.factory = new Factory();
config.solver = new Solver();
config.solver2 = new Solver2();
config.comparator = new ResultComparator();
processor = new ProblemProcessor<Problem>(config);
}
void process(String mode) throws IOException {
processor.process(mode);
}
public static void main(String args[]) throws IOException {
// "create", "debug", and "solve"
String mode = "solve";
new Main().process(mode);
}
/*
Common library
*/
interface IProblem {
abstract void set(ProblemReader reader) throws IOException;
}
interface IProblemFactory<P extends IProblem> {
abstract P newProblem();
abstract P newProblem(ProblemReader reader) throws IOException;
}
interface IProblemSolver<P extends IProblem> {
abstract String solve(P problem);
}
interface IResultComparator {
abstract boolean same(String res1, String res2);
}
class ProblemReader {
BufferedReader br = null;
ProblemReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
int nextInt() throws IOException {
return StringUtils.toInt(br.readLine());
}
long nextLong() throws IOException {
return StringUtils.toLong(br.readLine());
}
double nextDouble() throws IOException {
return StringUtils.toDouble(br.readLine());
}
String nextString() throws IOException {
return br.readLine();
}
int[] nextIntArray() throws IOException {
return StringUtils.toIntArray(br.readLine());
}
long[] nextLongArray() throws IOException {
return StringUtils.toLongArray(br.readLine());
}
double[] nextDoubleArray() throws IOException {
return StringUtils.toDoubleArray(br.readLine());
}
String[] nextStringArray() throws IOException {
return StringUtils.toStringArray(br.readLine());
}
int[] nextIntArray(int n) throws IOException {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
long[] nextLongArray(int n) throws IOException {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
double[] nextDoubleArray(int n) throws IOException {
double[] a = new double[n];
for (int i = 0; i < n; i++) {
a[i] = nextDouble();
}
return a;
}
String[] nextStringArray(int n) throws IOException {
String[] strs = new String[n];
for (int i = 0; i < n; i++) {
strs[i] = nextString();
}
return strs;
}
int[][] nextIntArray2(int n) throws IOException {
int[][] a = new int[n][];
for (int i = 0; i < n; i++) {
a[i] = nextIntArray();
}
return a;
}
long[][] nextLongArray2(int n) throws IOException {
long[][] a = new long[n][];
for (int i = 0; i < n; i++) {
a[i] = nextLongArray();
}
return a;
}
double[][] nextDoubleArray2(int n) throws IOException {
double[][] a = new double[n][];
for (int i = 0; i < n; i++) {
a[i] = nextDoubleArray();
}
return a;
}
String[][] nextStringArray2(int n) throws IOException {
String[][] strs = new String[n][];
for (int i = 0; i < n; i++) {
strs[i] = nextStringArray();
}
return strs;
}
void close() throws IOException {
if (br != null) {
br.close();
}
}
}
class ProblemCreator<P extends IProblem> {
IProblemFactory<P> factory;
ProblemCreator(IProblemFactory<P> factory) {
this.factory = factory;
}
void create() throws FileNotFoundException {
P problem = factory.newProblem();
System.out.println(problem.toString());
}
}
class ProblemSolverComparator<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver1, solver2;
IResultComparator comparator;
ProblemSolverComparator(IProblemFactory<P> factory, IProblemSolver<P> solver1, IProblemSolver<P> solver2, IResultComparator comparator) {
this.factory = factory;
this.solver1 = solver1;
this.solver2 = solver2;
this.comparator = comparator;
}
void compare() throws IOException {
ProblemReader reader = null;
try {
reader = new ProblemReader();
P problem = factory.newProblem(reader);
String res1 = solver1.solve(problem);
String res2 = solver2.solve(problem);
if (comparator.same(res1, res2)) {
System.out.println(res1);
} else {
System.err.println(res1 + " " + res2);
}
} finally {
if (reader != null) {
reader.close();
}
}
}
}
class ProblemAnswerer<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver;
ProblemAnswerer(IProblemFactory<P> factory, IProblemSolver<P> solver) {
this.factory = factory;
this.solver = solver;
}
void answer() throws IOException {
ProblemReader reader = null;
try {
reader = new ProblemReader();
P problem = factory.newProblem(reader);
String res = solver.solve(problem);
System.out.println(res);
} finally {
if (reader != null) {
reader.close();
}
}
}
}
class ProblemProcessorConfig<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver, solver2;
IResultComparator comparator;
}
class ProblemProcessor<P extends IProblem> {
ProblemProcessorConfig<P> config;
ProblemCreator<P> creator;
ProblemSolverComparator<P> comparator;
ProblemAnswerer<P> answerer;
ProblemProcessor(ProblemProcessorConfig<P> config) {
this.config = config;
creator = new ProblemCreator<P>(config.factory);
comparator = new ProblemSolverComparator<P>(config.factory, config.solver, config.solver2, config.comparator);
answerer = new ProblemAnswerer<P>(config.factory, config.solver);
}
void process(String mode) throws IOException {
switch (mode) {
case "create":
creator.create();
break;
case "debug":
comparator.compare();
break;
case "solve":
answerer.answer();
break;
}
}
}
static class StringUtils {
static String toString(int a) {
return String.valueOf(a);
}
static String toString(long a) {
return String.valueOf(a);
}
static String toString(double a) {
return String.valueOf(a);
}
static String toString(String str) {
return str;
}
static String toString(int[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(long[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(double[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(String[] strs, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < strs.length; i++) {
if (i < strs.length - 1) {
sb.append(strs[i] + delimiter);
} else {
sb.append(strs[i]);
}
}
return sb.toString();
}
static String toString(int[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(long[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(double[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(String[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static int toInt(String s) {
return Integer.parseInt(s);
}
static long toLong(String s) {
return Long.parseLong(s);
}
static double toDouble(String s) {
return Double.parseDouble(s);
}
static int[] toIntArray(String s) {
String[] tokens = s.split(" ");
int[] a = new int[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Integer.parseInt(tokens[i]);
}
return a;
}
static long[] toLongArray(String s) {
String[] tokens = s.split(" ");
long[] a = new long[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Long.parseLong(tokens[i]);
}
return a;
}
static double[] toDoubleArray(String s) {
String[] tokens = s.split(" ");
double[] a = new double[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Double.parseDouble(tokens[i]);
}
return a;
}
static String[] toStringArray(String s) {
return s.split(" ");
}
}
}