제출 #104530

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104530		figter001	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	0 / 100	2 ms	384 KiB

elephants

// #include "grader.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;

int n,l;
vector<int> a;

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

int update(int x, int y){
	vector<int> tmp;
	for(int i=0;i<n;i++){
		if(i == x)
			continue;
		if(a[i] >= y && y != -1){
			tmp.push_back(y);
			y = -1;
		}
		tmp.push_back(a[i]);
	}
	if(tmp.size() != a.size())
		tmp.push_back(y);
	a = tmp;
	int ans = 0;
	int to = -1;
	for(int it : a){
		if(it > to){
			to = it+l;
			ans++;
		}
	}
	return ans;
}

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