oj.uz

답안 #754123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754123 2023-06-06T18:08:03 Z nicksms 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
100 / 100
 5144 ms 7344 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include "elephants.h"
/**
 *      Author:  Nicholas Winschel
 *      Created: 06.06.2023 11:07:24
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

int n,l;
const int MAXN=150000;
const int BS=950;
int pos[MAXN],j[MAXN],h[MAXN],ord[MAXN],w[MAXN];
int buck[MAXN/BS + 5][3*BS+1],s[MAXN/BS+5];
int cnt = 0;

int llt(int v, int x) {
  if (!s[v] || pos[buck[v][0]] >= x) return -1;
  int l = 0,r=s[v];
  while (r-l>1) {
    int m = (l+r)>>1;
    if (pos[buck[v][m]] >= x) r=m;
    else l=m;
  }
  return l;
}

void fixbuck(int i, int hint=0) {
  if (s[i]>=2*1100) cnt=2*BS;
  // cerr << "fb: " << i << endl;
  // for (int x =0; x < s[i]; x++) cerr << buck[i][x] << " ";
  // cerr << endl;
  if (!s[i] || hint >= s[i]) return;
  j[buck[i][0]]=pos[buck[i][0]]-l,h[buck[i][0]]=1;
  int lp = 0;
  if (hint > 10) lp = max(lp, llt(i,pos[buck[i][hint]]-l));
  for (int k = max(1,hint); k < s[i]; k++) {
    while (lp < s[i]-1 && pos[buck[i][lp+1]]<pos[buck[i][k]]-l) lp++;
    if (pos[buck[i][lp]] < pos[buck[i][k]]-l) {
      // cerr << "test" << endl;
      j[buck[i][k]]=j[buck[i][lp]];
      h[buck[i][k]]=h[buck[i][lp]]+1;
    } else {
      j[buck[i][k]]=pos[buck[i][k]]-l;
      h[buck[i][k]]=1;
    }
  }
}

void fixall() {
  // cerr << "REALLOC" << endl;
  int cur = 0;
  for (int i = 0; i <= (n-1)/BS; i++) {
    for (int x = 0; x < s[i]; x++) ord[cur++]=buck[i][x];
  }
  int c = 0;
  for (int i = 0; i < n; i++) {
    buck[i/BS][c++]=ord[i];
    w[ord[i]]=i/BS;
    if (i == n-1 || (i+1)/BS != i/BS) s[i/BS]=(c),c=0,fixbuck(i/BS);
  }
}

void init(int N, int L, int X[])
{
  n = N;
  l = L;
  memcpy(pos,X,N*sizeof(int));
  for (int i = 0; i < N; i++) {
    buck[i/BS][s[i/BS]++]=(i);
  }
  fixall();
}

int update(int i, int y)
{
  // cerr << "mov: " << i << " " << y << endl;
  if (cnt > BS) fixall(),cnt=0;
  // buck[w[i]].erase(find(buck[w[i]].begin(),buck[w[i]].end(),i));
  int ind = s[w[i]]-1;
  for (int k = llt(w[i],pos[i])+1; k < s[w[i]]-1; k++) {
    if (buck[w[i]][k]==i) {
      ind=k;
      break;
    }
  }
  memmove(buck[w[i]] + ind, buck[w[i]] + ind + 1, (s[w[i]]-ind)*sizeof(int));
  s[w[i]]--;
  fixbuck(w[i],ind);
  pos[i]=y;
  w[i]=0;
  for (int k = 0; k <= (n-1)/BS; k++) {
    if (s[k] && pos[buck[k][0]] < pos[i]) w[i]=k;
  }
  ind = llt(w[i],pos[i])+1;
  // buck[w[i]].insert(buck[w[i]].begin()+ind,i);
  s[w[i]]++;
  // cerr << "dbg2: " << ind << endl;
  // for (int k = s[w[i]]-1; k > ind; k--) {
  //   // cerr << k << " " << buck[w[i]][k] << " " << buck[w[i]][k-1] << endl;
  //   buck[w[i]][k]=buck[w[i]][k-1];
  // }
  memmove(buck[w[i]]+ind+1,buck[w[i]]+ind,(s[w[i]]-ind)*sizeof(int));
  buck[w[i]][ind]=i;
  fixbuck(w[i],ind);
  // for (int i = 0; i < n; i++) {
  //   cerr << "dbg: " << i << " " << pos[i] << " " << j[i] << " " << h[i] << endl; 
  // }
  int cur = 2e9,ret=0;
  for (int i = (n-1)/BS; i >= 0; i--) {
    int ind = llt(i,cur);
    if (ind >= 0) {
      ind=buck[i][ind];
      cur=j[ind],ret += h[ind];
      // cerr << "jmp: " << cur << " " << ret << endl;
    }
  }
  return ret;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 433 ms 1316 KB Output is correct
8 Correct 460 ms 1492 KB Output is correct
9 Correct 489 ms 2516 KB Output is correct
10 Correct 407 ms 2516 KB Output is correct
11 Correct 382 ms 2516 KB Output is correct
12 Correct 812 ms 2572 KB Output is correct
13 Correct 416 ms 2508 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 433 ms 1316 KB Output is correct
8 Correct 460 ms 1492 KB Output is correct
9 Correct 489 ms 2516 KB Output is correct
10 Correct 407 ms 2516 KB Output is correct
11 Correct 382 ms 2516 KB Output is correct
12 Correct 812 ms 2572 KB Output is correct
13 Correct 416 ms 2508 KB Output is correct
14 Correct 504 ms 1872 KB Output is correct
15 Correct 694 ms 1896 KB Output is correct
16 Correct 1251 ms 3008 KB Output is correct
17 Correct 1380 ms 3508 KB Output is correct
18 Correct 1465 ms 3416 KB Output is correct
19 Correct 981 ms 3376 KB Output is correct
20 Correct 1366 ms 3388 KB Output is correct
21 Correct 1366 ms 3636 KB Output is correct
22 Correct 753 ms 3380 KB Output is correct

Subtask #5
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 433 ms 1316 KB Output is correct
8 Correct 460 ms 1492 KB Output is correct
9 Correct 489 ms 2516 KB Output is correct
10 Correct 407 ms 2516 KB Output is correct
11 Correct 382 ms 2516 KB Output is correct
12 Correct 812 ms 2572 KB Output is correct
13 Correct 416 ms 2508 KB Output is correct
14 Correct 504 ms 1872 KB Output is correct
15 Correct 694 ms 1896 KB Output is correct
16 Correct 1251 ms 3008 KB Output is correct
17 Correct 1380 ms 3508 KB Output is correct
18 Correct 1465 ms 3416 KB Output is correct
19 Correct 981 ms 3376 KB Output is correct
20 Correct 1366 ms 3388 KB Output is correct
21 Correct 1366 ms 3636 KB Output is correct
22 Correct 753 ms 3380 KB Output is correct
23 Correct 3459 ms 6824 KB Output is correct
24 Correct 3727 ms 6860 KB Output is correct
25 Correct 3028 ms 6816 KB Output is correct
26 Correct 3132 ms 6824 KB Output is correct
27 Correct 4775 ms 6828 KB Output is correct
28 Correct 2135 ms 2252 KB Output is correct
29 Correct 2068 ms 2244 KB Output is correct
30 Correct 2422 ms 2244 KB Output is correct
31 Correct 2110 ms 2244 KB Output is correct
32 Correct 3083 ms 6824 KB Output is correct
33 Correct 1684 ms 6804 KB Output is correct
34 Correct 2943 ms 6820 KB Output is correct
35 Correct 2273 ms 7344 KB Output is correct
36 Correct 1667 ms 6828 KB Output is correct
37 Correct 4203 ms 7280 KB Output is correct
38 Correct 2861 ms 6824 KB Output is correct
39 Correct 3505 ms 6820 KB Output is correct
40 Correct 2932 ms 6824 KB Output is correct
41 Correct 5049 ms 7344 KB Output is correct
42 Correct 5144 ms 6872 KB Output is correct