1768B - Quick Sort - CodeForces Solution

greedy math

Please click on ads to support us..

Python Code: 


import math
from multiprocessing import current_process
import os
import random
import re
import copy
import pdb
import sys





        

        








if __name__ == '__main__':
    t = int(input())

    for _ in range(t):
        [n, k] = list(map(int, str(input()).split(' ')))
        
        p = list(map(int, str(input()).split(' ')))

        dict = {}

        for idx, ele in enumerate(p):
            dict[ele] = idx

        check = True
        broken = -1
        prev = dict[1]
        for i in range(2, n+1):
            loc = dict[i]
            if loc < prev:
                check = False
                broken = i
                break
            
            prev = loc

        if check == True:
            print(0)
        
        else:
            res = int((n-broken+1)/k)
            if (n-broken+1) % k != 0:
                res += 1
            print(res)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0)
#define endl '\n'
#define int long long
#define ar array<int, 2>
#define arr array<int, 3>
const int N = 2e5 + 5, M = 2 * N;
const int inf = 0x3f3f3f3f;
int mod = 998244353; //1e9+7;
int t, n, m, k;

signed main()
{
    ios;
#ifdef DEBUG
    freopen("../1.in", "r", stdin);
#endif
    // 这题是发现规律的。。
    // 就是猜 。
    // 我们猜测原数组的1后面的升序是不用变的。。
    cin >> t;
    while (t--)
    {
        cin >> n >> k;
        int a[n + 1];
        for (int i = 1; i <= n; ++i)
            cin >> a[i];
        int l = 1;
        for (int i = 1; i <= n; ++i)
            if (a[i] == l)
                l++;
        n -= l - 1;
        cout << (n + k - 1) / k << endl;
    }
};


Comments

Submit
0 Comments
More Questions

468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II
222. Count Complete Tree Nodes
215. Kth Largest Element in an Array
198. House Robber
153. Find Minimum in Rotated Sorted Array
150. Evaluate Reverse Polish Notation
144. Binary Tree Preorder Traversal
137. Single Number II
130. Surrounded Regions