제출 #1025044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025044		mindiyak	코끼리 (Dancing Elephants) (IOI11_elephants)	C++14	50 / 100	9059 ms	5332 KiB

elephants

#include "elephants.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
int N,L;
int arr[1000000];
int idx[1000000];
 
void init(int n, int l, int X[])
{
  N=n;L=l;
  vpi arr2;
  FOR(i,0,N){
    arr2.pb({X[i],i});
  }
  FOR(i,0,N){
    arr[i] = arr2[i].F;
    idx[i] = arr2[i].S;
  }
}
 
int update(int p, int y)
{
  int pos = 0;
  FOR(i,0,N){
    if(idx[i] == p){
      pos = i;
      break;
    }
  }

  arr[pos] = y;

  while (pos+1 < N && arr[pos] > arr[pos+1]) {
		swap(arr[pos], arr[pos+1]);
		swap(idx[pos], idx[pos+1]);
		pos++;
	}
	while (pos-1 >= 0 && arr[pos] < arr[pos-1]) {
		swap(arr[pos], arr[pos-1]);
		swap(idx[pos], idx[pos-1]);
		pos--;
	}

  int ans = 0,start = -1;
  FOR(i,0,N){
    if(ans == 0 || arr[i] > start+L){
      ans ++;
      start = arr[i];
    }
  }

  return ans;
}

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