Submission #2673585
Source Code Expand
import strutils import sequtils import algorithm import math import queues import tables import sets import logging import future const INF* = int(1e18 + 373) when not defined(release): addHandler(newFileLogger(stderr, lvlAll, "[ $levelname ] ")) proc readSeq*(): seq[string] = stdin.readLine().strip().split() proc readSeq*(n: Natural): seq[string] = result = newSeq[string](n) for i in 0..<n: result[i] = stdin.readLine().strip() proc readInt1*(): int = readSeq().map(parseInt)[0] proc readInt2*(): (int, int) = let a = readSeq().map(parseInt) return (a[0], a[1]) proc readInt3*(): (int, int, int) = let a = readSeq().map(parseInt) return (a[0], a[1], a[2]) proc readInt4*(): (int, int, int, int) = let a = readSeq().map(parseInt) return (a[0], a[1], a[2], a[3]) type seq2*[T] = seq[seq[T]] proc newSeq2*[T](n1, n2: Natural): seq2[T] = newSeqWith(n1, newSeq[T](n2)) #------------------------------------------------------------------------------# proc solve(n, a, b, c, d: int): bool = let x = b - a for i in 0..<n: let s1 = i * c let t1 = i * d + 1 let s2 = (n - 1 - i) * c let t2 = (n - 1 - i) * d + 1 let s3 = s2 + x let t3 = t2 + x if not (t3 <= s1 or t1 <= s3): return true return false proc main() = let tmp = readSeq().map(parseInt) let n = tmp[0] let a = tmp[1] let b = tmp[2] let c = tmp[3] let d = tmp[4] echo if solve(n, a, b, c, d): "YES" else: "NO" main()
Submission Info
Submission Time | |
---|---|
Task | B - Moderate Differences |
User | somq14 |
Language | Nim (0.13.0) |
Score | 400 |
Code Size | 1518 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
Hint: system [Processing] Hint: Main [Processing] Hint: strutils [Processing] Hint: parseutils [Processing] Hint: sequtils [Processing] Hint: algorithm [Processing] Hint: math [Processing] Hint: times [Processing] Hint: queues [Processing] Hint: tables [Processing] Hint: hashes [Processing] Hint: etcpriv [Processing] Hint: sets [Processing] Hint: os [Processing] Hint: posix [Processing] Hint: logging [Processing] lib/pure/logging.nim(128, 22) Hint: 'Exception' is declared but not used [XDeclaredButNotUsed] Hint: future [Processing] Hint: macros [Processing] Hint: [Link] Hint: operation successful (24848 lines compiled; 2.710 sec total; 24.250MB; Release Build) [SuccessX]
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, a01.txt, a02.txt, a03.txt, a04.txt, b01.txt, b02.txt, b03.txt, b04.txt, c01.txt, c02.txt, c03.txt, c04.txt, d01.txt, d02.txt, d03.txt, d04.txt, d05.txt, d06.txt, d07.txt, d08.txt, d09.txt, d10.txt, d11.txt, d12.txt, d13.txt, d14.txt, d15.txt, d16.txt, d17.txt, d18.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01.txt | AC | 1 ms | 256 KB |
a02.txt | AC | 1 ms | 256 KB |
a03.txt | AC | 1 ms | 256 KB |
a04.txt | AC | 1 ms | 256 KB |
b01.txt | AC | 1 ms | 256 KB |
b02.txt | AC | 1 ms | 256 KB |
b03.txt | AC | 1 ms | 256 KB |
b04.txt | AC | 1 ms | 256 KB |
c01.txt | AC | 1 ms | 256 KB |
c02.txt | AC | 1 ms | 256 KB |
c03.txt | AC | 1 ms | 256 KB |
c04.txt | AC | 1 ms | 256 KB |
d01.txt | AC | 1 ms | 256 KB |
d02.txt | AC | 1 ms | 256 KB |
d03.txt | AC | 1 ms | 256 KB |
d04.txt | AC | 1 ms | 256 KB |
d05.txt | AC | 1 ms | 256 KB |
d06.txt | AC | 1 ms | 256 KB |
d07.txt | AC | 1 ms | 256 KB |
d08.txt | AC | 1 ms | 256 KB |
d09.txt | AC | 1 ms | 256 KB |
d10.txt | AC | 1 ms | 256 KB |
d11.txt | AC | 1 ms | 256 KB |
d12.txt | AC | 1 ms | 256 KB |
d13.txt | AC | 1 ms | 256 KB |
d14.txt | AC | 1 ms | 256 KB |
d15.txt | AC | 1 ms | 256 KB |
d16.txt | AC | 1 ms | 256 KB |
d17.txt | AC | 1 ms | 256 KB |
d18.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |