oj.uz

Submission #518337

# Submission time Handle Problem Language Result Execution time Memory
518337 2022-01-23T12:34:25 Z cig32 Financial Report (JOI21_financial) C++17
31 / 100
 736 ms 51288 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";
      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";
}

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 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 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 0 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 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 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 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 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 0 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 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 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 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Incorrect 1 ms 332 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 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 0 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 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 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 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Incorrect 1 ms 332 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 37272 KB Output is correct
2 Correct 284 ms 23452 KB Output is correct
3 Correct 391 ms 21856 KB Output is correct
4 Correct 736 ms 46672 KB Output is correct
5 Correct 486 ms 50040 KB Output is correct
6 Correct 736 ms 51288 KB Output is correct
7 Correct 263 ms 46268 KB Output is correct
8 Correct 275 ms 46556 KB Output is correct
9 Correct 227 ms 46544 KB Output is correct
10 Correct 235 ms 46524 KB Output is correct
11 Correct 439 ms 46800 KB Output is correct
12 Correct 472 ms 47136 KB Output is correct
13 Correct 488 ms 46688 KB Output is correct
14 Correct 586 ms 46984 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 37572 KB Output is correct
2 Correct 206 ms 16628 KB Output is correct
3 Correct 240 ms 18500 KB Output is correct
4 Correct 517 ms 46680 KB Output is correct
5 Correct 402 ms 46532 KB Output is correct
6 Correct 499 ms 46632 KB Output is correct
7 Correct 231 ms 46728 KB Output is correct
8 Correct 231 ms 46644 KB Output is correct
9 Correct 232 ms 46272 KB Output is correct
10 Correct 320 ms 46592 KB Output is correct
11 Correct 516 ms 46628 KB Output is correct
12 Correct 428 ms 46588 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 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 0 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 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 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 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Incorrect 1 ms 332 KB Output isn't correct
29 Halted 0 ms 0 KB -