oj.uz

Submission #518338

# Submission time Handle Problem Language Result Execution time Memory
518338 2022-01-23T12:46:24 Z cig32 Financial Report (JOI21_financial) C++17
100 / 100
 713 ms 48856 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long

int st[4*MAXN];

void u(int l, int r, int tar, int idx, int val) {
  if(l == r){
    st[idx] = val;return;
  }
  int mid = (l+r) >> 1;
  if(tar <= mid) u(l, mid, tar, 2*idx+1, val);
  else u(mid+1, r, tar, 2*idx+2, val);
  st[idx] = max(st[2*idx+1], st[2*idx+2]);
}

int qu(int l, int r, int constl, int constr, int idx) {
  if(l<=constl && constr<=r) return st[idx];
  int mid = (constl+constr) >> 1;
  if(mid<l || r<constl) return qu(l, r, mid+1, constr, 2*idx+2);
  if(constr<l || r<mid+1) return qu(l, r, constl, mid, 2*idx+1);
  return max(qu(l, r, constl, mid, 2*idx+1), qu(l, r, mid+1, constr, 2*idx+2));
}

void update(int i, int v) {
  u(0, MAXN-1, i, 0, v);
}
int query(int l, int r) {
  return qu(l, r, 0, MAXN-1, 0);
}

void solve(int tc) {
  int N,D;cin >> N >> D;
  int A[N+1];
  map<int, vector<int> > mp;
  for(int i=1; i<=N; i++){
    cin>>A[i];
    mp[A[i]].push_back(i);
  }
  
  set<pair<int, int> > s;
  s.insert({696969, 0});
  s.insert({N, N});//actual .first: N+1 - .first
  for(auto xz: mp) {
    int x = xz.first;
    map<int, int> pending;
    for(int y: xz.second) {
      pair<int, int> q = *s.lower_bound({N+1 - y, 0});
      if(q.first == 696969) continue;
      //cout << y << ": ";
      //cout << "erase " << N+1 - q.first << " " << q.second << "\n";
      if(N+1 - q.first + q.second <= y) continue;
      s.erase(q);
      q.first = N+1 - q.first;
      pair<int, int> q1 = {q.first, y - q.first};
      pair<int, int> q2 = {y + 1, q.first + q.second - 1 - y};
      q1.first = N+1 - q1.first;
      q2.first = N+1 - q2.first;
      if(q1.second >= D && q1.second < q.second) {
        s.insert(q1);
        //cout << "insert " << N+1 - q1.first << " " << q1.second << "\n";
      }
      if(q2.second >= D && q2.second < q.second) {
        s.insert(q2);
        //cout << "insert " << N+1 - q2.first << " " << q2.second << "\n";
      }
    }
    for(int y: xz.second) {
      pair<int, int> q = *s.lower_bound({N+1 - (y - D), 0});
      int lb = 1;
      if(q.first != 696969) {
        lb = N+1 - q.first;
      }
      //cout << y << ": " << lb << "\n";
      int q0 = query(lb, y);
      pending[y] = q0 + 1;
    }
    for(auto y: pending) {
      update(y.first, y.second);
    }
  }
  cout << query(1, N) << "\n";
  //for(int i=1; i<=N; i++) cout << query(i, i) << " ";
  //cout << "\n";
}

int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Compilation message

