Submission #5882796
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i=0; i < (n); ++i) #define REPR(i,n) for(int i=(n); i >=0; --i) #define FOR(i, m, n) for(int i = (m); i < (n); ++i) typedef long long ll; #define INF 1e9 int main(){ int N, K; cin >> N >> K; vector<int> A(N); int mini; REP(i, N){ cin >> A[i]; if(A[i] == 1){ mini = i; } } int start = max(0, mini-K+1); int end = min(mini, N-K); int minc = 1e9; FOR(i, start, end+1){ int cnt = i/(K-1)+((N-1)-(i+K-1))/(K-1); int right = i/(K-1); int left = ((N-1)-(i+K-1))/(K-1); if(i%(K-1)){ cnt++; right++; } if(((N-1)-(i+K-1))%(K-1)){ cnt++; left++; } cout << i << " " << right << " " << left << endl; minc = min(minc, cnt+1); } cout << minc << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Minimization |
User | tune |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 876 Byte |
Status | WA |
Exec Time | 77 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||
Status |
|
|
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 | 14 ms | 508 KB |
10.txt | WA | 42 ms | 640 KB |
2.txt | WA | 77 ms | 896 KB |
3.txt | WA | 16 ms | 512 KB |
4.txt | WA | 28 ms | 640 KB |
5.txt | WA | 29 ms | 640 KB |
6.txt | WA | 29 ms | 640 KB |
7.txt | WA | 3 ms | 256 KB |
8.txt | WA | 26 ms | 640 KB |
9.txt | WA | 2 ms | 256 KB |
sample1.txt | WA | 1 ms | 256 KB |
sample2.txt | WA | 1 ms | 256 KB |
sample3.txt | WA | 1 ms | 256 KB |