oj.uz

Submission #527438

# Submission time Handle Problem Language Result Execution time Memory
527438 2022-02-17T12:24:59 Z georgerapeanu Financial Report (JOI21_financial) C++11
100 / 100
 460 ms 26920 KB 
#include <bits/stdc++.h>

using namespace std;

class DSU{
  int n;
  vector<int> father;
  vector<int> weight;
  vector<int> left;

public:

  DSU(int n){
    this->n = n;
    this->father = vector<int>(n, -1);
    this->weight = vector<int>(n, 1);
    this->left = vector<int>(n, 0);
    for(int i = 0;i < n;i++){
      this->left[i] = i;
    }
  }

  int find_root(int nod){
    if(father[nod] == -1){
      return nod;
    }
    return father[nod] = find_root(father[nod]);
  }

  bool unite(int x, int y){
//    printf("unite %d %d\n", x, y);
    x = find_root(x);
    y = find_root(y);

    if(x == y){
      return false;
    }
    
    if(weight[x] < weight[y]){
      swap(x, y);
    }
    father[y] = x;
    weight[x] += weight[y];
    left[x] = min(left[x], left[y]);

    return true;
  }

  int get_left(int nod){
    return left[find_root(nod)];
  }
};

class SegmentTree{ /// 0 indexed
  int n;
  vector<int> aint;
  
  public:
  SegmentTree(int n){
    this->n = n;
    this->aint = vector<int>(2 * n + 5);
  }

  void update(int pos,int value){
    for(aint[pos += n] = value;pos > 1;pos >>= 1){
      aint[pos >> 1] = max(aint[pos ^ 1], aint[pos]);
    }
  }

  int query(int l, int r){
    int ans = 0;
    for(l += n, r += n;l < r; l >>= 1, r>>= 1){
      if(l & 1){
        ans = max(ans, aint[l++]);
      }
      if(r & 1){
        ans = max(ans, aint[--r]);
      }
    }
    return ans;
  }
};

