Submission #19,561

19561

2025-12-14 17:31:56

cpp17

Accepted 100/100

94ms

2036 KiB

#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll m, k, n; cin >> m >> k >> n;
    vector<long long> v(n);
    for (int i = 0; i < n; i++){
        cin >> v[i];
    }
    ll ans1 = 0, sum = 0, minn = k, maxn = k;
    ll now = k;
    for (int i = 0; i < n; i++){
        if (minn > v[i] || v[i] > maxn){
            ans1++; sum += abs(now - v[i]);
            now = v[i];
        }
        if (v[i] < minn) minn = v[i];
        if (v[i] > maxn) maxn = v[i];
    }
    cout << ans1 << " " << sum;
    return 0;
}

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	1ms	500 KiB
		2	Accepted	1ms	316 KiB
subtask2	12/12
		3	Accepted	1ms	316 KiB
		4	Accepted	1ms	316 KiB
		5	Accepted	1ms	316 KiB
subtask3	24/24
		6	Accepted	2ms	316 KiB
		7	Accepted	2ms	316 KiB
		8	Accepted	2ms	316 KiB
		9	Accepted	2ms	316 KiB
		10	Accepted	1ms	316 KiB
		11	Accepted	1ms	316 KiB
subtask4	28/28
		12	Accepted	92ms	1844 KiB
		13	Accepted	93ms	1976 KiB
		14	Accepted	93ms	1980 KiB
		15	Accepted	93ms	1844 KiB
		16	Accepted	93ms	2028 KiB
		17	Accepted	93ms	1844 KiB
		18	Accepted	93ms	1844 KiB
subtask5	36/36
		19	Accepted	93ms	1844 KiB
		20	Accepted	93ms	2036 KiB
		21	Accepted	93ms	1980 KiB
		22	Accepted	93ms	1844 KiB
		23	Accepted	94ms	1844 KiB
		24	Accepted	93ms	2036 KiB
		25	Accepted	93ms	1844 KiB
		26	Accepted	93ms	1844 KiB
		27	Accepted	93ms	1844 KiB