Submission #237179

#	Time	Username	Problem	Language	Result	Execution time	Memory
237179		kartel	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>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +2005
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, m, k, i, j, mk[N], x, ans = 0, kol;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m >> k;
    for (i = 1; i <= m; i++)
    {
        cin >> x;
        for (j = max(1, x - k); j <= x + k; j++) mk[j] = 1;
    }

    ans = 0;
    i = 1;
    while (i <= n)
    {
        j = i;
        while (j <= n && !mk[j]) j++;

        kol = j - i;

        ans += kol / (2 * k + 1);

        if (kol % (2 * k + 1) != 0) ans++;

        i = max(i + 1, j);
    }

    cout << ans;
}

//  x ^ 2 + y ^ 2 = 1
//  x * a_i + y * b_i
//  a_i = -b_i * tan(alpha)
//  a_i / -b_i = tan(alpha)
//  alpha = atan(a_i / (-b_i))

• Subtask 1: 50 / 50