int main(){
  int n, d;

  scanf("%d %d", &n, &d);
  vector<int> v(n, 0);

  for(auto &it:v){
    scanf("%d", &it);
  }

  vector<pair<int,int> > pos;
  
  for(int i = 0;i < n;i++){
    pos.push_back({v[i],i});
  }
  sort(pos.begin(), pos.end(), [&](const pair<int,int> &a, const pair<int,int> &b){return make_pair(a.first,-a.second) < make_pair(b.first,-b.second);});

  SegmentTree aint(n);
  DSU dsu(n);
  set<int> active;
  active.insert(-1);
  active.insert(n);
  int ans = 0;

  for(auto it:pos){
    set<int> :: iterator n_it = active.lower_bound(it.second); 
    if(*n_it < n && *n_it - it.second <= d){
      dsu.unite(*n_it, it.second); 
    }
    n_it--;
    if(*n_it != -1 && it.second - *n_it <= d){
      dsu.unite(*n_it, it.second); 
    }
    
//    printf("debug %d %d is left %d\n", it.first, it.second, dsu.get_left(it.second));
    int local_ans = 1 + aint.query(dsu.get_left(it.second), it.second);
    ans = max(ans, local_ans);
    aint.update(it.second, local_ans);
//    printf("activated %d with %d\n", it.second, local_ans);
    active.insert(it.second);
  }

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

  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |   scanf("%d %d", &n, &d);
      |   ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:91:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     scanf("%d", &it);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 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 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 236 KB Output is correct
23 Correct 0 ms 292 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 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 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 236 KB Output is correct
23 Correct 0 ms 292 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 216 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 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 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 236 KB Output is correct
23 Correct 0 ms 292 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 216 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 4 ms 844 KB Output is correct
42 Correct 5 ms 896 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 5 ms 836 KB Output is correct
47 Correct 4 ms 844 KB Output is correct
48 Correct 4 ms 820 KB Output is correct
49 Correct 6 ms 844 KB Output is correct
50 Correct 5 ms 844 KB Output is correct
51 Correct 4 ms 816 KB Output is correct
52 Correct 5 ms 892 KB Output is correct
53 Correct 4 ms 844 KB Output is correct
54 Correct 4 ms 844 KB Output is correct
55 Correct 5 ms 896 KB Output is correct
56 Correct 4 ms 812 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 3 ms 896 KB Output is correct
59 Correct 3 ms 876 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 4 ms 844 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 26632 KB Output is correct
2 Correct 155 ms 26248 KB Output is correct
3 Correct 259 ms 26796 KB Output is correct
4 Correct 335 ms 26632 KB Output is correct
5 Correct 260 ms 26796 KB Output is correct
6 Correct 337 ms 26608 KB Output is correct
7 Correct 176 ms 26504 KB Output is correct
8 Correct 166 ms 26508 KB Output is correct
9 Correct 148 ms 26804 KB Output is correct
10 Correct 136 ms 26920 KB Output is correct
11 Correct 198 ms 26660 KB Output is correct
12 Correct 217 ms 26644 KB Output is correct
13 Correct 286 ms 26760 KB Output is correct
14 Correct 315 ms 26632 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 26900 KB Output is correct
2 Correct 258 ms 26764 KB Output is correct
3 Correct 337 ms 26796 KB Output is correct
4 Correct 367 ms 26636 KB Output is correct
5 Correct 294 ms 26644 KB Output is correct
6 Correct 355 ms 26796 KB Output is correct
7 Correct 171 ms 26684 KB Output is correct
8 Correct 159 ms 26644 KB Output is correct
9 Correct 166 ms 26620 KB Output is correct
10 Correct 232 ms 26564 KB Output is correct
11 Correct 374 ms 26648 KB Output is correct
12 Correct 291 ms 26636 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 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 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 236 KB Output is correct
23 Correct 0 ms 292 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 292 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 216 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 4 ms 844 KB Output is correct
42 Correct 5 ms 896 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 5 ms 836 KB Output is correct
47 Correct 4 ms 844 KB Output is correct
48 Correct 4 ms 820 KB Output is correct
49 Correct 6 ms 844 KB Output is correct
50 Correct 5 ms 844 KB Output is correct
51 Correct 4 ms 816 KB Output is correct
52 Correct 5 ms 892 KB Output is correct
53 Correct 4 ms 844 KB Output is correct
54 Correct 4 ms 844 KB Output is correct
55 Correct 5 ms 896 KB Output is correct
56 Correct 4 ms 812 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 3 ms 896 KB Output is correct
59 Correct 3 ms 876 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 4 ms 844 KB Output is correct
62 Correct 161 ms 26632 KB Output is correct
63 Correct 155 ms 26248 KB Output is correct
64 Correct 259 ms 26796 KB Output is correct
65 Correct 335 ms 26632 KB Output is correct
66 Correct 260 ms 26796 KB Output is correct
67 Correct 337 ms 26608 KB Output is correct
68 Correct 176 ms 26504 KB Output is correct
69 Correct 166 ms 26508 KB Output is correct
70 Correct 148 ms 26804 KB Output is correct
71 Correct 136 ms 26920 KB Output is correct
72 Correct 198 ms 26660 KB Output is correct
73 Correct 217 ms 26644 KB Output is correct
74 Correct 286 ms 26760 KB Output is correct
75 Correct 315 ms 26632 KB Output is correct
76 Correct 170 ms 26900 KB Output is correct
77 Correct 258 ms 26764 KB Output is correct
78 Correct 337 ms 26796 KB Output is correct
79 Correct 367 ms 26636 KB Output is correct
80 Correct 294 ms 26644 KB Output is correct
81 Correct 355 ms 26796 KB Output is correct
82 Correct 171 ms 26684 KB Output is correct
83 Correct 159 ms 26644 KB Output is correct
84 Correct 166 ms 26620 KB Output is correct
85 Correct 232 ms 26564 KB Output is correct
86 Correct 374 ms 26648 KB Output is correct
87 Correct 291 ms 26636 KB Output is correct
88 Correct 306 ms 26644 KB Output is correct
89 Correct 414 ms 26556 KB Output is correct
90 Correct 407 ms 26684 KB Output is correct
91 Correct 460 ms 26684 KB Output is correct
92 Correct 254 ms 26644 KB Output is correct
93 Correct 385 ms 26592 KB Output is correct
94 Correct 437 ms 26680 KB Output is correct
95 Correct 341 ms 26612 KB Output is correct
96 Correct 394 ms 26564 KB Output is correct
97 Correct 424 ms 26684 KB Output is correct
98 Correct 394 ms 26628 KB Output is correct
99 Correct 363 ms 26784 KB Output is correct
100 Correct 357 ms 26684 KB Output is correct
101 Correct 175 ms 26604 KB Output is correct
102 Correct 175 ms 26652 KB Output is correct
103 Correct 186 ms 26632 KB Output is correct
104 Correct 213 ms 26688 KB Output is correct
105 Correct 234 ms 26644 KB Output is correct
106 Correct 222 ms 26732 KB Output is correct
107 Correct 226 ms 26640 KB Output is correct
108 Correct 323 ms 26668 KB Output is correct
109 Correct 270 ms 26676 KB Output is correct
110 Correct 415 ms 26688 KB Output is correct
111 Correct 398 ms 26648 KB Output is correct
112 Correct 310 ms 26764 KB Output is correct
113 Correct 372 ms 26584 KB Output is correct
114 Correct 371 ms 26636 KB Output is correct
115 Correct 179 ms 26636 KB Output is correct
116 Correct 225 ms 26676 KB Output is correct
117 Correct 217 ms 26600 KB Output is correct
118 Correct 229 ms 26788 KB Output is correct
119 Correct 177 ms 26572 KB Output is correct
120 Correct 177 ms 26532 KB Output is correct