Submission #145

2021-02-01 09:32:14

nim

Accepted 50/50

2ms

2212 KiB

import algorithm, strutils, sequtils, sugar

proc i2b(x:seq[int],n:int):seq[int]=
  result=newSeq[int](n)
  for v in x: result[v-1]=1

proc b2i(x:seq[int]):seq[int]=
  for v in 0 ..< x.len:
    if x[v]==1: 
      result.add(v+1)

let IN = stdin.readAll().splitWhitespace().map(x=>parseInt(x))
# echo IN

var 
  n = IN[0]
  m = IN[1]
  x = IN[2 .. ^1]
  b: seq[int]
  status: bool
  

b = i2b(x,n)
status = nextPermutation(b)
if false == status:
  b=repeat(0,n-m) & repeat(1, m)  
echo b2i(b).join(" ")


b = i2b(x,n)
status = prevPermutation(b)
if false == status:
  b=repeat(1, m) & repeat(0,n-m) 
echo b2i(b).join(" ")

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	2ms	1952 KiB
		2	Accepted	0/0	1ms	2212 KiB
		3	Accepted	2/2	1ms	2032 KiB
		4	Accepted	2/2	1ms	2048 KiB
		5	Accepted	2/2	1ms	2044 KiB
		6	Accepted	2/2	1ms	2100 KiB
		7	Accepted	2/2	1ms	2068 KiB
		8	Accepted	2/2	1ms	2088 KiB
		9	Accepted	2/2	1ms	2116 KiB
		10	Accepted	4/4	1ms	2032 KiB
		11	Accepted	4/4	1ms	2076 KiB
		12	Accepted	4/4	1ms	2108 KiB
		13	Accepted	4/4	1ms	2072 KiB
		14	Accepted	4/4	2ms	2136 KiB
		15	Accepted	4/4	2ms	2124 KiB
		16	Accepted	6/6	1ms	2064 KiB
		17	Accepted	6/6	2ms	2168 KiB