Submission #5910367


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, int(N / (K - 1))))

Submission Info

Submission Time
Task C - Minimization
User nohtaray
Language Python (3.4.3)
Score 0
Code Size 538 Byte
Status WA
Exec Time 178 ms
Memory 24380 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 9
WA × 7
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 WA 164 ms 17276 KB
10.txt WA 172 ms 21312 KB
2.txt WA 178 ms 24380 KB
3.txt WA 167 ms 19196 KB
4.txt AC 176 ms 23504 KB
5.txt AC 177 ms 24380 KB
6.txt AC 178 ms 24376 KB
7.txt WA 156 ms 13820 KB
8.txt WA 174 ms 22404 KB
9.txt WA 154 ms 13588 KB
sample1.txt AC 153 ms 13580 KB
sample2.txt AC 156 ms 13584 KB
sample3.txt AC 155 ms 13584 KB