oj.uz

Submission #35769

# Submission time Handle Problem Language Result Execution time Memory
35769 2017-11-29T12:53:31 Z funcsr Money (IZhO17_money) C++14
100 / 100
 899 ms 18020 KB 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

#define MAX_N (1<<20)
int seg[MAX_N*2-1];
int query(int a, int b, int k=0, int l=0, int r=MAX_N) {
  if (b <= l || r <= a) return 0;
  if (a <= l && r <= b) return seg[k];
  return query(a, b, k*2+1, l, (l+r)/2) + query(a, b, k*2+2, (l+r)/2, r);
}
void add(int k) {
  k += MAX_N-1;
  if (seg[k]) return;
  seg[k]++;
  while (k > 0) {
    k = (k-1) / 2;
    seg[k]++;
  }
}
int kth(int x, int k=0, int l=0, int r=MAX_N) {
  if (r-l == 1) return l;
  if (x <= seg[k*2+1]) return kth(x, k*2+1, l, (l+r)/2);
  else return kth(x-seg[k*2+1], k*2+2, (l+r)/2, r);
}

int N;
int A[1000000];
int L[1000000];

signed main() {
  scanf("%d", &N);
  rep(i, N) scanf("%d", &A[i]);
  L[N-1] = N-1;
  for (int i=N-2; i>=0; i--) {
    if (A[i] <= A[i+1]) L[i] = L[i+1];
    else L[i] = i;
  }

  add(1000001);
  rep(i, N) {
    int s = query(0, A[i]+1);
    int lim = kth(s+1);
    L[i] = upper_bound(A+i, A+L[i]+1, lim) - A - 1;
    add(A[i]);
  }
  //rep(i, N) cout<<L[i] << ",";cout<<"\n";
  assert(is_sorted(L, L+N));
  rep(i, N) assert(L[i] >= i);
  int lo = 0, ctr = 0;
  while (lo < N) {
    lo = L[lo]+1;
    ctr++;
  }
  printf("%d\n", ctr);
  return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:54:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
money.cpp:55:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   rep(i, N) scanf("%d", &A[i]);
                               ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18020 KB Output is correct
2 Correct 0 ms 18020 KB Output is correct
3 Correct 0 ms 18020 KB Output is correct
4 Correct 0 ms 18020 KB Output is correct
5 Correct 0 ms 18020 KB Output is correct
6 Correct 0 ms 18020 KB Output is correct
7 Correct 0 ms 18020 KB Output is correct
8 Correct 0 ms 18020 KB Output is correct
9 Correct 0 ms 18020 KB Output is correct
10 Correct 0 ms 18020 KB Output is correct
11 Correct 0 ms 18020 KB Output is correct
12 Correct 0 ms 18020 KB Output is correct
13 Correct 0 ms 18020 KB Output is correct
14 Correct 0 ms 18020 KB Output is correct
15 Correct 0 ms 18020 KB Output is correct
16 Correct 0 ms 18020 KB Output is correct
17 Correct 0 ms 18020 KB Output is correct
18 Correct 0 ms 18020 KB Output is correct
19 Correct 0 ms 18020 KB Output is correct
20 Correct 0 ms 18020 KB Output is correct
21 Correct 0 ms 18020 KB Output is correct
22 Correct 0 ms 18020 KB Output is correct
23 Correct 0 ms 18020 KB Output is correct
24 Correct 0 ms 18020 KB Output is correct
25 Correct 0 ms 18020 KB Output is correct
26 Correct 0 ms 18020 KB Output is correct
27 Correct 0 ms 18020 KB Output is correct
28 Correct 0 ms 18020 KB Output is correct
29 Correct 0 ms 18020 KB Output is correct
30 Correct 0 ms 18020 KB Output is correct
31 Correct 0 ms 18020 KB Output is correct
32 Correct 0 ms 18020 KB Output is correct
33 Correct 0 ms 18020 KB Output is correct
34 Correct 0 ms 18020 KB Output is correct
35 Correct 0 ms 18020 KB Output is correct
36 Correct 0 ms 18020 KB Output is correct
37 Correct 3 ms 18020 KB Output is correct
38 Correct 3 ms 18020 KB Output is correct
39 Correct 179 ms 18020 KB Output is correct
40 Correct 279 ms 18020 KB Output is correct
41 Correct 149 ms 18020 KB Output is correct
42 Correct 156 ms 18020 KB Output is correct
43 Correct 99 ms 18020 KB Output is correct
44 Correct 379 ms 18020 KB Output is correct
45 Correct 366 ms 18020 KB Output is correct
46 Correct 346 ms 18020 KB Output is correct
47 Correct 336 ms 18020 KB Output is correct
48 Correct 376 ms 18020 KB Output is correct
49 Correct 619 ms 18020 KB Output is correct
50 Correct 609 ms 18020 KB Output is correct
51 Correct 613 ms 18020 KB Output is correct
52 Correct 643 ms 18020 KB Output is correct
53 Correct 606 ms 18020 KB Output is correct
54 Correct 673 ms 18020 KB Output is correct
55 Correct 849 ms 18020 KB Output is correct
56 Correct 873 ms 18020 KB Output is correct
57 Correct 866 ms 18020 KB Output is correct
58 Correct 899 ms 18020 KB Output is correct
59 Correct 849 ms 18020 KB Output is correct
60 Correct 849 ms 18020 KB Output is correct
61 Correct 826 ms 18020 KB Output is correct
62 Correct 809 ms 18020 KB Output is correct