Submission #19,560

19560

2025-12-14 17:24:43

cpp17

Partially correct 82/100

97ms

3128 KiB

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

int main()
{
    int m, k, n; cin >> m >> k >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++){
        cin >> v[i];
    }
    int ans1 = 0, sum = 0, minn = k, maxn = k;
    int 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	316 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	1ms	500 KiB
		8	Accepted	2ms	508 KiB
		9	Accepted	2ms	316 KiB
		10	Accepted	1ms	396 KiB
		11	Accepted	1ms	316 KiB
subtask4	28/28
		12	Accepted	94ms	1192 KiB
		13	Accepted	96ms	1244 KiB
		14	Accepted	96ms	1076 KiB
		15	Accepted	94ms	1200 KiB
		16	Accepted	94ms	1196 KiB
		17	Accepted	96ms	1076 KiB
		18	Accepted	96ms	1076 KiB
subtask5	18/36
		19	Partially correct	96ms	1076 KiB
		20	Partially correct	96ms	1268 KiB
		21	Partially correct	96ms	1076 KiB
		22	Partially correct	97ms	1520 KiB
		23	Partially correct	96ms	1076 KiB
		24	Partially correct	96ms	3128 KiB
		25	Partially correct	96ms	1076 KiB
		26	Partially correct	96ms	3100 KiB
		27	Accepted	96ms	1780 KiB