Submission #19016456


Source Code Expand

Copy
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


alias Pt = Tuple!(long, "x", long, "y");

enum L = 1000;
enum P = 5, Q = 8, R = 19;

void main() {
  Pt[] ps;
  foreach (e; 0 .. L) foreach (f; 0 .. L) {
    if ((P * e - Q * f) % R == 0) {
      ps ~= Pt(P * e, Q * f);
    }
  }
  const psLen = cast(int)(ps.length);
  assert(1 <= psLen); assert(psLen <= 10^^5);
  foreach (p; ps) {
    assert(0 <= p.x); assert(p.x <= 10^^9);
    assert(0 <= p.y); assert(p.y <= 10^^9);
  }
  
  writeln(ps.length);
  foreach (p; ps) {
    writeln(p.x, " ", p.y);
  }
  
  debug {
    bool[long] as, bs, cs, ds;
    foreach (p; ps) {
      as[p.y] = true;
      bs[p.x - p.y] = true;
      cs[p.x] = true;
      ds[p.x + p.y] = true;
    }
    stderr.writeln(as.length, " ", bs.length, " ", cs.length, " ", ds.length);
  }
}

Submission Info

Submission Time
Task B - Bowling
User hos_lyric
Language D (LDC 1.20.1)
Score 800
Code Size 1986 Byte
Status AC
Exec Time 36 ms
Memory 3740 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 1
AC × 1
Set Name Test Cases
Sample example0.txt
All example0.txt
Case Name Status Exec Time Memory
example0.txt AC 36 ms 3740 KB