답안 #197099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197099 2020-01-18T15:38:50 Z stefdasca 코끼리 (Dancing Elephants) (IOI11_elephants) C++14
100 / 100
6350 ms 17088 KB
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=150000, B=550, mxBC=300;
int n, l, *x, uc, bc, r[mxBC];
map<int, int> mp;
vector<int> v[mxBC];
vector<array<int, 2>> w[mxBC];

void init(int N, int L, int X[])
{
    n=N, l=L, x=X;
    for(int i=0; i<n; ++i)
        ++mp[x[i]];
}

void bb(int i)
{
    w[i]=vector<array<int, 2>>(v[i].size());
    for(int j1=(int)v[i].size()-1, j2=v[i].size(); ~j1; --j1)
    {
        while(v[i][j2-1]>v[i][j1]+l)
            --j2;
        w[i][j1]=j2<v[i].size()?array<int, 2> {w[i][j2][0]+1, w[i][j2][1]}:
                 array<int, 2> {1, v[i][j1]+l};
    }
}
void bld()
{
    bc=0;
    for(pair<int, int> p : mp)
    {
        if(!bc||v[bc-1].size()>=B)
            v[bc++].clear();
        v[bc-1].push_back(p.first);
    }
    for(int i=0; i<bc; ++i)
    {
        r[i]=i+1<bc?v[i+1][0]-1:1e9;
        bb(i);
    }
}

void upd(int x, bool a)
{
    int c=-1;
    while(x>r[++c]);
    int p=lower_bound(v[c].begin(), v[c].end(), x)-v[c].begin();
    if(a)
        v[c].insert(v[c].begin()+p, x);
    else
        v[c].erase(v[c].begin()+p);
    bb(c);
}

int update(int i, int y)
{
    if(uc++%B==0)
        bld();
    --mp[x[i]];
    if(!mp[x[i]])
    {
        upd(x[i], 0);
        mp.erase(x[i]);
    }
    if(!mp[y])
        upd(y, 1);
    ++mp[y];
    x[i]=y;
    int a=0;
    for(int i=0, c=-1; i<bc; ++i)
    {
        int p=upper_bound(v[i].begin(), v[i].end(), c)-v[i].begin();
        if(p<v[i].size())
        {
            a+=w[i][p][0];
            c=w[i][p][1];
        }
    }
    return a;
}

Compilation message

elephants.cpp: In function 'void bb(int)':
elephants.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         w[i][j1]=j2<v[i].size()?array<int, 2> {w[i][j2][0]+1, w[i][j2][1]}:
                  ~~^~~~~~~~~~~~
elephants.cpp: In function 'int update(int, int)':
elephants.cpp:75:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(p<v[i].size())
            ~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 525 ms 1912 KB Output is correct
8 Correct 534 ms 2220 KB Output is correct
9 Correct 513 ms 4300 KB Output is correct
10 Correct 544 ms 4420 KB Output is correct
11 Correct 549 ms 4472 KB Output is correct
12 Correct 919 ms 4472 KB Output is correct
13 Correct 501 ms 4216 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 525 ms 1912 KB Output is correct
8 Correct 534 ms 2220 KB Output is correct
9 Correct 513 ms 4300 KB Output is correct
10 Correct 544 ms 4420 KB Output is correct
11 Correct 549 ms 4472 KB Output is correct
12 Correct 919 ms 4472 KB Output is correct
13 Correct 501 ms 4216 KB Output is correct
14 Correct 308 ms 2764 KB Output is correct
15 Correct 827 ms 2812 KB Output is correct
16 Correct 1483 ms 4632 KB Output is correct
17 Correct 1520 ms 6240 KB Output is correct
18 Correct 1675 ms 6156 KB Output is correct
19 Correct 849 ms 5880 KB Output is correct
20 Correct 1657 ms 6316 KB Output is correct
21 Correct 1614 ms 6100 KB Output is correct
22 Correct 781 ms 5872 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 525 ms 1912 KB Output is correct
8 Correct 534 ms 2220 KB Output is correct
9 Correct 513 ms 4300 KB Output is correct
10 Correct 544 ms 4420 KB Output is correct
11 Correct 549 ms 4472 KB Output is correct
12 Correct 919 ms 4472 KB Output is correct
13 Correct 501 ms 4216 KB Output is correct
14 Correct 308 ms 2764 KB Output is correct
15 Correct 827 ms 2812 KB Output is correct
16 Correct 1483 ms 4632 KB Output is correct
17 Correct 1520 ms 6240 KB Output is correct
18 Correct 1675 ms 6156 KB Output is correct
19 Correct 849 ms 5880 KB Output is correct
20 Correct 1657 ms 6316 KB Output is correct
21 Correct 1614 ms 6100 KB Output is correct
22 Correct 781 ms 5872 KB Output is correct
23 Correct 4043 ms 12228 KB Output is correct
24 Correct 4138 ms 12280 KB Output is correct
25 Correct 3095 ms 12088 KB Output is correct
26 Correct 3092 ms 12208 KB Output is correct
27 Correct 3366 ms 12156 KB Output is correct
28 Correct 2147 ms 2796 KB Output is correct
29 Correct 2053 ms 2924 KB Output is correct
30 Correct 2149 ms 2900 KB Output is correct
31 Correct 2067 ms 2780 KB Output is correct
32 Correct 3625 ms 12280 KB Output is correct
33 Correct 1225 ms 12376 KB Output is correct
34 Correct 2909 ms 12096 KB Output is correct
35 Correct 1387 ms 12092 KB Output is correct
36 Correct 85 ms 2760 KB Output is correct
37 Correct 2881 ms 12448 KB Output is correct
38 Correct 3063 ms 12244 KB Output is correct
39 Correct 2880 ms 12028 KB Output is correct
40 Correct 3310 ms 12152 KB Output is correct
41 Correct 5886 ms 12424 KB Output is correct
42 Correct 6350 ms 17088 KB Output is correct