Submission #677802

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
677802	2023-01-04T11:45:13 Z	Tigryonochekk	Money (IZhO17_money)	C++17	0 / 100	1 ms	312 KB

money

#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>

const int N = 1e6 + 2;

int n;
int a[N];

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int ans = n;
    for (int i = 1; i < n; i++) {
        if (a[i] > a[i + 1]) continue;
        bool f = true;
        for (int j = 1; j < i; j++) {
            if (a[j] > a[i] && a[j] < a[i + 1])
                f = false;
        }
        if (f)
            ans--;
    }
    cout << ans << endl;
    return 0;
}
/*
6
3 6 4 5 1 2
*/

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Incorrect	1 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Incorrect	1 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Incorrect	1 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Incorrect	1 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-