Submission #5910375


Source Code Expand

import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

N, K = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))


print(max(1, math.ceil((N - 1) / (K - 1))))

Submission Info

Submission Time
Task C - Minimization
User nohtaray
Language Python (3.4.3)
Score 300
Code Size 552 Byte
Status AC
Exec Time 180 ms
Memory 24340 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 16
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 165 ms 17364 KB
10.txt AC 173 ms 21272 KB
2.txt AC 178 ms 24336 KB
3.txt AC 168 ms 19156 KB
4.txt AC 176 ms 22824 KB
5.txt AC 180 ms 24340 KB
6.txt AC 179 ms 24340 KB
7.txt AC 157 ms 13780 KB
8.txt AC 176 ms 21976 KB
9.txt AC 155 ms 13672 KB
sample1.txt AC 155 ms 13672 KB
sample2.txt AC 156 ms 13544 KB
sample3.txt AC 155 ms 13672 KB