제출 #954380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954380		vjudge1	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9058 ms	12932 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
#define endl '\n'
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
using namespace std;
using ii = pair<int,int>; using ll = long long; using ull = unsigned long long;
using vi = vector<int>;
void valid(int in){cout<<((in)?"YES\n":"NO\n");return;}
const int N = 1e5 + 5e4 + 7;
vi arr; multiset<int> st;
int ans = 0;int tam = 0;
void init(int n, int l, int X[]){tam = l;
    fo(i,n){arr.pb(X[i]); st.insert(arr[i]);}
}
int update(int idx, int val){
    st.erase(st.find(arr[idx]));ans=0;
    st.insert(val);arr[idx] = val;
    int last = -1e9 - 5;
    for(int v : st){
        if(last+tam <v){last = v; ans++;}
    }return ans;
}

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