oj.uz

Submission #39376

# Submission time Handle Problem Language Result Execution time Memory
39376 2018-01-13T10:24:08 Z Extazy Money (IZhO17_money) C++14
0 / 100
 0 ms 6084 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define prev vahgkjahjka
#define next hajhqkjjkqkjq

using namespace std;

const int N = 1000007;

int n,a[N],ans;
vector < int > curr;
multiset < int > s;

multiset < int >::iterator prev(multiset < int >::iterator it) {
    --it;
    return it;
}

bool are_consecutive(int v1, int v2) {
    if(v1==v2) return true;
    return *prev(s.lower_bound(v2))==v1; 
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int i,j;

    scanf("%d", &n);
    for(i=1;i<=n;i++) {
        scanf("%d", &a[i]);
        s.insert(a[i]);
    }

    for(i=n;i>=1;) {
        vector < int > curr;
        curr.push_back(a[i]);
        for(j=i-1;j>=1;j--) {
            if(are_consecutive(a[j],a[j+1])) {
                curr.push_back(a[j]);
            }
            else {
                break;
            }
        }
        for(j=0;j<(int)(curr.size());j++) {
            s.erase(s.find(curr[j]));
        }
        i-=(int)(curr.size());
        ++ans;
    }

    printf("%d\n", ans);

    return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:29:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
money.cpp:31:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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