제출 #1331283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1331283		Mamikonm1	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	50 / 100	9088 ms	1976 KiB

elephants

#pragma GCC optimize("Ofast")
#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
vector<int>x,Y;
void init(int N, int L, int X[])
{
    n = N;
    l=L;
    for(int i=0;i<n;++i)Y.push_back(X[i]);
    x=Y;
    sort(begin(x),end(x));
}

int update(int i, int y)
{
    int id;
    for(int j=0;j<n;++j)if(x[j]==Y[i]){
        id=j;
        break;
    }
    if(Y[i]>y){
        int j=id-1;
        while(j>=0 and x[j]>y){
            x[j+1]=x[j];
            --j;
        }
        x[j+1]=y;
    }
    else if(Y[i]!=y){
        int j=id+1;
        while(j<n and x[j]<y){
            x[j-1]=x[j];
            ++j;
        }
        x[j-1]=y;
    }
    Y[i]=y;
    int ans=0,lf=-(l*2);
    for(int i=0;i<n;++i){
        if(x[i]-lf>l){
            lf=x[i];
            ans++;
        }
    }
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3