fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define ll long long
  6. #define ull unsigned ll
  7. #define ld long double
  8. typedef vector<int> vi;
  9. typedef multiset<int> mi;
  10. typedef multiset<ll> mll;
  11. typedef vector<ll> vll;
  12. typedef vector<bool> vb;
  13. typedef vector<string> vs;
  14. typedef set<ll> sll;
  15. typedef vector<vector<int>> _2vi;
  16. typedef vector<vector<ll>> _2vll;
  17. #define all(v) ((v).begin()), ((v).end())
  18. #define sz(v) ((ll)((v).size()))
  19.  
  20. #define vinp(v, n)                \
  21.     for (ull i = 0; i < (n); i++) \
  22.     cin >> (v)[i]
  23. #define printv(v)      \
  24.     for (auto i : (v)) \
  25.     cout << i << " "
  26. #define fr0(i, n) for (ull(i) = 0; (i) < (n); (i)++)
  27. #define fr1(i, n) for (ull(i) = 1; (i) < (n); (i)++)
  28. #define fr(i, x, n) for (ull(i) = (x); (i) < (n); (i)++)
  29. #define _CRT_SECURE_NO_WARNING
  30. const ll MOD = 1000000007;
  31.  
  32. void Bustany() {
  33.     ios_base::sync_with_stdio(false);
  34.     cin.tie(NULL);
  35.     cout.tie(NULL);
  36. #ifndef ONLINE_JUDGE
  37.     freopen("./in.txt", "r", stdin), freopen("./out.txt", "w", stdout);
  38. #endif
  39. }
  40.  
  41. const ll N = 1e5 + 5;
  42. vector<sll> adj(N);
  43. //_2vll adj(N,vll(N));
  44.  
  45. ll n, k, a;
  46. ll m;
  47. vll v;
  48.  
  49. bool can(ll mid) {
  50.     vector<bool> vis(n + 1, 0);
  51.     for (ll i = 1; i <= mid; i++) {
  52.         vis[v[i]] = 1;
  53.     }
  54.     ll ships = 0;
  55.     ll c = 0;
  56.     for (ll i = 1; i <= n; i++) {
  57.         if (!vis[i]) {
  58.             c++;
  59.             if (c == a) {
  60.                 ships++;
  61.                 c = 0;
  62.                 i++;
  63.             }
  64.         } else {
  65.             c = 0;
  66.         }
  67.     }
  68.     return ships >= k;
  69. }
  70.  
  71.  
  72. void solve() {
  73.     cin >> n >> k >> a;
  74.     cin >> m;
  75.     v.assign(m + 1, {});
  76.     for (ll i = 1; i <= m; i++) {
  77.         cin >> v[i];
  78.     }
  79.     //first not valid answer
  80.     ll l = 1, r = m, ans = -1, mid;
  81.     while (l <= r) {
  82.         mid = (l + r) / 2;
  83.         if (!can(mid)) {
  84.             ans = mid;
  85.             r = mid - 1;
  86.         } else {
  87.             l = mid + 1;
  88.         }
  89.     }
  90.     cout << ans;
  91. }
  92.  
  93. int main() {
  94.     Bustany();
  95.     ll t = 1;
  96. //     cin >> t;
  97.     while (t--) {
  98.         solve();
  99.     }
  100. }
Success #stdin #stdout 0.01s 7612KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-1
https://ideone.com/rdLvoi
language:
C++ (gcc 8.3)
created:
5 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!