Main.cpp: In function 'void solve(long long int)':
Main.cpp:49:9: warning: unused variable 'x' [-Wunused-variable]
   49 |     int x = xz.first;
      |         ^

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 9 ms 1028 KB Output is correct
42 Correct 7 ms 1488 KB Output is correct
43 Correct 4 ms 848 KB Output is correct
44 Correct 8 ms 980 KB Output is correct
45 Correct 5 ms 968 KB Output is correct
46 Correct 6 ms 1452 KB Output is correct
47 Correct 6 ms 1372 KB Output is correct
48 Correct 6 ms 1440 KB Output is correct
49 Correct 6 ms 1444 KB Output is correct
50 Correct 6 ms 1360 KB Output is correct
51 Correct 7 ms 1372 KB Output is correct
52 Correct 8 ms 1360 KB Output is correct
53 Correct 6 ms 1456 KB Output is correct
54 Correct 5 ms 1364 KB Output is correct
55 Correct 6 ms 1360 KB Output is correct
56 Correct 6 ms 1360 KB Output is correct
57 Correct 6 ms 1408 KB Output is correct
58 Correct 5 ms 1360 KB Output is correct
59 Correct 6 ms 1372 KB Output is correct
60 Correct 5 ms 1344 KB Output is correct
61 Correct 5 ms 1360 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 34280 KB Output is correct
2 Correct 318 ms 20808 KB Output is correct
3 Correct 406 ms 18936 KB Output is correct
4 Correct 712 ms 43648 KB Output is correct
5 Correct 520 ms 47160 KB Output is correct
6 Correct 713 ms 48408 KB Output is correct
7 Correct 241 ms 43424 KB Output is correct
8 Correct 242 ms 43580 KB Output is correct
9 Correct 242 ms 43632 KB Output is correct
10 Correct 239 ms 43680 KB Output is correct
11 Correct 461 ms 43876 KB Output is correct
12 Correct 538 ms 44292 KB Output is correct
13 Correct 470 ms 43732 KB Output is correct
14 Correct 595 ms 43980 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 34352 KB Output is correct
2 Correct 204 ms 13768 KB Output is correct
3 Correct 241 ms 15464 KB Output is correct
4 Correct 521 ms 43664 KB Output is correct
5 Correct 464 ms 43736 KB Output is correct
6 Correct 529 ms 43700 KB Output is correct
7 Correct 257 ms 43716 KB Output is correct
8 Correct 239 ms 43692 KB Output is correct
9 Correct 241 ms 43424 KB Output is correct
10 Correct 308 ms 43516 KB Output is correct
11 Correct 458 ms 43700 KB Output is correct
12 Correct 390 ms 43616 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 9 ms 1028 KB Output is correct
42 Correct 7 ms 1488 KB Output is correct
43 Correct 4 ms 848 KB Output is correct
44 Correct 8 ms 980 KB Output is correct
45 Correct 5 ms 968 KB Output is correct
46 Correct 6 ms 1452 KB Output is correct
47 Correct 6 ms 1372 KB Output is correct
48 Correct 6 ms 1440 KB Output is correct
49 Correct 6 ms 1444 KB Output is correct
50 Correct 6 ms 1360 KB Output is correct
51 Correct 7 ms 1372 KB Output is correct
52 Correct 8 ms 1360 KB Output is correct
53 Correct 6 ms 1456 KB Output is correct
54 Correct 5 ms 1364 KB Output is correct
55 Correct 6 ms 1360 KB Output is correct
56 Correct 6 ms 1360 KB Output is correct
57 Correct 6 ms 1408 KB Output is correct
58 Correct 5 ms 1360 KB Output is correct
59 Correct 6 ms 1372 KB Output is correct
60 Correct 5 ms 1344 KB Output is correct
61 Correct 5 ms 1360 KB Output is correct
62 Correct 209 ms 34280 KB Output is correct
63 Correct 318 ms 20808 KB Output is correct
64 Correct 406 ms 18936 KB Output is correct
65 Correct 712 ms 43648 KB Output is correct
66 Correct 520 ms 47160 KB Output is correct
67 Correct 713 ms 48408 KB Output is correct
68 Correct 241 ms 43424 KB Output is correct
69 Correct 242 ms 43580 KB Output is correct
70 Correct 242 ms 43632 KB Output is correct
71 Correct 239 ms 43680 KB Output is correct
72 Correct 461 ms 43876 KB Output is correct
73 Correct 538 ms 44292 KB Output is correct
74 Correct 470 ms 43732 KB Output is correct
75 Correct 595 ms 43980 KB Output is correct
76 Correct 215 ms 34352 KB Output is correct
77 Correct 204 ms 13768 KB Output is correct
78 Correct 241 ms 15464 KB Output is correct
79 Correct 521 ms 43664 KB Output is correct
80 Correct 464 ms 43736 KB Output is correct
81 Correct 529 ms 43700 KB Output is correct
82 Correct 257 ms 43716 KB Output is correct
83 Correct 239 ms 43692 KB Output is correct
84 Correct 241 ms 43424 KB Output is correct
85 Correct 308 ms 43516 KB Output is correct
86 Correct 458 ms 43700 KB Output is correct
87 Correct 390 ms 43616 KB Output is correct
88 Correct 425 ms 19980 KB Output is correct
89 Correct 645 ms 47376 KB Output is correct
90 Correct 467 ms 22908 KB Output is correct
91 Correct 529 ms 46796 KB Output is correct
92 Correct 218 ms 17796 KB Output is correct
93 Correct 228 ms 17996 KB Output is correct
94 Correct 542 ms 37080 KB Output is correct
95 Correct 512 ms 48856 KB Output is correct
96 Correct 571 ms 47440 KB Output is correct
97 Correct 526 ms 46804 KB Output is correct
98 Correct 543 ms 46732 KB Output is correct
99 Correct 558 ms 46648 KB Output is correct
100 Correct 510 ms 46656 KB Output is correct
101 Correct 236 ms 46636 KB Output is correct
102 Correct 258 ms 46536 KB Output is correct
103 Correct 257 ms 46784 KB Output is correct
104 Correct 312 ms 46540 KB Output is correct
105 Correct 349 ms 46556 KB Output is correct
106 Correct 251 ms 46544 KB Output is correct
107 Correct 305 ms 46664 KB Output is correct
108 Correct 555 ms 46528 KB Output is correct
109 Correct 403 ms 46692 KB Output is correct
110 Correct 505 ms 46944 KB Output is correct
111 Correct 485 ms 46808 KB Output is correct
112 Correct 336 ms 46688 KB Output is correct
113 Correct 547 ms 46636 KB Output is correct
114 Correct 464 ms 46636 KB Output is correct
115 Correct 275 ms 46720 KB Output is correct
116 Correct 241 ms 46564 KB Output is correct
117 Correct 230 ms 46536 KB Output is correct
118 Correct 222 ms 46600 KB Output is correct
119 Correct 286 ms 46644 KB Output is correct
120 Correct 279 ms 46588 KB Output is correct