oj.uz

Submission #524004

# Submission time Handle Problem Language Result Execution time Memory
524004 2022-02-08T14:18:27 Z Nursik Money (IZhO17_money) C++14
45 / 100
 1500 ms 6224 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair

const ll maxn = 1e6 + 1, maxm = 3e5 + 1,  maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;

using namespace std;

int n;
int a[maxn];
int main(){
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    int pos = 1, ans = 0;
    vector<int> v;
    v.pb(0), v.pb(inf);
    while (pos <= n){
        int mx = 0, mn = inf, answ = pos;;
        for (int j = pos; j <= n; ++j){
            if ((j == pos) || (j - 1 >= pos && a[j] >= a[j - 1])){
                mx = max(mx, a[j]);
                mn = min(mn, a[j]);
                int ok = 0;
                for (int k = 0; k < v.size() - 1; ++k){
                    if (v[k] <= mn && mx <= v[k + 1]){
                        ok = 1;
                        break;
                    }
                }
                if (ok == 1){
                    answ = j;
                }
                else{
                    break;
                }
            }
            else{
               // cout << a[j] << " " << a[j - 1] << '\n';
                break;
            }
        }
        mn = inf, mx = 0;
        for (int j = pos; j <= answ; ++j){
            mn = min(mn, a[j]);
            mx = max(mx, a[j]);
        }
        for (int k = 0; k < v.size() - 1; ++k){
            if (v[k] <= mn && mx <= v[k + 1]){
                vector<int> nw;
                for (int i = 0; i <= k; ++i){
                    nw.pb(v[i]);
                }
                for (int j = pos; j <= answ; ++j){
                    nw.pb(a[j]);
                }
                for (int i = k + 1; i < v.size(); ++i){
                    nw.pb(v[i]);
                }
                v = nw;
                break;
            }
        }
        ans++;
        pos = answ + 1;
    }
    cout << ans;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:33:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |                 for (int k = 0; k < v.size() - 1; ++k){
      |                                 ~~^~~~~~~~~~~~~~
money.cpp:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for (int k = 0; k < v.size() - 1; ++k){
      |                         ~~^~~~~~~~~~~~~~
money.cpp:65:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |                 for (int i = k + 1; i < v.size(); ++i){
      |                                     ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 0 ms 204 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 280 KB Output is correct
24 Correct 0 ms 300 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 280 KB Output is correct
24 Correct 0 ms 300 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 280 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 288 KB Output is correct
38 Correct 1 ms 296 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 280 KB Output is correct
24 Correct 0 ms 300 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 280 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 288 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Execution timed out 1514 ms 6224 KB Time limit exceeded
40 Halted 0 ms 0 KB -