oj.uz

답안 #346306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346306 2021-01-09T09:41:32 Z casperwang 코끼리 (Dancing Elephants) (IOI11_elephants) C++14
100 / 100
 4243 ms 9512 KB 
#include "elephants.h"
#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
#define pb push_back
#define All(x) x.begin(), x.end()
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
 
const int MAXN = 150000;
const int INF = 1e9;
const int K = 387;
int n, m, seg;
int max_sze;
vector <pii> a;
vector <vector<pii>> B;
vector <pii> rng;
vector <int> pos;
vector <pii> info;
 
void build_block(int id, bool flag) {
  int len = B[id].size();
  if (!len) {
    rng[id] = pii(id==0 ? -INF : rng[id-1].ss, id==m-1 ? INF : rng[id+1].ff);
    return;
  }
  if (flag) {
    for (int i = len-1; i >= 1; i--) {
      if (B[id][i].ff < B[id][i-1].ff) {
        swap(B[id][i], B[id][i-1]);
      } else break;
    }
  }
  int nowR = len-1;
  for (int i = len-1; i >= 0; i--) {
    pos[B[id][i].ss] = id;
    if (B[id][i].ff + seg >= B[id][len-1].ff) {
      info[B[id][i].ss].ff = 1;
      info[B[id][i].ss].ss = B[id][i].ff + seg;
    } else {
      while (nowR && B[id][i].ff + seg < B[id][nowR-1].ff) nowR--;
      info[B[id][i].ss].ff = info[B[id][nowR].ss].ff + 1;
      info[B[id][i].ss].ss = info[B[id][nowR].ss].ss;
    }
  }
  rng[id] = pii(B[id][0].ff, B[id][len-1].ff);
  max_sze = max(max_sze, len);
}
 
void first_build() {
  sort(All(a));
  for (int i = 0; i < m; i++)
    B[i].clear();
  for (int i = 0; i < n; i++)
    B[i/K].pb(a[i]);
  for (int i = 0; i < m; i++)
    build_block(i, false);
  sort(All(a), [](const pii x, const pii y) {
    return x.ss < y.ss;
  });
}

void build() {
  vector <pii> tmp(n);
  int c = 0;
  for (int i = 0; i < m; i++) {
    for (pii p : B[i]) tmp[c++] = p;
    B[i].clear();
  }
  for (int i = 0; i < n; i++)
    B[i/K].pb(tmp[i]);
  for (int i = 0; i < m; i++)
    build_block(i, false);
}
 
int solve() {
  int ans = 0, now = -1;
  for (int i = 0; i < m; i++) {
    if (!B[i].size() || B[i][B[i].size()-1].ff <= now) continue;
    pii tmp = *upper_bound(All(B[i]), pii(now, n+1));
    ans += info[tmp.ss].ff;
    now = info[tmp.ss].ss;
  }
  return ans;
}
 
void init(int N, int L, int X[]) {
  n = N, m = (n-1)/K+1, seg = L;
  a.clear(), a.resize(n);
  pos.clear(), pos.resize(n);
  info.clear(), info.resize(n);
  B.clear(), B.resize(m);
  rng.clear(), rng.resize(m);
  for (int i = 0; i < n; i++)
    a[i].ff = X[i], a[i].ss = i;
  first_build();
}
 
int update(int i, int y) {
  a[i].ff = y;
  if (max_sze > 5*K/2) max_sze = 0, build();
  int id = pos[i];
  for (int j = 0; j < (int)B[id].size(); j++) {
    if (B[id][j].ss == i) {
      B[id].erase(B[id].begin()+j);
      break;
    }
  }
  for (int j = 0; j < m; j++) {
    if ((!j || rng[j-1].ss <= y) && (j==m-1 || rng[j+1].ff >= y)) {
      B[j].pb(a[i]);
      pos[i] = j;
      build_block(j, a[i].ff < rng[j].ss);
      if (id != j)
        build_block(id, 0);
      break;
    }
  }
  return solve();
}

Compilation message

elephants.cpp:3: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
    3 | #pragma gcc optimize("Ofast")
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 350 ms 1516 KB Output is correct
8 Correct 365 ms 1516 KB Output is correct
9 Correct 364 ms 2668 KB Output is correct
10 Correct 486 ms 3052 KB Output is correct
11 Correct 478 ms 3052 KB Output is correct
12 Correct 827 ms 3156 KB Output is correct
13 Correct 565 ms 3168 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 350 ms 1516 KB Output is correct
8 Correct 365 ms 1516 KB Output is correct
9 Correct 364 ms 2668 KB Output is correct
10 Correct 486 ms 3052 KB Output is correct
11 Correct 478 ms 3052 KB Output is correct
12 Correct 827 ms 3156 KB Output is correct
13 Correct 565 ms 3168 KB Output is correct
14 Correct 636 ms 2144 KB Output is correct
15 Correct 555 ms 1900 KB Output is correct
16 Correct 1167 ms 2924 KB Output is correct
17 Correct 1204 ms 4212 KB Output is correct
18 Correct 1394 ms 4424 KB Output is correct
19 Correct 978 ms 4168 KB Output is correct
20 Correct 1229 ms 4212 KB Output is correct
21 Correct 1285 ms 4168 KB Output is correct
22 Correct 1039 ms 4168 KB Output is correct

Subtask #5
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 350 ms 1516 KB Output is correct
8 Correct 365 ms 1516 KB Output is correct
9 Correct 364 ms 2668 KB Output is correct
10 Correct 486 ms 3052 KB Output is correct
11 Correct 478 ms 3052 KB Output is correct
12 Correct 827 ms 3156 KB Output is correct
13 Correct 565 ms 3168 KB Output is correct
14 Correct 636 ms 2144 KB Output is correct
15 Correct 555 ms 1900 KB Output is correct
16 Correct 1167 ms 2924 KB Output is correct
17 Correct 1204 ms 4212 KB Output is correct
18 Correct 1394 ms 4424 KB Output is correct
19 Correct 978 ms 4168 KB Output is correct
20 Correct 1229 ms 4212 KB Output is correct
21 Correct 1285 ms 4168 KB Output is correct
22 Correct 1039 ms 4168 KB Output is correct
23 Correct 2537 ms 7148 KB Output is correct
24 Correct 2709 ms 7264 KB Output is correct
25 Correct 2263 ms 7264 KB Output is correct
26 Correct 3851 ms 8556 KB Output is correct
27 Correct 4243 ms 8480 KB Output is correct
28 Correct 2281 ms 2412 KB Output is correct
29 Correct 2339 ms 2548 KB Output is correct
30 Correct 2304 ms 2412 KB Output is correct
31 Correct 2291 ms 2540 KB Output is correct
32 Correct 2716 ms 8464 KB Output is correct
33 Correct 2186 ms 8448 KB Output is correct
34 Correct 2838 ms 8448 KB Output is correct
35 Correct 2444 ms 9512 KB Output is correct
36 Correct 2202 ms 8532 KB Output is correct
37 Correct 3452 ms 7976 KB Output is correct
38 Correct 3754 ms 8532 KB Output is correct
39 Correct 3134 ms 8660 KB Output is correct
40 Correct 3603 ms 8528 KB Output is correct
41 Correct 3945 ms 8556 KB Output is correct
42 Correct 3972 ms 8540 KB Output is correct