oj.uz

답안 #887363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887363 2023-12-14T10:03:32 Z abcvuitunggio 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
100 / 100
 3767 ms 11964 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
const int sz=701,sz2=266,maxN=150000;
int n,l,x[maxN+1],idx[maxN+1],q,pos[maxN+1];
pair <int, int> nxt[maxN/sz+1][sz+sz2+1];
vector <int> v[maxN/sz+1];
void calc(int k){
    if (v[k].empty())
        return;
    int j=v[k].size()-1;
    for (int i=j;i>=0;i--){
        while (x[v[k][i]]+l<x[v[k][j]])
            j--;
        if (j==v[k].size()-1)
            nxt[k][i]={i,0};
        else{
            j++;
            nxt[k][i]={nxt[k][j].first,nxt[k][j].second+1};
        }
    }
}
void init(int N, int L, int X[]){
    n=N,l=L;
    for (int i=0;i<n;i++){
        x[i]=X[i];
        idx[i]=i;
    }
    sort(idx,idx+n,[](int i, int j){return x[i]<x[j];});
    for (int i=0;i*sz<n;i++){
        v[i].clear();
        for (int j=i*sz;j<min(i*sz+sz,n);j++){
            v[i].push_back(idx[j]);
            pos[idx[j]]=i;
        }
        calc(i);
    }
}
void reinit(){
    int j=0;
    for (int i=0;i*sz<n;i++){
        for (int k:v[i]){
            idx[j]=k;
            j++;
        }
    }
    for (int i=0;i*sz<n;i++){
        v[i].clear();
        for (int j=i*sz;j<min(i*sz+sz,n);j++){
            v[i].push_back(idx[j]);
            pos[idx[j]]=i;
        }
        calc(i);
    }
}
int update(int i, int y){
    q++;
    if (q%sz2==0)
        reinit();
    vector <int> tmp;
    int c=0;
    for (int j:v[pos[i]]){
        if (j!=i||c)
            tmp.push_back(j);
        else
            c=1;
    }
    swap(tmp,v[pos[i]]);
    calc(pos[i]);
    tmp.clear();
    x[i]=y;
    int newpos=-1;
    for (int j=0;j*sz<n;j++){
        int l=(j?x[v[j-1].back()]:-1),r=(j*sz+sz<n&&!v[j+1].empty()?x[v[j+1][0]]:1000000001);
        if (l<=y&&y<=r){
            newpos=j;
            break;
        }
    }
    pos[i]=newpos;
    c=0;
    for (int j:v[newpos]){
        if (x[j]>=y&&!c){
            tmp.push_back(i);
            c=1;
        }
        tmp.push_back(j);
    }
    if (!c)
        tmp.push_back(i);
    swap(v[newpos],tmp);
    calc(newpos);
    int j=0,cur=0,res=0,block=0;
    while (true){
        res+=nxt[block][cur].second;
        cur=nxt[block][cur].first;
        res++;
        j=max(j,block+1);
        while (j<=(n-1)/sz){
            if (v[j].empty()||x[v[j].back()]<=x[v[block][cur]]+l){
                j++;
                continue;
            }
            break;
        }
        if (j>(n-1)/sz)
            break;
        int lo=0,hi=v[j].size()-1,kq=-1;
        while (lo<=hi){
            int mid=(lo+hi)>>1;
            if (x[v[j][mid]]>x[v[block][cur]]+l){
                kq=mid;
                hi=mid-1;
            }
            else
                lo=mid+1;
        }
        cur=kq;
        block=j;
    }
    return res;
}

Compilation message

elephants.cpp: In function 'void calc(int)':
elephants.cpp:15:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         if (j==v[k].size()-1)
      |             ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10988 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 10584 KB Output is correct
7 Correct 348 ms 10892 KB Output is correct
8 Correct 372 ms 10960 KB Output is correct
9 Correct 408 ms 11148 KB Output is correct
10 Correct 317 ms 11212 KB Output is correct
11 Correct 277 ms 11148 KB Output is correct
12 Correct 679 ms 11168 KB Output is correct
13 Correct 301 ms 11100 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10988 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 10584 KB Output is correct
7 Correct 348 ms 10892 KB Output is correct
8 Correct 372 ms 10960 KB Output is correct
9 Correct 408 ms 11148 KB Output is correct
10 Correct 317 ms 11212 KB Output is correct
11 Correct 277 ms 11148 KB Output is correct
12 Correct 679 ms 11168 KB Output is correct
13 Correct 301 ms 11100 KB Output is correct
14 Correct 442 ms 10840 KB Output is correct
15 Correct 525 ms 10960 KB Output is correct
16 Correct 1210 ms 11160 KB Output is correct
17 Correct 1169 ms 11264 KB Output is correct
18 Correct 1294 ms 11092 KB Output is correct
19 Correct 562 ms 11264 KB Output is correct
20 Correct 1183 ms 11256 KB Output is correct
21 Correct 1102 ms 11468 KB Output is correct
22 Correct 579 ms 11348 KB Output is correct

Subtask #5
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10988 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 10584 KB Output is correct
7 Correct 348 ms 10892 KB Output is correct
8 Correct 372 ms 10960 KB Output is correct
9 Correct 408 ms 11148 KB Output is correct
10 Correct 317 ms 11212 KB Output is correct
11 Correct 277 ms 11148 KB Output is correct
12 Correct 679 ms 11168 KB Output is correct
13 Correct 301 ms 11100 KB Output is correct
14 Correct 442 ms 10840 KB Output is correct
15 Correct 525 ms 10960 KB Output is correct
16 Correct 1210 ms 11160 KB Output is correct
17 Correct 1169 ms 11264 KB Output is correct
18 Correct 1294 ms 11092 KB Output is correct
19 Correct 562 ms 11264 KB Output is correct
20 Correct 1183 ms 11256 KB Output is correct
21 Correct 1102 ms 11468 KB Output is correct
22 Correct 579 ms 11348 KB Output is correct
23 Correct 2485 ms 11720 KB Output is correct
24 Correct 2656 ms 11960 KB Output is correct
25 Correct 1874 ms 11604 KB Output is correct
26 Correct 2202 ms 11964 KB Output is correct
27 Correct 2124 ms 11724 KB Output is correct
28 Correct 1662 ms 10836 KB Output is correct
29 Correct 1617 ms 10588 KB Output is correct
30 Correct 1661 ms 10756 KB Output is correct
31 Correct 1623 ms 10768 KB Output is correct
32 Correct 1792 ms 11716 KB Output is correct
33 Correct 1503 ms 11724 KB Output is correct
34 Correct 1918 ms 11720 KB Output is correct
35 Correct 1568 ms 11600 KB Output is correct
36 Correct 1176 ms 11720 KB Output is correct
37 Correct 2753 ms 11612 KB Output is correct
38 Correct 1902 ms 11724 KB Output is correct
39 Correct 1834 ms 11608 KB Output is correct
40 Correct 1883 ms 11724 KB Output is correct
41 Correct 3767 ms 11720 KB Output is correct
42 Correct 3736 ms 11724 KB Output is correct