제출 #236707

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236707		Vimmer	Rasvjeta (COCI17_rasvjeta)	C++14	50 / 50	5 ms	384 KiB

rasjveta

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 2005000
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;

    cin >> n >> m >> k;

    bool mk[n];

    memset(mk, 0, sizeof(mk));

    for (int i = 0; i < m; i++)
    {
        int x;

        cin >> x;

        x--;

        for (int j = max(0, x - k); j <= min(n - 1, x + k); j++) mk[j] = 1;
    }

    int ans = 0, kol = 0;

    for (int i = 0; i < n; i++)
    {
        if (!mk[i]) {kol++; continue;}

        if (kol != 0) {ans += kol / (k + 1 + k); if (kol % (k + k + 1) != 0) ans++; kol = 0;}
    }

    if (kol != 0) {ans += kol / (k + k + 1); if (kol % (k + k + 1) != 0) ans++; kol = 0;}

    cout << ans << endl;
}

• Subtask 1: 50 / 50