CodeForces-Solutions/1851C.cpp at main · garvit018/CodeForces-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
<<<<<<< HEAD
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int n, k;
        cin >> n >> k;
        int arr[n];
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }

        int firstpos = 0, lastpos = 0;
        int fcnt = 0, lcnt = 0;

        for (int i = 0; i < n && fcnt < k; i++)
        {
            if (arr[i] == arr[0])
            {
                firstpos = i;
                fcnt++;
            }
        }
        for (int i = n - 1; i >= 0 && lcnt < k; i--)
        {
            if (arr[i] == arr[n - 1])
            {
                lastpos = i;
                lcnt++;
            }
        }
        if (lcnt >= k && fcnt >= k && (arr[0] == arr[n - 1] || firstpos < lastpos))
        // lcnt and fcnt toh >=k hone hi chahiye baaki agar arr[0]=arr[n-1] phir chahe kuch hi ho
        // first and last pos
        // agar wo barabar nhi hote toh firstpos<lastpos kyuki agar ulta hua mtlb lcnt=k tb ho rha
        // jab firstpos ka count abhi complete nhi hua
        // like test case 4
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
=======
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int n, k;
        cin >> n >> k;
        int arr[n];
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }

        int firstpos = 0, lastpos = 0;
        int fcnt = 0, lcnt = 0;

        for (int i = 0; i < n && fcnt < k; i++)
        {
            if (arr[i] == arr[0])
            {
                firstpos = i;
                fcnt++;
            }
        }
        for (int i = n - 1; i >= 0 && lcnt < k; i--)
        {
            if (arr[i] == arr[n - 1])
            {
                lastpos = i;
                lcnt++;
            }
        }
        if (lcnt >= k && fcnt >= k && (arr[0] == arr[n - 1] || firstpos < lastpos))
        // lcnt and fcnt toh >=k hone hi chahiye baaki agar arr[0]=arr[n-1] phir chahe kuch hi ho
        // first and last pos
        // agar wo barabar nhi hote toh firstpos<lastpos kyuki agar ulta hua mtlb lcnt=k tb ho rha
        // jab firstpos ka count abhi complete nhi hua
        // like test case 4
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
>>>>>>> 4bb7f1e9c9149de1c5c4e3b2a9a463945e04b545
}