제출 #26970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
26970		repeating	코끼리 (Dancing Elephants) (IOI11_elephants)	C++11	0 / 100	9000 ms	19264 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%I64d",&x)
#define SF2(x,y) scanf("%I64d%I64d",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()
#define MAX_R  1000000

using namespace std;
const long long INF = 1e9+5e8;
const int MX=109;


int n;
vector<int> v;
int l;
void init(int N, int L, int X[])
{
  n = N;
  for(int i=0;i<n;i++)
    v.pb(X[i]);
}

int update(int x, int y)
{
    for(auto &i : v){
        if(i==x){i=y;break;}
    }
    sort(all(v));
    ll ret=0;
    int ind=v[0];
    W(1){
        ret++;
        auto a=upper_bound(all(v),ind+l-1);
        if(a==v.end())break;
        ind=*a;
    }
    return ret;
}

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